./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:21:35,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:21:35,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:21:35,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:21:35,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:21:35,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:21:35,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:21:35,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:21:35,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:21:35,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:21:35,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:21:35,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:21:35,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:21:35,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:21:35,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:21:35,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:21:35,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:21:35,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:21:35,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:21:35,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:21:35,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:21:35,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:21:35,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:21:35,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:21:35,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:21:35,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:21:35,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:21:35,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:21:35,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:21:35,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:21:35,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:21:35,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:21:36,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:21:36,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:21:36,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:21:36,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:21:36,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:21:36,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:21:36,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:21:36,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:21:36,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:21:36,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:21:36,042 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:21:36,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:21:36,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:21:36,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:21:36,047 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:21:36,047 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:21:36,047 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:21:36,047 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:21:36,048 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:21:36,048 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:21:36,049 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:21:36,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:21:36,050 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:21:36,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:21:36,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:21:36,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:21:36,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:21:36,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:21:36,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:21:36,052 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:21:36,053 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:21:36,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:21:36,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:21:36,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:21:36,054 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:21:36,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:21:36,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:21:36,055 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:21:36,056 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:21:36,056 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2019-11-19 22:21:36,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:21:36,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:21:36,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:21:36,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:21:36,405 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:21:36,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-19 22:21:36,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acccfad86/af2ec458556d4402849ba2d5a7aa56b5/FLAGb523f1d9f [2019-11-19 22:21:37,049 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:21:37,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-19 22:21:37,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acccfad86/af2ec458556d4402849ba2d5a7aa56b5/FLAGb523f1d9f [2019-11-19 22:21:37,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acccfad86/af2ec458556d4402849ba2d5a7aa56b5 [2019-11-19 22:21:37,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:21:37,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:21:37,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:37,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:21:37,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:21:37,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:37,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450b1e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37, skipping insertion in model container [2019-11-19 22:21:37,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:37,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:21:37,375 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:21:37,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:37,814 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:21:37,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:21:37,955 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:21:37,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37 WrapperNode [2019-11-19 22:21:37,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:21:37,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:37,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:21:37,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:21:37,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:21:38,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:21:38,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:21:38,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:21:38,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... [2019-11-19 22:21:38,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:21:38,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:21:38,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:21:38,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:21:38,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:21:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:21:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:21:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:21:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:21:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:21:38,373 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:21:38,374 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-19 22:21:38,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:38 BoogieIcfgContainer [2019-11-19 22:21:38,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:21:38,377 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:21:38,378 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:21:38,384 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:21:38,385 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:38,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:21:37" (1/3) ... [2019-11-19 22:21:38,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@569409d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:38, skipping insertion in model container [2019-11-19 22:21:38,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:38,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:21:37" (2/3) ... [2019-11-19 22:21:38,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@569409d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:21:38, skipping insertion in model container [2019-11-19 22:21:38,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:21:38,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:38" (3/3) ... [2019-11-19 22:21:38,392 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-11-19 22:21:38,483 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:21:38,483 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:21:38,484 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:21:38,484 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:21:38,486 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:21:38,486 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:21:38,486 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:21:38,486 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:21:38,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-19 22:21:38,526 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 22:21:38,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:38,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:38,533 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:38,533 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:38,533 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:21:38,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-19 22:21:38,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-19 22:21:38,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:38,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:38,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:21:38,536 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:38,544 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-11-19 22:21:38,545 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-11-19 22:21:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-19 22:21:38,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:38,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11542790] [2019-11-19 22:21:38,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:38,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-19 22:21:38,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:38,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240723957] [2019-11-19 22:21:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:38,757 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-19 22:21:38,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:38,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794398405] [2019-11-19 22:21:38,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:38,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:39,154 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:39,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:39,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:39,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:39,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:39,155 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:39,156 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:39,156 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-11-19 22:21:39,156 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:39,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:39,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:39,694 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:39,702 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:39,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:39,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:39,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:39,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:39,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:39,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:39,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:39,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:39,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:39,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:39,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:39,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:40,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:40,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:40,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:40,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:40,081 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-19 22:21:40,081 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:40,093 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:40,097 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-19 22:21:40,097 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:40,098 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-19 22:21:40,122 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-19 22:21:40,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:40,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:21:40,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:40,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-19 22:21:40,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:40,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:40,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-19 22:21:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:40,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:21:40,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:40,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-19 22:21:40,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-19 22:21:40,505 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-19 22:21:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:21:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-19 22:21:40,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-19 22:21:40,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:40,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-19 22:21:40,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:40,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-19 22:21:40,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:40,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-19 22:21:40,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:40,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-19 22:21:40,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-19 22:21:40,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 22:21:40,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-19 22:21:40,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:40,529 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-19 22:21:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-19 22:21:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-19 22:21:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-19 22:21:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-19 22:21:40,567 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-19 22:21:40,567 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-19 22:21:40,567 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:21:40,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-19 22:21:40,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:40,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:40,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:40,569 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:40,569 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:21:40,569 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-19 22:21:40,569 INFO L796 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 130#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 128#L378-2 [2019-11-19 22:21:40,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-19 22:21:40,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385264693] [2019-11-19 22:21:40,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:40,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385264693] [2019-11-19 22:21:40,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:40,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:21:40,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463057154] [2019-11-19 22:21:40,643 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-19 22:21:40,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996207335] [2019-11-19 22:21:40,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:40,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:21:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:21:40,775 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-19 22:21:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:40,817 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-19 22:21:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:40,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-19 22:21:40,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:40,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-19 22:21:40,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 22:21:40,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 22:21:40,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-19 22:21:40,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:40,830 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-19 22:21:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-19 22:21:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-19 22:21:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-19 22:21:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-19 22:21:40,836 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-19 22:21:40,836 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-19 22:21:40,836 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:21:40,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-19 22:21:40,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:40,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:40,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:40,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:40,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:21:40,842 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 158#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-19 22:21:40,842 INFO L796 eck$LassoCheckResult]: Loop: 161#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 163#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 161#L378-2 [2019-11-19 22:21:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-19 22:21:40,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735855540] [2019-11-19 22:21:40,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-19 22:21:40,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099170888] [2019-11-19 22:21:40,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:40,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-19 22:21:40,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:40,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931504190] [2019-11-19 22:21:40,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:41,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:41,321 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 22:21:41,670 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-19 22:21:41,673 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:41,673 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:41,673 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:41,673 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:41,674 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:41,674 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:41,674 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:41,674 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:41,674 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-11-19 22:21:41,674 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:41,675 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:41,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:41,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:41,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:41,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:41,954 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-19 22:21:41,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:41,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:41,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:42,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:42,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:42,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:42,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:42,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:42,375 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:42,375 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:42,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:42,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:42,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:42,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:42,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:42,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:42,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:42,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:42,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:42,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:42,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:42,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:42,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:42,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:42,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:42,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:42,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:42,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:42,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:42,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:42,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:42,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:42,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:42,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:42,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:42,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:42,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:42,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:42,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:42,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:42,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:42,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:42,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:42,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:42,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:42,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:42,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:42,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:42,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:42,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:42,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:42,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:42,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:42,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:42,565 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-19 22:21:42,565 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:42,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:42,575 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:42,576 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:42,576 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-19 22:21:42,586 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-19 22:21:42,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:42,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:21:42,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:42,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:21:42,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:42,635 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:21:42,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-19 22:21:42,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-11-19 22:21:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 22:21:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-19 22:21:42,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-19 22:21:42,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:42,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-19 22:21:42,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:42,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-19 22:21:42,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:42,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-19 22:21:42,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:42,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-19 22:21:42,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-19 22:21:42,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 22:21:42,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-19 22:21:42,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:42,655 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-19 22:21:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-19 22:21:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 22:21:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 22:21:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-19 22:21:42,658 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-19 22:21:42,658 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-19 22:21:42,658 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:21:42,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-19 22:21:42,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:42,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:42,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:42,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:42,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:21:42,660 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 254#L367 assume !(main_~length~0 < 1); 265#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 266#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 267#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 255#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 256#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 268#L370-3 assume !(main_~i~0 < main_~length~0); 257#L370-4 main_~j~0 := 0; 258#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 264#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 260#L378-2 [2019-11-19 22:21:42,660 INFO L796 eck$LassoCheckResult]: Loop: 260#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 261#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 260#L378-2 [2019-11-19 22:21:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-19 22:21:42,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:42,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414961579] [2019-11-19 22:21:42,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:42,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-19 22:21:42,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:42,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212393248] [2019-11-19 22:21:42,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:42,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-19 22:21:42,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:42,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704554726] [2019-11-19 22:21:42,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:21:42,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704554726] [2019-11-19 22:21:42,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059580199] [2019-11-19 22:21:42,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:42,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:21:42,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:21:42,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:21:42,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-19 22:21:42,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905701293] [2019-11-19 22:21:42,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:42,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:21:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:21:42,895 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-19 22:21:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:42,917 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-19 22:21:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:42,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-19 22:21:42,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:42,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-11-19 22:21:42,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-19 22:21:42,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 22:21:42,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-19 22:21:42,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:42,921 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-19 22:21:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-19 22:21:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-19 22:21:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 22:21:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-19 22:21:42,923 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-19 22:21:42,924 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-19 22:21:42,924 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:21:42,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-19 22:21:42,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:42,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:42,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:42,926 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:42,926 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:21:42,927 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 340#L367 assume !(main_~length~0 < 1); 347#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 348#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 349#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 337#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 338#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 350#L370-3 assume !(main_~i~0 < main_~length~0); 341#L370-4 main_~j~0 := 0; 342#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 344#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 345#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 346#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 351#L378-2 [2019-11-19 22:21:42,927 INFO L796 eck$LassoCheckResult]: Loop: 351#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 352#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 351#L378-2 [2019-11-19 22:21:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-11-19 22:21:42,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:42,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88241591] [2019-11-19 22:21:42,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:43,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88241591] [2019-11-19 22:21:43,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950525819] [2019-11-19 22:21:43,033 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:43,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:21:43,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:43,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:21:43,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:43,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:43,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-19 22:21:43,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58982611] [2019-11-19 22:21:43,179 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-19 22:21:43,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:43,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686808430] [2019-11-19 22:21:43,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:43,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:43,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:21:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:21:43,318 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-19 22:21:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:43,555 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-19 22:21:43,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:21:43,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-19 22:21:43,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:43,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-19 22:21:43,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-19 22:21:43,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-19 22:21:43,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-19 22:21:43,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:43,559 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-19 22:21:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-19 22:21:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-19 22:21:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 22:21:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-19 22:21:43,562 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-19 22:21:43,562 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-19 22:21:43,562 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:21:43,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-19 22:21:43,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:43,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:43,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:43,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:43,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:21:43,564 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 450#L367 assume !(main_~length~0 < 1); 459#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 460#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 461#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 464#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 462#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 463#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 447#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 448#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 465#L370-3 assume !(main_~i~0 < main_~length~0); 451#L370-4 main_~j~0 := 0; 452#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 457#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 456#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 458#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 454#L378-2 [2019-11-19 22:21:43,564 INFO L796 eck$LassoCheckResult]: Loop: 454#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 455#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 454#L378-2 [2019-11-19 22:21:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-11-19 22:21:43,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:43,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13294128] [2019-11-19 22:21:43,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:43,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-19 22:21:43,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:43,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773813167] [2019-11-19 22:21:43,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,632 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-11-19 22:21:43,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:43,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719662503] [2019-11-19 22:21:43,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:43,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:44,213 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 22:21:44,700 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-11-19 22:21:44,703 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:44,703 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:44,703 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:44,703 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:44,703 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:44,703 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:44,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:44,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:44,704 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-11-19 22:21:44,704 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:44,704 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:44,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:44,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:45,306 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:45,306 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:45,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:45,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:45,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:45,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:45,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:45,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:45,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:45,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:45,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:45,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:45,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:45,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:45,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:45,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:45,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:45,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:45,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:45,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:45,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:45,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:45,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:45,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:45,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:45,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:45,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:45,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:45,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:45,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:45,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:45,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:45,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:45,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:45,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:45,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:45,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:45,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:45,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:45,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:45,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:45,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:45,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:45,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:45,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:45,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:45,513 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-19 22:21:45,513 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:45,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:45,520 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-19 22:21:45,520 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:45,521 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 10 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 + 8 >= 0] [2019-11-19 22:21:45,542 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-19 22:21:45,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:45,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:21:45,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:45,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-19 22:21:45,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:45,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:45,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:45,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:21:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:45,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:21:45,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:45,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-19 22:21:45,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-19 22:21:45,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 35 states and 47 transitions. Complement of second has 11 states. [2019-11-19 22:21:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-19 22:21:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-19 22:21:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2019-11-19 22:21:45,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-19 22:21:45,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:45,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-19 22:21:45,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:45,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-19 22:21:45,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:45,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-19 22:21:45,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:45,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 47 transitions. [2019-11-19 22:21:45,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-19 22:21:45,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-19 22:21:45,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-11-19 22:21:45,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:45,931 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-19 22:21:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-11-19 22:21:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-19 22:21:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 22:21:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-19 22:21:45,935 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-19 22:21:45,935 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-19 22:21:45,935 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:21:45,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-19 22:21:45,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 22:21:45,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:45,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:45,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:45,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 22:21:45,937 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 635#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 636#L367 assume !(main_~length~0 < 1); 645#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 646#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 649#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 654#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 650#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 651#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 652#L370-3 assume !(main_~i~0 < main_~length~0); 653#L370-4 main_~j~0 := 0; 659#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 658#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 657#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 655#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 656#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 644#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 640#L378-2 [2019-11-19 22:21:45,938 INFO L796 eck$LassoCheckResult]: Loop: 640#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 641#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 640#L378-2 [2019-11-19 22:21:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-11-19 22:21:45,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:45,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341121230] [2019-11-19 22:21:45,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:46,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341121230] [2019-11-19 22:21:46,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255653346] [2019-11-19 22:21:46,426 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:46,468 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-19 22:21:46,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:46,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:21:46,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:46,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 22:21:46,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:46,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:46,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:21:46,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-19 22:21:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 22:21:46,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:46,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-11-19 22:21:46,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289163797] [2019-11-19 22:21:46,591 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-11-19 22:21:46,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:46,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634954498] [2019-11-19 22:21:46,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:46,600 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:46,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:21:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:21:46,666 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 16 states. [2019-11-19 22:21:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:46,898 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-11-19 22:21:46,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:21:46,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-11-19 22:21:46,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-19 22:21:46,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2019-11-19 22:21:46,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-19 22:21:46,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-19 22:21:46,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2019-11-19 22:21:46,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:46,902 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-19 22:21:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2019-11-19 22:21:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-19 22:21:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-19 22:21:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-11-19 22:21:46,906 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-19 22:21:46,906 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-19 22:21:46,906 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:21:46,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-11-19 22:21:46,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-19 22:21:46,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:46,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:46,909 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:46,910 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-19 22:21:46,910 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 781#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 782#L367 assume !(main_~length~0 < 1); 792#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 793#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 794#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 798#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 802#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 799#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 800#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 795#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 796#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 783#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 784#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 801#L370-3 assume !(main_~i~0 < main_~length~0); 785#L370-4 main_~j~0 := 0; 786#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 788#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 789#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 791#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-11-19 22:21:46,911 INFO L796 eck$LassoCheckResult]: Loop: 810#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 805#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 806#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 813#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-11-19 22:21:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:46,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1570402076, now seen corresponding path program 6 times [2019-11-19 22:21:46,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:46,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494876969] [2019-11-19 22:21:46,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:47,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-19 22:21:47,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:47,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060605080] [2019-11-19 22:21:47,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:47,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash -507624276, now seen corresponding path program 7 times [2019-11-19 22:21:47,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:47,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621786915] [2019-11-19 22:21:47,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:47,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:47,858 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 144 [2019-11-19 22:21:49,465 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 190 DAG size of output: 78 [2019-11-19 22:21:49,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:21:49 BoogieIcfgContainer [2019-11-19 22:21:49,498 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:21:49,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:21:49,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:21:49,499 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:21:49,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:21:38" (3/4) ... [2019-11-19 22:21:49,503 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 22:21:49,557 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:21:49,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:21:49,560 INFO L168 Benchmark]: Toolchain (without parser) took 12244.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 961.7 MB in the beginning and 939.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:49,560 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:49,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -83.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:49,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:49,562 INFO L168 Benchmark]: Boogie Preprocessor took 28.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:49,562 INFO L168 Benchmark]: RCFGBuilder took 323.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:49,563 INFO L168 Benchmark]: BuchiAutomizer took 11121.17 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.0 GB in the beginning and 939.1 MB in the end (delta: 78.8 MB). Peak memory consumption was 436.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:49,564 INFO L168 Benchmark]: Witness Printer took 58.99 ms. Allocated memory is still 1.3 GB. Free memory was 939.1 MB in the beginning and 939.1 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-19 22:21:49,566 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -83.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 323.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11121.17 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.0 GB in the beginning and 939.1 MB in the end (delta: 78.8 MB). Peak memory consumption was 436.1 MB. Max. memory is 11.5 GB. * Witness Printer took 58.99 ms. Allocated memory is still 1.3 GB. Free memory was 939.1 MB in the beginning and 939.1 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 -4 * i + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 6 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + 10 and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 9.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 66 SDtfs, 164 SDslu, 95 SDs, 0 SdLazy, 298 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp80 ukn92 mio100 lsp51 div161 bol100 ite100 ukn100 eq156 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75f489ef=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@475342c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76b308ff=0, length=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3417b451=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76b308ff=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@68ab7e24=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1768ef9b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@548ca9ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5f5ff16d=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