YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:49:07,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:49:07,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:49:07,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:49:07,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:49:07,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:49:07,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:49:07,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:49:07,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:49:07,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:49:07,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:49:07,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:49:07,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:49:07,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:49:07,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:49:07,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:49:07,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:49:07,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:49:07,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:49:07,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:49:07,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:49:07,474 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:49:07,476 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:49:07,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:49:07,477 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:49:07,477 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:49:07,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:49:07,479 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:49:07,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:49:07,480 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:49:07,480 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:49:07,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:49:07,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:49:07,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:49:07,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:49:07,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:49:07,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:49:07,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:49:07,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:49:07,485 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:49:07,499 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:49:07,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:49:07,500 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:49:07,500 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:49:07,500 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:49:07,500 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:49:07,501 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:49:07,501 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:49:07,501 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:49:07,501 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:49:07,501 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:49:07,501 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:49:07,502 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:49:07,502 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:49:07,502 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:49:07,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:49:07,502 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:49:07,502 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:49:07,503 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:49:07,503 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:49:07,503 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:49:07,503 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:49:07,503 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:49:07,503 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:49:07,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:49:07,504 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:49:07,504 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:49:07,504 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:49:07,504 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:49:07,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:49:07,542 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:49:07,546 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:49:07,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:49:07,548 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:49:07,548 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:49:07,611 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/2f8818f0e81f476ab2c9f83565e3e6ae/FLAGf8d4795ab !SESSION 2020-06-22 09:49:05.115 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-06-22 09:49:07.892 !MESSAGE Indexed 'FLAGf8d4795ab' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-06-22 09:49:07,957 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:49:07,957 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:49:07,958 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:49:07,964 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/2f8818f0e81f476ab2c9f83565e3e6ae/FLAGf8d4795ab [2020-06-22 09:49:08,415 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/2f8818f0e81f476ab2c9f83565e3e6ae [2020-06-22 09:49:08,426 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:49:08,428 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:49:08,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:49:08,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:49:08,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:49:08,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c455890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08, skipping insertion in model container [2020-06-22 09:49:08,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:49:08,460 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:49:08,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:49:08,678 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:49:08,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:49:08,709 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:49:08,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08 WrapperNode [2020-06-22 09:49:08,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:49:08,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:49:08,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:49:08,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:49:08,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:49:08,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:49:08,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:49:08,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:49:08,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... [2020-06-22 09:49:08,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:49:08,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:49:08,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:49:08,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:49:08,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:49:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:49:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:49:08,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:49:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:49:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:49:08,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:49:09,063 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:49:09,063 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 09:49:09,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:09 BoogieIcfgContainer [2020-06-22 09:49:09,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:49:09,065 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:49:09,065 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:49:09,067 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:49:09,068 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:09" (1/1) ... [2020-06-22 09:49:09,085 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 36 edges [2020-06-22 09:49:09,086 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:49:09,087 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:49:09,087 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:49:09,088 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:49:09,089 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:49:09,091 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:49:09,091 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:49:09,116 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:49:09,149 INFO L200 BlockEncoder]: SBE split 17 edges [2020-06-22 09:49:09,154 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:49:09,155 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:49:09,194 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 09:49:09,197 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:49:09,199 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:49:09,199 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:49:09,203 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 09:49:09,204 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:49:09,204 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:49:09,204 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:49:09,205 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:49:09,205 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:49:09,206 INFO L313 BlockEncoder]: Encoded RCFG 26 locations, 45 edges [2020-06-22 09:49:09,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:49:09 BasicIcfg [2020-06-22 09:49:09,207 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:49:09,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:49:09,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:49:09,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:49:09,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:49:08" (1/4) ... [2020-06-22 09:49:09,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd65dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:49:09, skipping insertion in model container [2020-06-22 09:49:09,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (2/4) ... [2020-06-22 09:49:09,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd65dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:49:09, skipping insertion in model container [2020-06-22 09:49:09,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:09" (3/4) ... [2020-06-22 09:49:09,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd65dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:49:09, skipping insertion in model container [2020-06-22 09:49:09,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:49:09" (4/4) ... [2020-06-22 09:49:09,217 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:49:09,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:49:09,234 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-06-22 09:49:09,250 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-06-22 09:49:09,279 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:49:09,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:49:09,296 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:49:09,296 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:49:09,297 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:49:09,297 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:49:09,297 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:49:09,297 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:49:09,297 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:49:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-06-22 09:49:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:49:09,318 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:09,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:49:09,319 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:49:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 111829, now seen corresponding path program 1 times [2020-06-22 09:49:09,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:09,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:09,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:49:09,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:09,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:09,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:09,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:09,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,505 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-06-22 09:49:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:09,627 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-06-22 09:49:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:09,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:49:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:09,642 INFO L225 Difference]: With dead ends: 26 [2020-06-22 09:49:09,642 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:49:09,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:49:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 09:49:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:49:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2020-06-22 09:49:09,682 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 3 [2020-06-22 09:49:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:09,683 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. [2020-06-22 09:49:09,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-06-22 09:49:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:49:09,683 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:09,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:49:09,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:49:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash 111831, now seen corresponding path program 1 times [2020-06-22 09:49:09,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:09,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:49:09,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:09,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:09,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:09,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:09,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,710 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 3 states. [2020-06-22 09:49:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:09,776 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2020-06-22 09:49:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:49:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:09,777 INFO L225 Difference]: With dead ends: 26 [2020-06-22 09:49:09,777 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:49:09,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:49:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 09:49:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:49:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2020-06-22 09:49:09,783 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 3 [2020-06-22 09:49:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:09,783 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-06-22 09:49:09,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-06-22 09:49:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:49:09,784 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:09,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:49:09,784 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:49:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash 111832, now seen corresponding path program 1 times [2020-06-22 09:49:09,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:09,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:49:09,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:09,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:09,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,830 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 3 states. [2020-06-22 09:49:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:09,881 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-06-22 09:49:09,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:09,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:49:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:09,882 INFO L225 Difference]: With dead ends: 22 [2020-06-22 09:49:09,882 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:49:09,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:49:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:49:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:49:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-06-22 09:49:09,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 3 [2020-06-22 09:49:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:09,887 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 09:49:09,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-06-22 09:49:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:49:09,887 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:09,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:49:09,888 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:49:09,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash 3465757, now seen corresponding path program 1 times [2020-06-22 09:49:09,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:49:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:09,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:09,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,935 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. [2020-06-22 09:49:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:09,984 INFO L93 Difference]: Finished difference Result 18 states and 29 transitions. [2020-06-22 09:49:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:09,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:49:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:09,985 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:49:09,985 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 09:49:09,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 09:49:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 09:49:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:49:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-06-22 09:49:09,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 4 [2020-06-22 09:49:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:09,989 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-06-22 09:49:09,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-06-22 09:49:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:49:09,989 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:09,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:49:09,990 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION]=== [2020-06-22 09:49:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 3465754, now seen corresponding path program 1 times [2020-06-22 09:49:09,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:49:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:49:10,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:49:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:49:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:49:10,048 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 4 states. [2020-06-22 09:49:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:10,093 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-06-22 09:49:10,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:10,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 09:49:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:10,094 INFO L225 Difference]: With dead ends: 14 [2020-06-22 09:49:10,094 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:49:10,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:49:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:49:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:49:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:49:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:49:10,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 09:49:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:10,096 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:10,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:49:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:49:10,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:49:10,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:49:10,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 09:49:10,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 09:49:10,124 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 09:49:10,125 INFO L448 ceAbstractionStarter]: For program point L7-4(lines 7 9) no Hoare annotation was computed. [2020-06-22 09:49:10,126 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 09:49:10,126 INFO L448 ceAbstractionStarter]: For program point L7-6(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,126 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,126 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:49:10,126 INFO L444 ceAbstractionStarter]: At program point L7-8(lines 7 9) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~j~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4)) [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 09:49:10,127 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-06-22 09:49:10,128 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:49:10,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:10,137 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:10,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:10,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:10,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:49:10 BasicIcfg [2020-06-22 09:49:10,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:49:10,146 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:49:10,146 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:49:10,149 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:49:10,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:10,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:49:08" (1/5) ... [2020-06-22 09:49:10,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8a7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:49:10, skipping insertion in model container [2020-06-22 09:49:10,150 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:10,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:08" (2/5) ... [2020-06-22 09:49:10,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8a7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:49:10, skipping insertion in model container [2020-06-22 09:49:10,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:10,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:09" (3/5) ... [2020-06-22 09:49:10,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8a7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:10, skipping insertion in model container [2020-06-22 09:49:10,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:10,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:49:09" (4/5) ... [2020-06-22 09:49:10,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8a7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:10, skipping insertion in model container [2020-06-22 09:49:10,152 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:10,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:49:10" (5/5) ... [2020-06-22 09:49:10,153 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:49:10,173 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:49:10,173 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:49:10,173 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:49:10,173 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:49:10,173 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:49:10,173 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:49:10,173 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:49:10,174 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:49:10,174 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:49:10,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-06-22 09:49:10,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:49:10,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:49:10,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:49:10,187 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:49:10,187 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:49:10,187 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:49:10,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2020-06-22 09:49:10,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 09:49:10,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:49:10,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:49:10,190 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 09:49:10,190 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:49:10,195 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [82] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [104] L-1-->L6: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_~j~0.base, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 22#L6true [71] L6-->L6-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~j~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4 1))) (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~j~0.base_4)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~j~0.base_4) 1)) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 20#L6-1true [67] L6-1-->L7-8: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_main_~i~0.base_4) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~i~0.base_4)) (= (store |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 10000)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 11#L7-8true [2020-06-22 09:49:10,196 INFO L796 eck$LassoCheckResult]: Loop: 11#L7-8true [53] L7-8-->L7-1: Formula: (and (= (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem4_2|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5#L7-1true [144] L7-1-->L8: Formula: (and (= 1 (select |v_#valid_35| v_ULTIMATE.start_main_~j~0.base_18)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_14) (<= (+ v_ULTIMATE.start_main_~j~0.offset_14 4) (select |v_#length_24| v_ULTIMATE.start_main_~j~0.base_18)) (<= (+ (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~j~0.base_18) v_ULTIMATE.start_main_~j~0.offset_14) 1) |v_ULTIMATE.start_main_#t~mem4_14|)) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_14, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_18, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_14|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_14, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_18, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_13|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4] 26#L8true [138] L8-->L8-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (= |v_ULTIMATE.start_main_#t~mem6_5| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12)) (= |v_ULTIMATE.start_main_#t~post7_5| |v_ULTIMATE.start_main_#t~mem6_5|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~j~0.base_16)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_20|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 23#L8-2true [141] L8-2-->L7-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~j~0.offset_13) (= (store |v_#memory_int_15| v_ULTIMATE.start_main_~j~0.base_17 (store (select |v_#memory_int_15| v_ULTIMATE.start_main_~j~0.base_17) v_ULTIMATE.start_main_~j~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post7_7| 1))) |v_#memory_int_14|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~j~0.base_17)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_13 4) (select |v_#length_21| v_ULTIMATE.start_main_~j~0.base_17))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_13, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_17, #length=|v_#length_21|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_13, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_17, #length=|v_#length_21|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~post7] 17#L7-4true [142] L7-4-->L7-6: Formula: (and (= |v_ULTIMATE.start_main_#t~mem2_5| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_22| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (= |v_ULTIMATE.start_main_#t~post3_5| |v_ULTIMATE.start_main_#t~mem2_5|) (= (select |v_#valid_33| v_ULTIMATE.start_main_~i~0.base_16) 1)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_33|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_5|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2] 14#L7-6true [143] L7-6-->L7-8: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post3_7| (- 1)))) |v_#memory_int_17|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13) (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_23| v_ULTIMATE.start_main_~i~0.base_17)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~i~0.base_17))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_7|, #length=|v_#length_23|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~mem2, #memory_int] 11#L7-8true [2020-06-22 09:49:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 3468595, now seen corresponding path program 1 times [2020-06-22 09:49:10,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:10,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:10,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1752880384, now seen corresponding path program 1 times [2020-06-22 09:49:10,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:10,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:10,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash 445377202, now seen corresponding path program 1 times [2020-06-22 09:49:10,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:10,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:10,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:10,586 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-06-22 09:49:10,671 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:49:10,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:49:10,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:49:10,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:49:10,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:49:10,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:49:10,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:49:10,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:49:10,673 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:49:10,673 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:49:10,674 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:49:10,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:10,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:49:11,189 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:49:11,194 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:49:11,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:49:11,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:11,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:11,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:11,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:11,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:11,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:11,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:11,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:11,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:49:11,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:11,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:11,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:11,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:11,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:11,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:11,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:11,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:11,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:49:11,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:11,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:11,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:11,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:11,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:11,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:11,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:11,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:11,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:49:11,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:11,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:11,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:11,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:11,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:11,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:11,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:11,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:11,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:49:11,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:11,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:11,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:11,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:11,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:11,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:11,252 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:49:11,263 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:49:11,263 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 09:49:11,266 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:49:11,267 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:49:11,267 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:49:11,268 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 Supporting invariants [] [2020-06-22 09:49:11,298 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 09:49:11,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:49:11,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:49:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:11,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:49:11,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:11,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:49:11,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:11,457 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:49:11,457 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 [2020-06-22 09:49:11,470 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:49:11,502 INFO L497 ElimStorePlain]: treesize reduction 37, result has 45.6 percent of original size [2020-06-22 09:49:11,503 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:49:11,503 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2020-06-22 09:49:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:49:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:11,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:49:11,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:11,690 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:49:11,691 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 09:49:11,699 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:49:11,736 INFO L497 ElimStorePlain]: treesize reduction 47, result has 39.0 percent of original size [2020-06-22 09:49:11,737 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:49:11,737 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-06-22 09:49:11,829 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:49:11,830 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 65 [2020-06-22 09:49:11,835 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:49:11,843 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2020-06-22 09:49:11,843 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:49:11,888 INFO L497 ElimStorePlain]: treesize reduction 55, result has 42.7 percent of original size [2020-06-22 09:49:11,889 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:49:11,889 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:26 [2020-06-22 09:49:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:12,085 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:12,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:49:12,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:12,169 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:49:12,170 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 09:49:12,175 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:49:12,222 INFO L497 ElimStorePlain]: treesize reduction 43, result has 41.9 percent of original size [2020-06-22 09:49:12,223 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:49:12,223 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-06-22 09:49:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:12,354 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:12,354 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 14 predicates after loop cannibalization [2020-06-22 09:49:12,357 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2020-06-22 09:49:12,358 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states. Second operand 7 states. [2020-06-22 09:49:12,931 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states.. Second operand 7 states. Result 58 states and 107 transitions. Complement of second has 20 states. [2020-06-22 09:49:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 8 non-accepting loop states 3 accepting loop states [2020-06-22 09:49:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 09:49:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2020-06-22 09:49:12,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 91 transitions. Stem has 4 letters. Loop has 6 letters. [2020-06-22 09:49:12,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:12,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 91 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 09:49:12,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:12,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 91 transitions. Stem has 4 letters. Loop has 12 letters. [2020-06-22 09:49:12,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:12,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 107 transitions. [2020-06-22 09:49:12,949 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:49:12,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2020-06-22 09:49:12,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:49:12,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:49:12,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:49:12,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:49:12,951 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:12,951 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:12,952 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:12,952 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:49:12,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:49:12,952 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:49:12,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:49:12,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:12 BasicIcfg [2020-06-22 09:49:12,957 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:49:12,958 INFO L168 Benchmark]: Toolchain (without parser) took 4531.01 ms. Allocated memory was 514.9 MB in the beginning and 644.3 MB in the end (delta: 129.5 MB). Free memory was 439.3 MB in the beginning and 500.9 MB in the end (delta: -61.6 MB). Peak memory consumption was 67.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,959 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:49:12,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.99 ms. Allocated memory was 514.9 MB in the beginning and 570.9 MB in the end (delta: 56.1 MB). Free memory was 439.3 MB in the beginning and 539.6 MB in the end (delta: -100.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.37 ms. Allocated memory is still 570.9 MB. Free memory was 539.6 MB in the beginning and 538.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,961 INFO L168 Benchmark]: Boogie Preprocessor took 22.06 ms. Allocated memory is still 570.9 MB. Free memory was 538.0 MB in the beginning and 536.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,961 INFO L168 Benchmark]: RCFGBuilder took 294.31 ms. Allocated memory is still 570.9 MB. Free memory was 536.4 MB in the beginning and 518.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,962 INFO L168 Benchmark]: BlockEncodingV2 took 141.68 ms. Allocated memory is still 570.9 MB. Free memory was 517.6 MB in the beginning and 508.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,962 INFO L168 Benchmark]: TraceAbstraction took 937.26 ms. Allocated memory is still 570.9 MB. Free memory was 507.9 MB in the beginning and 425.4 MB in the end (delta: 82.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:12,963 INFO L168 Benchmark]: BuchiAutomizer took 2812.06 ms. Allocated memory was 570.9 MB in the beginning and 644.3 MB in the end (delta: 73.4 MB). Free memory was 425.4 MB in the beginning and 500.9 MB in the end (delta: -75.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:49:12,967 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 35 locations, 36 edges - StatisticsResult: Encoded RCFG 26 locations, 45 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 280.99 ms. Allocated memory was 514.9 MB in the beginning and 570.9 MB in the end (delta: 56.1 MB). Free memory was 439.3 MB in the beginning and 539.6 MB in the end (delta: -100.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.37 ms. Allocated memory is still 570.9 MB. Free memory was 539.6 MB in the beginning and 538.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.06 ms. Allocated memory is still 570.9 MB. Free memory was 538.0 MB in the beginning and 536.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 294.31 ms. Allocated memory is still 570.9 MB. Free memory was 536.4 MB in the beginning and 518.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 141.68 ms. Allocated memory is still 570.9 MB. Free memory was 517.6 MB in the beginning and 508.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 937.26 ms. Allocated memory is still 570.9 MB. Free memory was 507.9 MB in the beginning and 425.4 MB in the end (delta: 82.5 MB). Peak memory consumption was 82.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2812.06 ms. Allocated memory was 570.9 MB in the beginning and 644.3 MB in the end (delta: 73.4 MB). Free memory was 425.4 MB in the beginning and 500.9 MB in the end (delta: -75.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 09:49:12,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:12,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:12,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:12,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((0 == j && 4 == unknown-#length-unknown[i]) && 1 == \valid[j]) && 0 == i) && 1 == \valid[i]) && unknown-#length-unknown[j] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 16 error locations. SAFE Result, 0.8s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 114 SDslu, 3 SDs, 0 SdLazy, 126 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[i][i] and consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 174 SDslu, 0 SDs, 0 SdLazy, 361 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital211 mio100 ax100 hnf100 lsp95 ukn56 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 55ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:49:13.198 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check