./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:21:42,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:21:42,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:21:42,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:21:42,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:21:42,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:21:42,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:21:42,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:21:42,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:21:42,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:21:42,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:21:42,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:21:42,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:21:42,366 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:21:42,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:21:42,367 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:21:42,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:21:42,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:21:42,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:21:42,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:21:42,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:21:42,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:21:42,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:21:42,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:21:42,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:21:42,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:21:42,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:21:42,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:21:42,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:21:42,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:21:42,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:21:42,379 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:21:42,379 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:21:42,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:21:42,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:21:42,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:21:42,381 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:21:42,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:21:42,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:21:42,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:21:42,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:21:42,393 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:21:42,393 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:21:42,393 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:21:42,393 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:21:42,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:21:42,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:21:42,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:21:42,395 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:21:42,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:21:42,396 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:21:42,396 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:21:42,396 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:21:42,396 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2018-11-23 05:21:42,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:21:42,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:21:42,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:21:42,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:21:42,429 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:21:42,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-23 05:21:42,467 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/data/9856faf03/81889bea623c47a3982330d65c55d4e4/FLAGc404ed71d [2018-11-23 05:21:42,930 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:21:42,930 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/sv-benchmarks/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-23 05:21:42,938 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/data/9856faf03/81889bea623c47a3982330d65c55d4e4/FLAGc404ed71d [2018-11-23 05:21:42,950 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/data/9856faf03/81889bea623c47a3982330d65c55d4e4 [2018-11-23 05:21:42,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:21:42,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:21:42,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:21:42,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:21:42,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:21:42,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:21:42" (1/1) ... [2018-11-23 05:21:42,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438aef5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:42, skipping insertion in model container [2018-11-23 05:21:42,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:21:42" (1/1) ... [2018-11-23 05:21:42,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:21:42,994 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:21:43,210 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:21:43,218 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:21:43,302 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:21:43,345 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:21:43,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43 WrapperNode [2018-11-23 05:21:43,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:21:43,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:21:43,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:21:43,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:21:43,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:21:43,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:21:43,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:21:43,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:21:43,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... [2018-11-23 05:21:43,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:21:43,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:21:43,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:21:43,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:21:43,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:21:43,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:21:43,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:21:43,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:21:43,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:21:43,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:21:43,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:21:43,547 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:21:43,547 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 05:21:43,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:21:43 BoogieIcfgContainer [2018-11-23 05:21:43,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:21:43,548 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:21:43,548 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:21:43,550 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:21:43,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:21:43,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:21:42" (1/3) ... [2018-11-23 05:21:43,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@343efe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:21:43, skipping insertion in model container [2018-11-23 05:21:43,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:21:43,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:21:43" (2/3) ... [2018-11-23 05:21:43,552 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@343efe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:21:43, skipping insertion in model container [2018-11-23 05:21:43,552 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:21:43,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:21:43" (3/3) ... [2018-11-23 05:21:43,554 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2018-11-23 05:21:43,592 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:21:43,593 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:21:43,593 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:21:43,593 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:21:43,593 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:21:43,593 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:21:43,594 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:21:43,594 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:21:43,594 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:21:43,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 05:21:43,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 05:21:43,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:43,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:43,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:21:43,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:21:43,631 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:21:43,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 05:21:43,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 05:21:43,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:43,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:43,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 05:21:43,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:21:43,641 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2018-11-23 05:21:43,642 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2018-11-23 05:21:43,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-23 05:21:43,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:43,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:43,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-11-23 05:21:43,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:43,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:43,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:43,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:43,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:43,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-11-23 05:21:43,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:43,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:43,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:43,987 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:21:43,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:21:43,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:21:43,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:21:43,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:21:43,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:21:43,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:21:43,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:21:43,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2018-11-23 05:21:43,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:21:43,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:21:44,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:44,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:21:44,332 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:21:44,334 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 [2018-11-23 05:21:44,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:44,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:44,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:44,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:44,341 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 [2018-11-23 05:21:44,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:44,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:44,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:44,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:44,345 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 [2018-11-23 05:21:44,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:44,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:44,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:44,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:44,347 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 [2018-11-23 05:21:44,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:44,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:44,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:44,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:44,349 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 [2018-11-23 05:21:44,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:44,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:44,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:44,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:44,354 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 [2018-11-23 05:21:44,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:44,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:44,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:44,362 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 [2018-11-23 05:21:44,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:44,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:44,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:44,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:44,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:44,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:44,407 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:21:44,431 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:21:44,431 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 05:21:44,433 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:21:44,435 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:21:44,435 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:21:44,436 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-23 05:21:44,443 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 05:21:44,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:44,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:44,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:44,510 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:21:44,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-23 05:21:44,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2018-11-23 05:21:44,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:21:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:21:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 05:21:44,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 05:21:44,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:44,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 05:21:44,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:44,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 05:21:44,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:44,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-11-23 05:21:44,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:44,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-11-23 05:21:44,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 05:21:44,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 05:21:44,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-23 05:21:44,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:21:44,557 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-23 05:21:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-23 05:21:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 05:21:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 05:21:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-23 05:21:44,574 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-23 05:21:44,574 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-23 05:21:44,574 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:21:44,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-23 05:21:44,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:44,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:44,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:44,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:44,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:21:44,576 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2018-11-23 05:21:44,576 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 118#L378-2 [2018-11-23 05:21:44,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-11-23 05:21:44,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:44,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:21:44,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:21:44,613 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:21:44,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-11-23 05:21:44,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:44,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:21:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:21:44,685 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 05:21:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:44,711 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-23 05:21:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:21:44,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-23 05:21:44,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:44,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 05:21:44,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 05:21:44,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 05:21:44,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-23 05:21:44,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:21:44,713 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 05:21:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-23 05:21:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-23 05:21:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 05:21:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-23 05:21:44,715 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 05:21:44,715 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 05:21:44,715 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:21:44,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-23 05:21:44,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:44,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:44,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:44,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:44,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:21:44,716 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2018-11-23 05:21:44,716 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 151#L378-2 [2018-11-23 05:21:44,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-11-23 05:21:44,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-11-23 05:21:44,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:44,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:44,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:44,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-11-23 05:21:44,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:44,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,089 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-23 05:21:45,091 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:21:45,091 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:21:45,091 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:21:45,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:21:45,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:21:45,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:21:45,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:21:45,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:21:45,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2018-11-23 05:21:45,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:21:45,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:21:45,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,243 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-23 05:21:45,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:45,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:21:45,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:21:45,456 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 [2018-11-23 05:21:45,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:45,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:45,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:45,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,458 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 [2018-11-23 05:21:45,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:45,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:45,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:45,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,460 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 [2018-11-23 05:21:45,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:45,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:45,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,463 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 [2018-11-23 05:21:45,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:45,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:45,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:45,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,465 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 [2018-11-23 05:21:45,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:45,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:45,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,469 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 [2018-11-23 05:21:45,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:45,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:45,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:45,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,471 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 [2018-11-23 05:21:45,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:45,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:45,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:45,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,472 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 [2018-11-23 05:21:45,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:45,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:45,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:45,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,474 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 [2018-11-23 05:21:45,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,474 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:21:45,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,476 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:21:45,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:45,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,480 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 [2018-11-23 05:21:45,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,480 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:21:45,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,482 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:21:45,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:45,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,485 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 [2018-11-23 05:21:45,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:45,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:45,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:45,489 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 [2018-11-23 05:21:45,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:45,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:45,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:45,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:45,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:45,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:45,515 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:21:45,525 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:21:45,526 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:21:45,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:21:45,527 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:21:45,528 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:21:45,528 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 05:21:45,566 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 05:21:45,567 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:21:45,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:45,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:45,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:45,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:21:45,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 05:21:45,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2018-11-23 05:21:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:21:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:21:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 05:21:45,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 05:21:45,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:45,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 05:21:45,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:45,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 05:21:45,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:45,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-23 05:21:45,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:45,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-11-23 05:21:45,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 05:21:45,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 05:21:45,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-23 05:21:45,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:21:45,615 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 05:21:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-23 05:21:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 05:21:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 05:21:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-23 05:21:45,616 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 05:21:45,616 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 05:21:45,616 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:21:45,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-23 05:21:45,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:45,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:45,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:45,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:45,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:21:45,617 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 250#L378-2 [2018-11-23 05:21:45,617 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 250#L378-2 [2018-11-23 05:21:45,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-11-23 05:21:45,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:45,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-11-23 05:21:45,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:45,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-11-23 05:21:45,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:45,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:21:45,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:21:45,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:21:45,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:45,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:21:45,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:21:45,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-23 05:21:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:21:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:21:45,785 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 05:21:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:45,798 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-23 05:21:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:21:45,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-23 05:21:45,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:45,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2018-11-23 05:21:45,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 05:21:45,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 05:21:45,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-23 05:21:45,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:21:45,801 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 05:21:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-23 05:21:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-23 05:21:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 05:21:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-23 05:21:45,802 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-23 05:21:45,802 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-23 05:21:45,802 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:21:45,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-23 05:21:45,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:45,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:45,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:45,803 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:45,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:21:45,804 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 328#L367 assume !(main_~length~0 < 1); 337#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 329#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 330#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 331#L370-4 main_~j~0 := 0; 332#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 334#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 335#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 336#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 341#L378-2 [2018-11-23 05:21:45,804 INFO L796 eck$LassoCheckResult]: Loop: 341#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 342#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 341#L378-2 [2018-11-23 05:21:45,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2018-11-23 05:21:45,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:45,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:21:45,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:21:45,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:21:45,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:21:45,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:21:45,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:45,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:21:45,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 05:21:45,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:21:45,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-11-23 05:21:45,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:45,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:21:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:21:45,959 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-23 05:21:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:46,031 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-11-23 05:21:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:21:46,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-23 05:21:46,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:46,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2018-11-23 05:21:46,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-23 05:21:46,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 05:21:46,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-23 05:21:46,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:21:46,033 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 05:21:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-23 05:21:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-23 05:21:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 05:21:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 05:21:46,034 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 05:21:46,035 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 05:21:46,035 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:21:46,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-23 05:21:46,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:46,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:46,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:46,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:46,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:21:46,036 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 441#L367 assume !(main_~length~0 < 1); 450#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 451#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 452#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 455#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 453#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 454#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 438#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 439#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 456#L370-3 assume !(main_~i~0 < main_~length~0); 442#L370-4 main_~j~0 := 0; 443#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 449#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 447#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 448#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 445#L378-2 [2018-11-23 05:21:46,036 INFO L796 eck$LassoCheckResult]: Loop: 445#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 446#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 445#L378-2 [2018-11-23 05:21:46,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2018-11-23 05:21:46,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:46,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:46,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-11-23 05:21:46,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:46,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:46,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:46,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:46,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2018-11-23 05:21:46,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:46,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:46,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:46,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:46,376 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 115 [2018-11-23 05:21:46,614 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 65 [2018-11-23 05:21:46,615 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:21:46,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:21:46,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:21:46,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:21:46,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:21:46,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:21:46,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:21:46,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:21:46,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration6_Lasso [2018-11-23 05:21:46,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:21:46,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:21:46,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:21:46,930 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:21:46,930 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:21:46,930 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 [2018-11-23 05:21:46,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:46,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:46,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:46,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,932 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 [2018-11-23 05:21:46,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:46,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:46,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:46,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,933 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 [2018-11-23 05:21:46,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:46,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:46,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,936 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 [2018-11-23 05:21:46,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:46,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:46,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:46,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,937 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 [2018-11-23 05:21:46,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:46,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:46,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:46,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,939 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 [2018-11-23 05:21:46,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:21:46,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:21:46,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:21:46,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,941 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 [2018-11-23 05:21:46,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:46,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:46,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:21:46,943 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 [2018-11-23 05:21:46,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:21:46,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:21:46,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:21:46,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:21:46,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:21:46,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:21:46,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:21:46,967 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:21:46,968 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:21:46,968 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:21:46,969 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:21:46,969 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:21:46,969 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 05:21:47,005 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 05:21:47,006 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:21:47,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:47,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:47,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:21:47,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 05:21:47,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 05:21:47,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2018-11-23 05:21:47,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:21:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:21:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-23 05:21:47,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 05:21:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:47,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-23 05:21:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:47,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-23 05:21:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:21:47,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-23 05:21:47,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:47,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 05:21:47,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 05:21:47,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:21:47,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-23 05:21:47,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:21:47,078 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 05:21:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-23 05:21:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 05:21:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 05:21:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 05:21:47,079 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 05:21:47,079 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 05:21:47,079 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 05:21:47,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-23 05:21:47,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:21:47,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:47,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:47,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:47,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:21:47,080 INFO L794 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 583#L367 assume !(main_~length~0 < 1); 594#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 595#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 596#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 600#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 597#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 598#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 584#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 585#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 601#L370-3 assume !(main_~i~0 < main_~length~0); 586#L370-4 main_~j~0 := 0; 587#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 593#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 591#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 592#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 599#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 602#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 589#L378-2 [2018-11-23 05:21:47,081 INFO L796 eck$LassoCheckResult]: Loop: 589#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 590#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 589#L378-2 [2018-11-23 05:21:47,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2018-11-23 05:21:47,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:21:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 05:21:47,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:21:47,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66f816fa-d597-4ea5-ba9d-7f5c013331b5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:21:47,240 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:21:47,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-23 05:21:47,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:21:47,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:21:47,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-11-23 05:21:47,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 05:21:47,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:21:47,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:21:47,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:21:47,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 05:21:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 05:21:47,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:21:47,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 05:21:47,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:21:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2018-11-23 05:21:47,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:21:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:21:47,421 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-23 05:21:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:21:47,483 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 05:21:47,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:21:47,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-23 05:21:47,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 05:21:47,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2018-11-23 05:21:47,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 05:21:47,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 05:21:47,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2018-11-23 05:21:47,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:21:47,486 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-23 05:21:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2018-11-23 05:21:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 05:21:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 05:21:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-11-23 05:21:47,490 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-23 05:21:47,490 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-23 05:21:47,490 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 05:21:47,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2018-11-23 05:21:47,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 05:21:47,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:21:47,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:21:47,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:21:47,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 05:21:47,492 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 712#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 713#L367 assume !(main_~length~0 < 1); 723#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 724#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 725#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 714#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 715#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 731#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 732#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 726#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 727#L370-3 assume !(main_~i~0 < main_~length~0); 716#L370-4 main_~j~0 := 0; 717#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 719#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 720#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 721#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 728#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 744#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 742#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 739#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 737#L378-2 [2018-11-23 05:21:47,492 INFO L796 eck$LassoCheckResult]: Loop: 737#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 733#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 734#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 738#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 737#L378-2 [2018-11-23 05:21:47,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2018-11-23 05:21:47,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:47,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:47,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:47,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-11-23 05:21:47,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:47,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:21:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:21:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2018-11-23 05:21:47,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:21:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:21:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:21:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:21:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:21:47,989 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 130 [2018-11-23 05:21:48,128 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; [?] assume !(main_~length~0 < 1); [?] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [?] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [?] assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; [?] main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; [?] assume !(main_~i~0 < main_~length~0); [?] main_~j~0 := 0; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; [?] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [?] assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2); [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2); [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] assume !(main_~length~0 < 1); [L368] call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; [L369] assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); [L370] main_~i~0 := 0; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !!(main_~i~0 < main_~length~0); [L371] call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L371] havoc main_#t~nondet208; [L372] call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); [L372-L374] assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)); [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] assume !(main_~i~0 < main_~length~0); [L376] main_~j~0 := 0; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2); [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2); [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0); [L378] call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); [L378-L382] assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)); [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet205, main_#t~malloc206, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0; [L365] havoc main_~i~0; [L365] havoc main_~j~0; [L366] main_~length~0 := main_#t~nondet205; [L366] havoc main_#t~nondet205; [L367] COND FALSE !(main_~length~0 < 1) [L368] FCALL call main_#t~malloc206 := #Ultimate.alloc(4 * main_~length~0); [L368] main_~arr~0 := main_#t~malloc206; [L369] COND FALSE !(main_~arr~0 == { base: 0, offset: 0 }) [L370] main_~i~0 := 0; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND FALSE !(!(main_~i~0 < main_~length~0)) [L371] FCALL call write~int(main_#t~nondet208, { base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L371] havoc main_#t~nondet208; [L372] FCALL call main_#t~mem209 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~i~0 }, 4); [L372] COND FALSE !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2)) [L372] havoc main_#t~mem209; [L370] main_#t~post207 := main_~i~0; [L370] main_~i~0 := 1 + main_#t~post207; [L370] havoc main_#t~post207; [L370-L375] COND TRUE !(main_~i~0 < main_~length~0) [L376] main_~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND TRUE 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2) [L378] havoc main_#t~mem210; [L379] main_#t~post211 := main_~j~0; [L379] main_~j~0 := 1 + main_#t~post211; [L379] havoc main_#t~post211; [L377-L383] COND FALSE !(!(0 <= main_~j~0 && main_~j~0 < main_~length~0)) [L378] FCALL call main_#t~mem210 := read~int({ base: main_~arr~0!base, offset: main_~arr~0!offset + 4 * main_~j~0 }, 4); [L378] COND FALSE !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2)) [L378] havoc main_#t~mem210; [L381] main_#t~post212 := main_~j~0; [L381] main_~j~0 := main_#t~post212 - 1; [L381] havoc main_#t~post212; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(1 == (if #t~mem209 < 0 && 0 != #t~mem209 % 2 then #t~mem209 % 2 - 2 else #t~mem209 % 2)) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(1 == (if #t~mem209 < 0 && 0 != #t~mem209 % 2 then #t~mem209 % 2 - 2 else #t~mem209 % 2)) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE 0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2) [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := 1 + #t~post211; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2)) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := #t~post212 - 1; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE 0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2) [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := 1 + #t~post211; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2)) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := #t~post212 - 1; [L381] havoc #t~post212; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L365] havoc ~i~0; [L365] havoc ~j~0; [L366] ~length~0 := #t~nondet205; [L366] havoc #t~nondet205; [L367] COND FALSE !(~length~0 < 1) [L368] FCALL call #t~malloc206 := #Ultimate.alloc(4 * ~length~0); [L368] ~arr~0 := #t~malloc206; [L369] COND FALSE !(~arr~0 == { base: 0, offset: 0 }) [L370] ~i~0 := 0; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(1 == (if #t~mem209 < 0 && 0 != #t~mem209 % 2 then #t~mem209 % 2 - 2 else #t~mem209 % 2)) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND FALSE !(!(~i~0 < ~length~0)) [L371] FCALL call write~int(#t~nondet208, { base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L371] havoc #t~nondet208; [L372] FCALL call #t~mem209 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~i~0 }, 4); [L372] COND FALSE !(1 == (if #t~mem209 < 0 && 0 != #t~mem209 % 2 then #t~mem209 % 2 - 2 else #t~mem209 % 2)) [L372] havoc #t~mem209; [L370] #t~post207 := ~i~0; [L370] ~i~0 := 1 + #t~post207; [L370] havoc #t~post207; [L370-L375] COND TRUE !(~i~0 < ~length~0) [L376] ~j~0 := 0; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE 0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2) [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := 1 + #t~post211; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2)) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := #t~post212 - 1; [L381] havoc #t~post212; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND TRUE 0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2) [L378] havoc #t~mem210; [L379] #t~post211 := ~j~0; [L379] ~j~0 := 1 + #t~post211; [L379] havoc #t~post211; [L377-L383] COND FALSE !(!(0 <= ~j~0 && ~j~0 < ~length~0)) [L378] FCALL call #t~mem210 := read~int({ base: ~arr~0!base, offset: ~arr~0!offset + 4 * ~j~0 }, 4); [L378] COND FALSE !(0 == (if #t~mem210 < 0 && 0 != #t~mem210 % 2 then #t~mem210 % 2 - 2 else #t~mem210 % 2)) [L378] havoc #t~mem210; [L381] #t~post212 := ~j~0; [L381] ~j~0 := #t~post212 - 1; [L381] havoc #t~post212; [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i