./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.25-f470102 [2019-11-28 20:35:53,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:35:53,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:35:53,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:35:53,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:35:53,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:35:53,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:35:53,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:35:53,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:35:53,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:35:53,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:35:53,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:35:53,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:35:53,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:35:53,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:35:53,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:35:53,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:35:53,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:35:53,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:35:53,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:35:53,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:35:53,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:35:53,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:35:53,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:35:53,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:35:53,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:35:53,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:35:53,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:35:53,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:35:53,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:35:53,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:35:53,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:35:53,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:35:53,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:35:53,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:35:53,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:35:53,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:35:53,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:35:53,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:35:53,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:35:53,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:35:53,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:35:53,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:35:53,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:35:53,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:35:53,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:35:53,217 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:35:53,218 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:35:53,218 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:35:53,218 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:35:53,218 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:35:53,219 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:35:53,219 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:35:53,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:35:53,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:35:53,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:35:53,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:35:53,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:35:53,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:35:53,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:35:53,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:35:53,221 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:35:53,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:35:53,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:35:53,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:35:53,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:35:53,222 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:35:53,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:35:53,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:35:53,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:35:53,223 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:35:53,224 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:35:53,224 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-11-28 20:35:53,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:35:53,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:35:53,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:35:53,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:35:53,571 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:35:53,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-28 20:35:53,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975ca81a9/7bfb5270d5224e369fe4741a348517b8/FLAG0f6dc04bd [2019-11-28 20:35:54,207 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:35:54,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-28 20:35:54,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975ca81a9/7bfb5270d5224e369fe4741a348517b8/FLAG0f6dc04bd [2019-11-28 20:35:54,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/975ca81a9/7bfb5270d5224e369fe4741a348517b8 [2019-11-28 20:35:54,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:35:54,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:35:54,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:35:54,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:35:54,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:35:54,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:35:54" (1/1) ... [2019-11-28 20:35:54,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5725aa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:54, skipping insertion in model container [2019-11-28 20:35:54,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:35:54" (1/1) ... [2019-11-28 20:35:54,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:35:54,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:35:55,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:35:55,055 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:35:55,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:35:55,201 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:35:55,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55 WrapperNode [2019-11-28 20:35:55,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:35:55,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:35:55,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:35:55,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:35:55,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:35:55,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:35:55,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:35:55,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:35:55,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... [2019-11-28 20:35:55,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:35:55,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:35:55,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:35:55,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:35:55,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:35:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:35:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:35:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:35:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:35:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:35:55,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:35:55,722 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:35:55,722 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 20:35:55,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:35:55 BoogieIcfgContainer [2019-11-28 20:35:55,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:35:55,725 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:35:55,725 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:35:55,729 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:35:55,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:35:55,730 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:35:54" (1/3) ... [2019-11-28 20:35:55,731 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56ce33db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:35:55, skipping insertion in model container [2019-11-28 20:35:55,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:35:55,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:35:55" (2/3) ... [2019-11-28 20:35:55,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56ce33db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:35:55, skipping insertion in model container [2019-11-28 20:35:55,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:35:55,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:35:55" (3/3) ... [2019-11-28 20:35:55,734 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-11-28 20:35:55,783 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:35:55,783 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:35:55,783 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:35:55,784 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:35:55,784 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:35:55,784 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:35:55,784 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:35:55,785 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:35:55,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:35:55,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 20:35:55,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:55,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:55,833 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:35:55,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:55,833 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:35:55,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 20:35:55,835 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-28 20:35:55,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:55,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:55,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:35:55,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:55,845 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnStack(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 [2019-11-28 20:35:55,846 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 [2019-11-28 20:35:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 20:35:55,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:55,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693595233] [2019-11-28 20:35:55,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:55,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:55,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:55,994 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-28 20:35:55,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:55,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130579287] [2019-11-28 20:35:55,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:56,040 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-28 20:35:56,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:56,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306645697] [2019-11-28 20:35:56,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:56,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:56,343 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-28 20:35:56,466 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-28 20:35:56,526 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:56,527 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:56,527 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:56,528 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:56,528 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:56,528 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:56,528 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:56,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:56,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-11-28 20:35:56,529 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:56,529 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:56,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:56,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:57,018 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:57,023 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:57,041 INFO L120 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 [2019-11-28 20:35:57,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,069 INFO L120 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 [2019-11-28 20:35:57,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:57,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:57,096 INFO L120 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 [2019-11-28 20:35:57,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:57,117 INFO L120 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 [2019-11-28 20:35:57,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:57,134 INFO L120 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 [2019-11-28 20:35:57,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:57,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:57,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,167 INFO L120 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 [2019-11-28 20:35:57,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:57,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,184 INFO L120 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 [2019-11-28 20:35:57,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:57,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,199 INFO L120 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 [2019-11-28 20:35:57,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:57,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:57,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:57,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:57,222 INFO L120 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 [2019-11-28 20:35:57,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:57,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,247 INFO L120 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 [2019-11-28 20:35:57,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:57,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:57,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:57,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:57,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:57,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:57,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:57,387 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 20:35:57,388 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:57,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:35:57,464 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:35:57,465 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:57,465 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-28 20:35:57,489 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:35:57,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:35:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:57,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:35:57,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:57,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-11-28 20:35:57,613 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:35:57,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:35:57,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:35:57,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:35:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:57,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:57,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:57,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:57,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-28 20:35:57,829 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-28 20:35:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-28 20:35:57,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:35:57,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:57,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 20:35:57,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:57,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:35:57,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:57,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-28 20:35:57,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:57,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-28 20:35:57,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:35:57,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:35:57,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-28 20:35:57,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:35:57,857 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 20:35:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-28 20:35:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 20:35:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-28 20:35:57,900 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 20:35:57,900 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-28 20:35:57,900 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:35:57,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-28 20:35:57,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:57,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:57,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:57,904 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:57,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:57,904 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#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; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-28 20:35:57,905 INFO L796 eck$LassoCheckResult]: Loop: 128#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); 130#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; 128#L378-2 [2019-11-28 20:35:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:57,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-28 20:35:57,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:57,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935611993] [2019-11-28 20:35:57,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:58,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935611993] [2019-11-28 20:35:58,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:35:58,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:35:58,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14007038] [2019-11-28 20:35:58,012 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:35:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-28 20:35:58,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:58,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395499599] [2019-11-28 20:35:58,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:58,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:35:58,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:35:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:35:58,132 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 20:35:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:35:58,175 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-28 20:35:58,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:35:58,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-28 20:35:58,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:58,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 20:35:58,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:35:58,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:35:58,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-28 20:35:58,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:35:58,185 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:35:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-28 20:35:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-28 20:35:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 20:35:58,189 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:35:58,189 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:35:58,189 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:35:58,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 20:35:58,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:35:58,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:58,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:58,193 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:58,194 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:35:58,195 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#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; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#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); 158#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; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-28 20:35:58,195 INFO L796 eck$LassoCheckResult]: Loop: 161#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); 163#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; 161#L378-2 [2019-11-28 20:35:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-28 20:35:58,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:58,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046895667] [2019-11-28 20:35:58,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,256 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-28 20:35:58,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:58,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992839191] [2019-11-28 20:35:58,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:58,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-28 20:35:58,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:58,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812191846] [2019-11-28 20:35:58,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:58,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:58,679 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-28 20:35:58,986 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-28 20:35:58,991 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:58,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:58,991 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:58,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:58,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:58,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:58,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:58,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:58,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-11-28 20:35:58,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:58,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:59,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,293 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-28 20:35:59,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:59,712 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-11-28 20:35:59,739 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:59,739 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:59,758 INFO L120 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 [2019-11-28 20:35:59,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:59,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:59,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:59,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:59,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:59,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:59,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:59,772 INFO L120 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 [2019-11-28 20:35:59,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:59,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:59,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:59,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:59,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:59,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:59,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,787 INFO L120 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 [2019-11-28 20:35:59,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:59,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:59,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:59,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:59,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:59,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:59,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,805 INFO L120 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 [2019-11-28 20:35:59,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:59,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:59,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:59,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:59,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:59,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:59,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:59,834 INFO L120 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 [2019-11-28 20:35:59,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:59,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:59,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:59,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:59,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:59,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:59,860 INFO L120 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 [2019-11-28 20:35:59,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:59,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:59,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:59,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:59,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:59,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:59,927 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-28 20:35:59,927 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:59,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:35:59,936 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:35:59,936 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:59,936 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-28 20:35:59,948 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:35:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:59,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:35:59,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:59,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:59,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:00,005 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 [2019-11-28 20:36:00,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:36:00,022 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. [2019-11-28 20:36:00,023 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 [2019-11-28 20:36:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:36:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-28 20:36:00,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 20:36:00,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:00,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 20:36:00,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:00,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 20:36:00,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:00,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-28 20:36:00,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:00,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 20:36:00,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:36:00,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:36:00,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-28 20:36:00,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:00,029 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:36:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-28 20:36:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 20:36:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:36:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-28 20:36:00,031 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:36:00,032 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:36:00,032 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:36:00,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-28 20:36:00,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:00,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:00,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:00,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:00,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:36:00,034 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#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; 254#L367 assume !(main_~length~0 < 1); 265#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 266#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 267#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); 255#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; 256#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 268#L370-3 assume !(main_~i~0 < main_~length~0); 257#L370-4 main_~j~0 := 0; 258#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); 264#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; 260#L378-2 [2019-11-28 20:36:00,035 INFO L796 eck$LassoCheckResult]: Loop: 260#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); 261#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; 260#L378-2 [2019-11-28 20:36:00,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-28 20:36:00,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896023433] [2019-11-28 20:36:00,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-28 20:36:00,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280737014] [2019-11-28 20:36:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-28 20:36:00,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520088205] [2019-11-28 20:36:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:36:00,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520088205] [2019-11-28 20:36:00,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161228308] [2019-11-28 20:36:00,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:36:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:00,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:36:00,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:36:00,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:36:00,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-28 20:36:00,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305182864] [2019-11-28 20:36:00,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:36:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:36:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:36:00,264 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:36:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:36:00,286 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-28 20:36:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:36:00,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-28 20:36:00,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:00,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-11-28 20:36:00,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:36:00,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:36:00,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-28 20:36:00,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:00,290 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-28 20:36:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-28 20:36:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 20:36:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:36:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-28 20:36:00,292 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 20:36:00,292 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-28 20:36:00,292 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:36:00,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-28 20:36:00,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:00,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:00,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:00,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:00,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:36:00,295 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#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; 340#L367 assume !(main_~length~0 < 1); 347#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 348#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 349#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); 337#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; 338#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 350#L370-3 assume !(main_~i~0 < main_~length~0); 341#L370-4 main_~j~0 := 0; 342#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); 344#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; 345#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); 346#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; 351#L378-2 [2019-11-28 20:36:00,295 INFO L796 eck$LassoCheckResult]: Loop: 351#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); 352#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; 351#L378-2 [2019-11-28 20:36:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-11-28 20:36:00,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451982742] [2019-11-28 20:36:00,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:00,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451982742] [2019-11-28 20:36:00,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926917312] [2019-11-28 20:36:00,404 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:36:00,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:36:00,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:36:00,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:36:00,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:00,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:36:00,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 20:36:00,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958874134] [2019-11-28 20:36:00,533 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:36:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-28 20:36:00,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675922031] [2019-11-28 20:36:00,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,543 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:00,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:36:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:36:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:36:00,605 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-28 20:36:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:36:00,800 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-28 20:36:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:36:00,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-28 20:36:00,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:00,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-28 20:36:00,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:36:00,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:36:00,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-28 20:36:00,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:00,803 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-28 20:36:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-28 20:36:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 20:36:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 20:36:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 20:36:00,806 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:36:00,806 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 20:36:00,806 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:36:00,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 20:36:00,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:00,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:00,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:00,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:00,808 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:36:00,808 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#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; 450#L367 assume !(main_~length~0 < 1); 459#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 460#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 461#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); 464#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; 462#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 463#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); 447#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; 448#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 465#L370-3 assume !(main_~i~0 < main_~length~0); 451#L370-4 main_~j~0 := 0; 452#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); 457#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; 456#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); 458#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; 454#L378-2 [2019-11-28 20:36:00,808 INFO L796 eck$LassoCheckResult]: Loop: 454#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); 455#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; 454#L378-2 [2019-11-28 20:36:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-11-28 20:36:00,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736833326] [2019-11-28 20:36:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,875 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-28 20:36:00,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238918252] [2019-11-28 20:36:00,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,886 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-11-28 20:36:00,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:00,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510384851] [2019-11-28 20:36:00,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:00,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:01,496 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2019-11-28 20:36:01,936 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-11-28 20:36:01,939 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:36:01,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:36:01,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:36:01,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:36:01,940 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:36:01,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:01,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:36:01,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:36:01,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-11-28 20:36:01,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:36:01,941 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:36:01,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:01,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:01,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:01,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:36:02,547 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:36:02,548 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,561 INFO L120 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 [2019-11-28 20:36:02,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:02,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:02,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:02,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:02,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:02,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:02,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:36:02,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:02,579 INFO L120 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 [2019-11-28 20:36:02,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:02,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:36:02,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:02,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:02,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:02,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:36:02,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:02,599 INFO L120 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 [2019-11-28 20:36:02,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:02,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:02,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:02,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:02,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:02,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:02,615 INFO L120 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 [2019-11-28 20:36:02,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:02,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:02,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:02,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:02,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:02,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:02,640 INFO L120 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 [2019-11-28 20:36:02,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:02,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:02,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:02,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:02,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:36:02,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:02,667 INFO L120 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 [2019-11-28 20:36:02,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:36:02,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:36:02,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:36:02,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:36:02,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:36:02,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:36:02,729 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 20:36:02,730 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:36:02,744 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:36:02,748 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:36:02,748 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:36:02,748 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 10 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 + 8 >= 0] [2019-11-28 20:36:02,771 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 20:36:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:02,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:36:02,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:02,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2019-11-28 20:36:02,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:36:02,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:36:02,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:36:02,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:36:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:02,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:36:02,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:02,934 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-28 20:36:02,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 20:36:03,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 35 states and 47 transitions. Complement of second has 11 states. [2019-11-28 20:36:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 20:36:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:36:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2019-11-28 20:36:03,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-28 20:36:03,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:03,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-28 20:36:03,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:03,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-28 20:36:03,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:36:03,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-28 20:36:03,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:03,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 47 transitions. [2019-11-28 20:36:03,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 20:36:03,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 20:36:03,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-11-28 20:36:03,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:03,129 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-28 20:36:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-11-28 20:36:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-28 20:36:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:36:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-28 20:36:03,133 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-28 20:36:03,133 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-28 20:36:03,133 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:36:03,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-28 20:36:03,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:36:03,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:03,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:03,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:03,135 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:36:03,136 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 635#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; 636#L367 assume !(main_~length~0 < 1); 645#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 646#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#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); 649#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; 654#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 650#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); 651#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; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 652#L370-3 assume !(main_~i~0 < main_~length~0); 653#L370-4 main_~j~0 := 0; 659#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); 658#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; 657#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); 655#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; 656#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); 644#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; 640#L378-2 [2019-11-28 20:36:03,136 INFO L796 eck$LassoCheckResult]: Loop: 640#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); 641#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; 640#L378-2 [2019-11-28 20:36:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-11-28 20:36:03,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:03,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567635319] [2019-11-28 20:36:03,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:36:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:36:03,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567635319] [2019-11-28 20:36:03,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242931794] [2019-11-28 20:36:03,597 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:36:03,638 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-28 20:36:03,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:36:03,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:36:03,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:36:03,737 INFO L377 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 9 [2019-11-28 20:36:03,738 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:36:03,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:36:03,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:36:03,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-28 20:36:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:36:03,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:36:03,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-11-28 20:36:03,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256590751] [2019-11-28 20:36:03,752 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:36:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-11-28 20:36:03,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:03,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993308025] [2019-11-28 20:36:03,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:03,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:03,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:36:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:36:03,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:36:03,832 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 16 states. [2019-11-28 20:36:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:36:04,075 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-11-28 20:36:04,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:36:04,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-11-28 20:36:04,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:36:04,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2019-11-28 20:36:04,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 20:36:04,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:36:04,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2019-11-28 20:36:04,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:36:04,078 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-28 20:36:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2019-11-28 20:36:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-28 20:36:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:36:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-11-28 20:36:04,083 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 20:36:04,083 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-28 20:36:04,083 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:36:04,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-11-28 20:36:04,084 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:36:04,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:36:04,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:36:04,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:36:04,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 20:36:04,085 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 781#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; 782#L367 assume !(main_~length~0 < 1); 792#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 793#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 794#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); 798#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; 802#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 799#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); 800#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; 795#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 796#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); 783#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; 784#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 801#L370-3 assume !(main_~i~0 < main_~length~0); 785#L370-4 main_~j~0 := 0; 786#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); 788#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; 789#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); 791#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; 810#L378-2 [2019-11-28 20:36:04,086 INFO L796 eck$LassoCheckResult]: Loop: 810#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); 805#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; 806#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); 813#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; 810#L378-2 [2019-11-28 20:36:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1570402076, now seen corresponding path program 6 times [2019-11-28 20:36:04,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:04,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191363301] [2019-11-28 20:36:04,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:04,131 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-28 20:36:04,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:04,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116943155] [2019-11-28 20:36:04,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:04,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:36:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash -507624276, now seen corresponding path program 7 times [2019-11-28 20:36:04,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:36:04,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535708811] [2019-11-28 20:36:04,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:36:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:36:04,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:36:04,965 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 144 [2019-11-28 20:36:06,455 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 190 DAG size of output: 78 [2019-11-28 20:36:06,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:36:06 BoogieIcfgContainer [2019-11-28 20:36:06,502 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:36:06,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:36:06,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:36:06,505 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:36:06,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:35:55" (3/4) ... [2019-11-28 20:36:06,509 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:36:06,590 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:36:06,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:36:06,595 INFO L168 Benchmark]: Toolchain (without parser) took 12087.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 961.7 MB in the beginning and 956.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 325.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:06,597 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:06,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:06,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:06,599 INFO L168 Benchmark]: Boogie Preprocessor took 29.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:06,599 INFO L168 Benchmark]: RCFGBuilder took 444.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:06,603 INFO L168 Benchmark]: BuchiAutomizer took 10777.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 956.9 MB in the end (delta: 136.0 MB). Peak memory consumption was 436.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:36:06,607 INFO L168 Benchmark]: Witness Printer took 86.11 ms. Allocated memory is still 1.4 GB. Free memory is still 956.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:36:06,609 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 697.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.3 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 444.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10777.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 956.9 MB in the end (delta: 136.0 MB). Peak memory consumption was 436.6 MB. Max. memory is 11.5 GB. * Witness Printer took 86.11 ms. Allocated memory is still 1.4 GB. Free memory is still 956.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + 10 and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 9.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 66 SDtfs, 164 SDslu, 95 SDs, 0 SdLazy, 298 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp80 ukn92 mio100 lsp51 div161 bol100 ite100 ukn100 eq156 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6274398c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1dd87424=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@349a988c=0, length=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@617f91ab=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@349a988c=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@34ba904a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@62a4db28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@73a8172a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5b932b53=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [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