./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/array-industry-pattern/array_single_elem_init.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 5375af47d6130a7bd98a5147355b5bb76e636a73 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:41:59,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:41:59,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:41:59,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:41:59,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:41:59,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:41:59,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:41:59,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:41:59,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:41:59,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:41:59,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:41:59,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:41:59,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:41:59,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:41:59,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:41:59,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:41:59,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:41:59,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:41:59,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:41:59,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:41:59,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:41:59,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:41:59,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:41:59,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:41:59,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:41:59,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:41:59,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:41:59,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:41:59,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:41:59,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:41:59,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:41:59,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:41:59,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:41:59,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:41:59,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:41:59,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:41:59,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:41:59,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:41:59,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:41:59,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:41:59,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:41:59,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 01:41:59,088 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:41:59,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:41:59,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:41:59,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:41:59,090 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:41:59,090 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:41:59,090 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:41:59,091 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:41:59,091 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:41:59,092 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:41:59,092 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:41:59,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:41:59,093 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:41:59,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:41:59,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:41:59,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:41:59,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:41:59,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:41:59,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:41:59,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:41:59,096 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:41:59,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:41:59,096 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:41:59,096 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:41:59,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:41:59,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:41:59,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:41:59,098 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:41:59,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:41:59,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:41:59,098 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:41:59,099 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:41:59,100 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:41:59,101 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5375af47d6130a7bd98a5147355b5bb76e636a73 [2020-07-29 01:41:59,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:41:59,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:41:59,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:41:59,482 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:41:59,483 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:41:59,484 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2020-07-29 01:41:59,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b57641a/92cb4a1af8b74e5798ec4c7c705a38a9/FLAG1ff9812a9 [2020-07-29 01:41:59,991 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:41:59,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2020-07-29 01:41:59,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b57641a/92cb4a1af8b74e5798ec4c7c705a38a9/FLAG1ff9812a9 [2020-07-29 01:42:00,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b57641a/92cb4a1af8b74e5798ec4c7c705a38a9 [2020-07-29 01:42:00,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:42:00,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:42:00,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:42:00,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:42:00,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:42:00,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2087eddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00, skipping insertion in model container [2020-07-29 01:42:00,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:42:00,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:42:00,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:42:00,588 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:42:00,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:42:00,632 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:42:00,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00 WrapperNode [2020-07-29 01:42:00,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:42:00,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:42:00,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:42:00,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:42:00,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:42:00,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:42:00,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:42:00,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:42:00,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (1/1) ... [2020-07-29 01:42:00,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:42:00,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:42:00,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:42:00,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:42:00,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (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 [2020-07-29 01:42:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:42:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:42:00,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:42:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:42:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:42:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:42:01,233 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:42:01,233 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:42:01,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:01 BoogieIcfgContainer [2020-07-29 01:42:01,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:42:01,238 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:42:01,239 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:42:01,243 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:42:01,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:01,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:42:00" (1/3) ... [2020-07-29 01:42:01,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2372abc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:42:01, skipping insertion in model container [2020-07-29 01:42:01,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:01,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:00" (2/3) ... [2020-07-29 01:42:01,247 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2372abc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:42:01, skipping insertion in model container [2020-07-29 01:42:01,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:01,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:01" (3/3) ... [2020-07-29 01:42:01,249 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_single_elem_init.i [2020-07-29 01:42:01,304 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:42:01,304 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:42:01,305 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:42:01,305 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:42:01,305 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:42:01,305 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:42:01,305 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:42:01,306 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:42:01,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 01:42:01,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:42:01,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:01,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:01,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:42:01,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:42:01,350 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:42:01,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 01:42:01,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:42:01,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:01,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:01,355 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:42:01,355 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:42:01,361 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 5#L10-3true [2020-07-29 01:42:01,362 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-3true assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 21#L14true assume 0 == main_~q~0;call write~int(1, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int((if main_~i~0 < 0 && 0 != main_~i~0 % 2 then main_~i~0 % 2 - 2 else main_~i~0 % 2), main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~0, 4); 16#L14-2true call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 9#L19true assume !(0 != main_#t~mem2);havoc main_#t~mem2; 8#L10-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 5#L10-3true [2020-07-29 01:42:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:42:01,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:01,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098541984] [2020-07-29 01:42:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:01,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:01,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:01,497 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 38268879, now seen corresponding path program 1 times [2020-07-29 01:42:01,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:01,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113956123] [2020-07-29 01:42:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:01,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:01,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:01,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:01,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708365, now seen corresponding path program 1 times [2020-07-29 01:42:01,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:01,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99651280] [2020-07-29 01:42:01,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:01,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-29 01:42:01,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; {29#(not (= |ULTIMATE.start_main_~#a~0.base| |ULTIMATE.start_main_~#b~0.base|))} is VALID [2020-07-29 01:42:01,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#(not (= |ULTIMATE.start_main_~#a~0.base| |ULTIMATE.start_main_~#b~0.base|))} assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {29#(not (= |ULTIMATE.start_main_~#a~0.base| |ULTIMATE.start_main_~#b~0.base|))} is VALID [2020-07-29 01:42:01,764 INFO L280 TraceCheckUtils]: 3: Hoare triple {29#(not (= |ULTIMATE.start_main_~#a~0.base| |ULTIMATE.start_main_~#b~0.base|))} assume 0 == main_~q~0;call write~int(1, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int((if main_~i~0 < 0 && 0 != main_~i~0 % 2 then main_~i~0 % 2 - 2 else main_~i~0 % 2), main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~0, 4); {30#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4))) 1)} is VALID [2020-07-29 01:42:01,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4))) 1)} call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {31#(= 1 |ULTIMATE.start_main_#t~mem2|)} is VALID [2020-07-29 01:42:01,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#(= 1 |ULTIMATE.start_main_#t~mem2|)} assume !(0 != main_#t~mem2);havoc main_#t~mem2; {28#false} is VALID [2020-07-29 01:42:01,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#false} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {28#false} is VALID [2020-07-29 01:42:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:01,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99651280] [2020-07-29 01:42:01,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:42:01,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:42:01,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186986445] [2020-07-29 01:42:01,929 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2020-07-29 01:42:02,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:42:02,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:42:02,087 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2020-07-29 01:42:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:02,354 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-29 01:42:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:42:02,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:42:02,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:02,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2020-07-29 01:42:02,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 01:42:02,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2020-07-29 01:42:02,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:42:02,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:42:02,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2020-07-29 01:42:02,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:02,387 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:42:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2020-07-29 01:42:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-29 01:42:02,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:02,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 24 transitions. Second operand 16 states. [2020-07-29 01:42:02,417 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 24 transitions. Second operand 16 states. [2020-07-29 01:42:02,419 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 16 states. [2020-07-29 01:42:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:02,422 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 01:42:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:42:02,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:02,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:02,424 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states and 24 transitions. [2020-07-29 01:42:02,424 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states and 24 transitions. [2020-07-29 01:42:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:02,427 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 01:42:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:42:02,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:02,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:02,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:02,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:42:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-07-29 01:42:02,432 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:42:02,432 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:42:02,432 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:42:02,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:42:02,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-29 01:42:02,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:02,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:02,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:42:02,434 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:42:02,435 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 68#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 61#L10-3 [2020-07-29 01:42:02,435 INFO L796 eck$LassoCheckResult]: Loop: 61#L10-3 assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 62#L14 assume !(0 == main_~q~0); 71#L14-2 call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 72#L19 assume !(0 != main_#t~mem2);havoc main_#t~mem2; 64#L10-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 61#L10-3 [2020-07-29 01:42:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:42:02,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:02,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466614227] [2020-07-29 01:42:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:02,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:02,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:02,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash 38328461, now seen corresponding path program 1 times [2020-07-29 01:42:02,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:02,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921082890] [2020-07-29 01:42:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:02,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:02,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:02,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1809767947, now seen corresponding path program 1 times [2020-07-29 01:42:02,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:02,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639642705] [2020-07-29 01:42:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:02,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:02,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:02,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:02,741 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-07-29 01:42:02,845 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:42:02,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:42:02,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:42:02,847 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:42:02,847 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:42:02,847 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:02,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:42:02,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:42:02,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init.i_Iteration2_Lasso [2020-07-29 01:42:02,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:42:02,848 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:42:02,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:02,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:02,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:02,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:02,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:02,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:02,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:03,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:03,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:03,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:03,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:03,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:03,653 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:42:03,658 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 [2020-07-29 01:42:03,673 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 [2020-07-29 01:42:03,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:03,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:03,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:03,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:03,714 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 [2020-07-29 01:42:03,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:03,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:03,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:03,719 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) [2020-07-29 01:42:03,762 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 [2020-07-29 01:42:03,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:03,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,764 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:42:03,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,768 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:42:03,768 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 [2020-07-29 01:42:03,773 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 [2020-07-29 01:42:03,806 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 [2020-07-29 01:42:03,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:03,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:03,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:03,811 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 [2020-07-29 01:42:03,856 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 [2020-07-29 01:42:03,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:03,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:03,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:03,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:03,889 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 [2020-07-29 01:42:03,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:03,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:03,899 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 [2020-07-29 01:42:03,927 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 [2020-07-29 01:42:03,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:03,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:03,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:03,988 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 [2020-07-29 01:42:03,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:03,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:03,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:03,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:03,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:03,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:03,998 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 [2020-07-29 01:42:04,026 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 [2020-07-29 01:42:04,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:04,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:04,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:04,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:04,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:04,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:04,034 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 [2020-07-29 01:42:04,059 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 [2020-07-29 01:42:04,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:04,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:04,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:04,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:04,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:04,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:04,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:04,063 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 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 [2020-07-29 01:42:04,087 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 [2020-07-29 01:42:04,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:04,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:04,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:04,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:04,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:04,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:04,100 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:04,128 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 [2020-07-29 01:42:04,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:04,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:04,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:04,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:04,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:04,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:04,139 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:04,162 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 [2020-07-29 01:42:04,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:04,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:04,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:04,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:04,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:42:04,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:42:04,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:42:04,226 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 01:42:04,226 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. 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) [2020-07-29 01:42:04,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:04,260 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:42:04,260 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:42:04,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2020-07-29 01:42:04,390 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 01:42:04,394 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);" "assume !(0 == main_~q~0);" "call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);" "assume !(0 != main_#t~mem2);havoc main_#t~mem2;" "main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;" [2020-07-29 01:42:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:04,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:42:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:04,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:04,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {120#unseeded} is VALID [2020-07-29 01:42:04,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#unseeded} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; {120#unseeded} is VALID [2020-07-29 01:42:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:04,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:42:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:04,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:04,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 199999))} assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} is VALID [2020-07-29 01:42:04,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} assume !(0 == main_~q~0); {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} is VALID [2020-07-29 01:42:04,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} is VALID [2020-07-29 01:42:04,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} assume !(0 != main_#t~mem2);havoc main_#t~mem2; {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} is VALID [2020-07-29 01:42:04,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {163#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 199999))) unseeded)} is VALID [2020-07-29 01:42:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:04,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:42:04,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:04,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,515 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 [2020-07-29 01:42:04,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:42:04,618 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 36 transitions. Complement of second has 7 states. [2020-07-29 01:42:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:42:04,619 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:04,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:42:04,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:04,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:04,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:42:04,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:04,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:04,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:04,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2020-07-29 01:42:04,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:42:04,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:04,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:04,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:42:04,627 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:42:04,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:42:04,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:04,629 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:42:04,629 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 36 transitions. cyclomatic complexity: 13 [2020-07-29 01:42:04,630 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:42:04,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:42:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:42:04,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:42:04,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:42:04,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:42:04,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:42:04,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:04,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:04,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:04,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:04,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:04,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:04,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:04,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:04,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:04,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:42:04,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:42:04,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:42:04,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:42:04,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:42:04,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:42:04,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:42:04,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:42:04,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:42:04,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:42:04,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:42:04,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:42:04,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:42:04,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:42:04,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:42:04,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:42:04,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:42:04,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 5 letters. [2020-07-29 01:42:04,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:04,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:04,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:04,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:04,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:04,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:04,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,657 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:42:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:42:04,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2020-07-29 01:42:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2020-07-29 01:42:04,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:04,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. cyclomatic complexity: 13 [2020-07-29 01:42:04,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:42:04,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 23 transitions. [2020-07-29 01:42:04,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:42:04,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:42:04,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-07-29 01:42:04,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:04,665 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:42:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-07-29 01:42:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 01:42:04,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:04,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand 17 states. [2020-07-29 01:42:04,667 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand 17 states. [2020-07-29 01:42:04,667 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 17 states. [2020-07-29 01:42:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:04,668 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:42:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:42:04,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:04,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:04,669 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 23 transitions. [2020-07-29 01:42:04,669 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 23 transitions. [2020-07-29 01:42:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:04,670 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:42:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:42:04,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:04,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:04,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:04,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:42:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 01:42:04,672 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:42:04,672 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:42:04,672 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:42:04,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:42:04,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:42:04,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:04,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:04,674 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:42:04,674 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:42:04,674 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 229#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 221#L10-3 assume !(main_~i~0 < 100000); 219#L10-4 call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; 220#L32-3 [2020-07-29 01:42:04,674 INFO L796 eck$LassoCheckResult]: Loop: 220#L32-3 assume !!(main_~i~0 < 100000); 224#L34 assume !(15000 == main_~i~0); 228#L32-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 220#L32-3 [2020-07-29 01:42:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2020-07-29 01:42:04,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:04,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762159248] [2020-07-29 01:42:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:04,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {273#true} is VALID [2020-07-29 01:42:04,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#true} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; {275#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:42:04,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {275#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < 100000); {274#false} is VALID [2020-07-29 01:42:04,715 INFO L280 TraceCheckUtils]: 3: Hoare triple {274#false} call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; {274#false} is VALID [2020-07-29 01:42:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:04,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762159248] [2020-07-29 01:42:04,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:42:04,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:42:04,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578915202] [2020-07-29 01:42:04,717 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash 71947, now seen corresponding path program 1 times [2020-07-29 01:42:04,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:04,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680585138] [2020-07-29 01:42:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:04,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:04,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:04,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:04,751 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:42:04,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:42:04,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:42:04,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:42:04,752 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:42:04,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:04,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:42:04,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:42:04,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init.i_Iteration3_Loop [2020-07-29 01:42:04,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:42:04,753 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:42:04,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:04,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:04,858 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:42:04,860 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:42:04,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:42:04,874 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:04,879 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:42:04,879 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:42:04,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:42:04,924 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-07-29 01:42:04,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:42:04,975 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:05,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:42:05,089 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:42:05,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:42:05,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:42:05,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:42:05,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:42:05,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:05,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:42:05,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:42:05,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init.i_Iteration3_Loop [2020-07-29 01:42:05,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:42:05,090 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:42:05,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:05,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:05,183 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:42:05,183 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:05,188 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 [2020-07-29 01:42:05,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:05,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:05,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:05,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:05,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:05,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:05,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:05,192 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:05,232 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 [2020-07-29 01:42:05,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:05,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:05,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:05,235 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:42:05,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:05,236 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:42:05,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:05,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:42:05,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:42:05,248 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:05,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:42:05,266 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:42:05,266 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:42:05,266 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2020-07-29 01:42:05,300 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:42:05,303 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < 100000);" "assume !(15000 == main_~i~0);" "main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;" [2020-07-29 01:42:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:05,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:42:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:05,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:05,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {278#unseeded} is VALID [2020-07-29 01:42:05,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#unseeded} havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; {278#unseeded} is VALID [2020-07-29 01:42:05,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#unseeded} assume !(main_~i~0 < 100000); {278#unseeded} is VALID [2020-07-29 01:42:05,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {278#unseeded} call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; {278#unseeded} is VALID [2020-07-29 01:42:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:05,344 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:42:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:05,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:05,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 199999))} assume !!(main_~i~0 < 100000); {305#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} is VALID [2020-07-29 01:42:05,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} assume !(15000 == main_~i~0); {305#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} is VALID [2020-07-29 01:42:05,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {305#(and (<= 199999 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000))} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {291#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 199999))) unseeded)} is VALID [2020-07-29 01:42:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:05,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:42:05,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:05,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,378 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 [2020-07-29 01:42:05,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:42:05,434 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2020-07-29 01:42:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:42:05,434 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:05,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. cyclomatic complexity: 8 [2020-07-29 01:42:05,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:05,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:05,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:42:05,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:05,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:05,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:05,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2020-07-29 01:42:05,437 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:05,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:05,437 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 23 transitions. cyclomatic complexity: 8 [2020-07-29 01:42:05,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:42:05,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:42:05,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:05,440 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:42:05,440 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 30 transitions. cyclomatic complexity: 10 [2020-07-29 01:42:05,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. cyclomatic complexity: 10 [2020-07-29 01:42:05,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:05,440 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:42:05,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:05,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:05,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:05,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:42:05,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:42:05,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:42:05,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:42:05,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:42:05,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:42:05,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:42:05,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:42:05,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:42:05,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:05,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:05,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:42:05,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:05,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:05,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:42:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:05,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:42:05,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:05,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:05,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:42:05,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:05,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:05,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:42:05,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,450 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:42:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2020-07-29 01:42:05,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:42:05,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:42:05,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:42:05,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:05,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. cyclomatic complexity: 10 [2020-07-29 01:42:05,454 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:05,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2020-07-29 01:42:05,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:42:05,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:42:05,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:42:05,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:05,454 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:05,454 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:05,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:42:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:42:05,455 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 01:42:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:05,455 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:42:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:42:05,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:42:05,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:05,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:42:05,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:05,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:42:05,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:42:05,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:42:05,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:42:05,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:05,463 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:05,463 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:05,463 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:05,463 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:42:05,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:42:05,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:05,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:05,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:42:05 BoogieIcfgContainer [2020-07-29 01:42:05,470 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:42:05,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:42:05,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:42:05,471 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:42:05,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:01" (3/4) ... [2020-07-29 01:42:05,475 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:42:05,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:42:05,477 INFO L168 Benchmark]: Toolchain (without parser) took 5105.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 953.5 MB in the beginning and 972.5 MB in the end (delta: -19.0 MB). Peak memory consumption was 178.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:05,478 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:05,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.64 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:05,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:05,480 INFO L168 Benchmark]: Boogie Preprocessor took 30.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:05,481 INFO L168 Benchmark]: RCFGBuilder took 475.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:05,482 INFO L168 Benchmark]: BuchiAutomizer took 4232.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 972.5 MB in the end (delta: 107.5 MB). Peak memory consumption was 182.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:05,482 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:05,486 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.64 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4232.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 972.5 MB in the end (delta: 107.5 MB). Peak memory consumption was 182.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.15 ms. Allocated memory is still 1.2 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 47 SDslu, 29 SDs, 0 SdLazy, 63 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp95 ukn84 mio100 lsp83 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf143 smp94 tf103 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...