./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.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.24-91b1670 [2018-11-28 23:23:53,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:53,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:53,966 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:53,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:53,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:53,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:53,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:53,973 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:53,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:53,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:53,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:53,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:53,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:53,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:53,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:53,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:53,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:53,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:53,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:53,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:53,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:53,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:53,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:53,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:53,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:53,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:53,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:53,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:53,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:53,999 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:54,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:54,000 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:54,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:54,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:54,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:54,002 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:23:54,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:54,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:54,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:54,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:54,022 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:54,022 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:54,023 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:54,023 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:54,023 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:54,023 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:54,023 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:54,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:54,024 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:54,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:54,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:54,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:54,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:54,025 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:54,025 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:54,026 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:54,026 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:54,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:54,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:54,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:54,027 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:54,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:54,028 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:54,028 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:54,029 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:54,030 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 [2018-11-28 23:23:54,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:54,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:54,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:54,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:54,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:54,090 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-28 23:23:54,159 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca6b6374/bd708feed284461aba1d61281b2bb885/FLAGca8738c26 [2018-11-28 23:23:54,739 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:54,740 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array16_alloca_original_false-termination.c.i [2018-11-28 23:23:54,751 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca6b6374/bd708feed284461aba1d61281b2bb885/FLAGca8738c26 [2018-11-28 23:23:55,026 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca6b6374/bd708feed284461aba1d61281b2bb885 [2018-11-28 23:23:55,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:55,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:55,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:55,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:55,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:55,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629a53d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55, skipping insertion in model container [2018-11-28 23:23:55,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:55,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:55,485 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:55,502 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:55,569 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:55,648 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:55,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55 WrapperNode [2018-11-28 23:23:55,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:55,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:55,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:55,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:55,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:55,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:55,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:55,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:55,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (1/1) ... [2018-11-28 23:23:55,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:55,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:55,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:55,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:55,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23: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 [2018-11-28 23:23:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:55,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:56,256 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:56,256 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 23:23:56,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:56 BoogieIcfgContainer [2018-11-28 23:23:56,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:56,258 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:56,258 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:56,261 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:56,262 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:56,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:55" (1/3) ... [2018-11-28 23:23:56,263 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6130ae35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:56, skipping insertion in model container [2018-11-28 23:23:56,263 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:56,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:55" (2/3) ... [2018-11-28 23:23:56,264 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6130ae35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:56, skipping insertion in model container [2018-11-28 23:23:56,264 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:56,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:56" (3/3) ... [2018-11-28 23:23:56,266 INFO L375 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original_false-termination.c.i [2018-11-28 23:23:56,320 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:56,321 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:56,321 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:56,322 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:56,322 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:56,322 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:56,322 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:56,322 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:56,322 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:56,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:23:56,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:23:56,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:56,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:56,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:56,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:56,376 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:56,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:23:56,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:23:56,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:56,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:56,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:56,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:56,390 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2018-11-28 23:23:56,391 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2018-11-28 23:23:56,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-28 23:23:56,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2018-11-28 23:23:56,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2018-11-28 23:23:56,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,787 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:23:57,135 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-11-28 23:23:57,336 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-28 23:23:57,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:57,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:57,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:57,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:57,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:57,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:57,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:57,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:57,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration1_Lasso [2018-11-28 23:23:57,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:57,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:57,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,751 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-28 23:23:57,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:57,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,164 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:23:58,541 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:58,546 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:58,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:58,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:58,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:58,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:58,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:58,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:58,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:58,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:58,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:58,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:58,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:58,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:58,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:58,680 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:58,760 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:23:58,761 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:23:58,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:58,766 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:58,766 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:58,767 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2018-11-28 23:23:58,845 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:23:58,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:58,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:58,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:58,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:59,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:23:59,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-11-28 23:23:59,107 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2018-11-28 23:23:59,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-28 23:23:59,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:23:59,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:59,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 23:23:59,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:59,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 23:23:59,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:59,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2018-11-28 23:23:59,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:59,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2018-11-28 23:23:59,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:23:59,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:23:59,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2018-11-28 23:23:59,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:59,126 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:23:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2018-11-28 23:23:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 23:23:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:23:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-11-28 23:23:59,154 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:23:59,154 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2018-11-28 23:23:59,154 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:59,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2018-11-28 23:23:59,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:59,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:59,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:59,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:59,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:59,156 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2018-11-28 23:23:59,157 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 118#L378-2 [2018-11-28 23:23:59,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2018-11-28 23:23:59,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:59,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:59,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:59,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:59,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:23:59,227 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:23:59,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2018-11-28 23:23:59,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:59,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:59,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:59,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,414 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:23:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:23:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:23:59,419 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-28 23:23:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:59,475 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-11-28 23:23:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:23:59,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2018-11-28 23:23:59,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:59,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 23:23:59,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:23:59,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:23:59,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-11-28 23:23:59,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:59,483 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:23:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-11-28 23:23:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-28 23:23:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:23:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-28 23:23:59,485 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:23:59,485 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:23:59,485 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:59,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-28 23:23:59,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:59,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:59,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:59,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:59,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:59,487 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2018-11-28 23:23:59,487 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 151#L378-2 [2018-11-28 23:23:59,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2018-11-28 23:23:59,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:59,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:59,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2018-11-28 23:23:59,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2018-11-28 23:23:59,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:59,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:59,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:59,786 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:23:59,934 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:24:00,161 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2018-11-28 23:24:00,496 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-28 23:24:00,499 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:00,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:00,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:00,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:00,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:00,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:00,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:00,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:00,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration3_Lasso [2018-11-28 23:24:00,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:00,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:00,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,841 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-28 23:24:00,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:00,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:01,394 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2018-11-28 23:24:01,452 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:01,452 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:01,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:01,502 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:24:01,502 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:24:01,502 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:01,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:01,504 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:01,504 INFO L520 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 [] [2018-11-28 23:24:01,586 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:01,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:01,913 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:24:01,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:24:01,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2018-11-28 23:24:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:24:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:24:01,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:24:01,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:01,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-28 23:24:01,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:01,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:24:01,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:01,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2018-11-28 23:24:01,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:01,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2018-11-28 23:24:01,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:24:01,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:24:01,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 23:24:01,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:01,935 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:24:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 23:24:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:24:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:24:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-28 23:24:01,938 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:24:01,938 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 23:24:01,938 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:01,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-28 23:24:01,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:01,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:01,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:01,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:01,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:01,940 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 250#L378-2 [2018-11-28 23:24:01,940 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 250#L378-2 [2018-11-28 23:24:01,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2018-11-28 23:24:01,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:01,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:01,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:01,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:01,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:01,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2018-11-28 23:24:01,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:01,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:01,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:01,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2018-11-28 23:24:01,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:01,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:01,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:24:02,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:02,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:02,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:02,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:24:02,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:24:02,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-28 23:24:02,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:24:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:24:02,437 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 23:24:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:02,464 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-28 23:24:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:24:02,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-28 23:24:02,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:02,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2018-11-28 23:24:02,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:24:02,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:24:02,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-28 23:24:02,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:02,468 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 23:24:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-28 23:24:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-28 23:24:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:24:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-28 23:24:02,470 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 23:24:02,470 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-28 23:24:02,470 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:02,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-28 23:24:02,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:02,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:02,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:02,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:02,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:02,472 INFO L794 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 328#L367 assume !(main_~length~0 < 1); 337#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 329#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 330#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 331#L370-4 main_~j~0 := 0; 332#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 334#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 335#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 336#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 341#L378-2 [2018-11-28 23:24:02,472 INFO L796 eck$LassoCheckResult]: Loop: 341#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 342#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 341#L378-2 [2018-11-28 23:24:02,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:02,473 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2018-11-28 23:24:02,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:02,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:02,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:02,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:02,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:24:02,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:24:02,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:24:02,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:02,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:02,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 23:24:02,741 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:02,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2018-11-28 23:24:02,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:02,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:02,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:24:02,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:24:02,850 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-28 23:24:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:02,989 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-11-28 23:24:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:24:02,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-28 23:24:02,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:02,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 27 transitions. [2018-11-28 23:24:02,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:24:02,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:24:02,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-28 23:24:02,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:02,993 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-28 23:24:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-28 23:24:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-28 23:24:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:24:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 23:24:02,996 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:24:02,996 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 23:24:02,996 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:02,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 23:24:02,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:02,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:02,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:02,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:02,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:02,998 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 441#L367 assume !(main_~length~0 < 1); 450#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 451#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 452#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 455#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 453#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 454#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 438#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 439#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 456#L370-3 assume !(main_~i~0 < main_~length~0); 442#L370-4 main_~j~0 := 0; 443#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 449#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 447#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 448#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 445#L378-2 [2018-11-28 23:24:02,998 INFO L796 eck$LassoCheckResult]: Loop: 445#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 446#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 445#L378-2 [2018-11-28 23:24:02,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:02,998 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2018-11-28 23:24:02,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:02,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:02,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:02,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:02,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:03,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2018-11-28 23:24:03,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:03,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:03,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:03,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2018-11-28 23:24:03,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:03,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:03,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:03,382 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:24:03,507 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:24:03,858 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2018-11-28 23:24:04,400 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2018-11-28 23:24:04,403 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:04,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:04,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:04,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:04,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:04,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:04,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:04,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:04,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original_false-termination.c.i_Iteration6_Lasso [2018-11-28 23:24:04,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:04,405 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:04,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,605 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-28 23:24:04,735 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-11-28 23:24:04,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:04,888 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-28 23:24:05,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:05,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:05,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:05,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:05,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:05,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:05,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:05,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:05,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:05,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:05,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:05,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:05,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:05,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:05,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:05,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:05,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:05,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:05,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:05,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:05,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:05,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:05,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:05,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:05,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:05,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:05,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:05,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:05,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:05,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:05,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:05,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:05,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:05,362 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:24:05,362 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:05,365 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:05,366 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:05,367 INFO L520 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 [] [2018-11-28 23:24:05,429 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 23:24:05,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:05,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:05,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:05,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:24:05,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:24:05,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2018-11-28 23:24:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:24:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-28 23:24:05,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-28 23:24:05,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:05,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-28 23:24:05,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:05,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-28 23:24:05,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:05,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 23:24:05,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:05,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-11-28 23:24:05,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:24:05,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:24:05,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-28 23:24:05,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:05,565 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:24:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-28 23:24:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:24:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:24:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-28 23:24:05,568 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:24:05,568 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:24:05,568 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:24:05,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-28 23:24:05,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:24:05,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:05,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:05,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:05,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:24:05,571 INFO L794 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 583#L367 assume !(main_~length~0 < 1); 594#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 595#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 596#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 600#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 597#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 598#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 584#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 585#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 601#L370-3 assume !(main_~i~0 < main_~length~0); 586#L370-4 main_~j~0 := 0; 587#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 593#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 591#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 592#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 599#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 602#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 589#L378-2 [2018-11-28 23:24:05,571 INFO L796 eck$LassoCheckResult]: Loop: 589#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 590#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 589#L378-2 [2018-11-28 23:24:05,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2018-11-28 23:24:05,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:05,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:05,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:05,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:06,021 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-11-28 23:24:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:24:06,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:06,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:06,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:24:06,105 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-28 23:24:06,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:24:06,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:06,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 23:24:06,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 23:24:06,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:06,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:06,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:06,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-28 23:24:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:24:06,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:06,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 23:24:06,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:06,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2018-11-28 23:24:06,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:06,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:24:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:24:06,674 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-28 23:24:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:06,792 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-28 23:24:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:24:06,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-28 23:24:06,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:06,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2018-11-28 23:24:06,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:24:06,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 23:24:06,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2018-11-28 23:24:06,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:06,799 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-28 23:24:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2018-11-28 23:24:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 23:24:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:24:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-11-28 23:24:06,807 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-28 23:24:06,807 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-28 23:24:06,807 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:24:06,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2018-11-28 23:24:06,808 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:24:06,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:06,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:06,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:06,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 23:24:06,810 INFO L794 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 712#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 713#L367 assume !(main_~length~0 < 1); 723#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 724#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 725#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 714#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 715#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 731#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 732#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 726#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 727#L370-3 assume !(main_~i~0 < main_~length~0); 716#L370-4 main_~j~0 := 0; 717#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 719#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 720#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 721#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 728#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 744#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 742#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 739#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 737#L378-2 [2018-11-28 23:24:06,810 INFO L796 eck$LassoCheckResult]: Loop: 737#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 733#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 734#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 738#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 737#L378-2 [2018-11-28 23:24:06,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2018-11-28 23:24:06,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:06,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2018-11-28 23:24:06,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:06,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2018-11-28 23:24:06,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:06,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:06,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:06,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:07,054 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-28 23:24:07,174 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-11-28 23:24:07,761 WARN L180 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 132 [2018-11-28 23:24:08,074 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2018-11-28 23:24:08,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:08 BoogieIcfgContainer [2018-11-28 23:24:08,134 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:08,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:08,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:08,137 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:08,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:56" (3/4) ... [2018-11-28 23:24:08,149 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:24:08,258 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:24:08,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:08,260 INFO L168 Benchmark]: Toolchain (without parser) took 13229.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -112.2 MB). Peak memory consumption was 196.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:08,263 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:08,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 924.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:08,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:08,268 INFO L168 Benchmark]: Boogie Preprocessor took 37.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:08,269 INFO L168 Benchmark]: RCFGBuilder took 441.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:08,269 INFO L168 Benchmark]: BuchiAutomizer took 11876.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.9 MB). Peak memory consumption was 204.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:08,272 INFO L168 Benchmark]: Witness Printer took 124.69 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:08,280 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.12 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 924.5 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 441.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11876.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.9 MB). Peak memory consumption was 204.6 MB. Max. memory is 11.5 GB. * Witness Printer took 124.69 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. 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 -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 10.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 99 SDslu, 79 SDs, 0 SdLazy, 172 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf99 lsp80 ukn93 mio100 lsp53 div160 bol100 ite100 ukn100 eq155 hnf64 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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 {} State at position 1 is {NULL=0, \result=0, arr=5, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c4fd1cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bb431e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72c737c0=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6986e336=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72c737c0=5, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3086bf71=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@e02dbc5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@aa9ef3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7e954df7=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