./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/systemc/toy2.cil.c -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 0f721563b23ef637d292551ef1a662f821e744b5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:03:53,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:03:53,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:03:53,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:03:53,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:03:53,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:03:53,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:03:53,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:03:53,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:03:53,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:03:53,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:03:53,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:03:53,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:03:53,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:03:53,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:03:53,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:03:53,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:03:53,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:03:53,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:03:53,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:03:53,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:03:53,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:03:53,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:03:53,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:03:53,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:03:53,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:03:53,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:03:53,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:03:53,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:03:53,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:03:53,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:03:53,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:03:53,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:03:53,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:03:53,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:03:53,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:03:53,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:03:53,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:03:53,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:03:53,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:03:53,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:03:53,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:03:53,887 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:03:53,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:03:53,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:03:53,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:03:53,889 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:03:53,889 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:03:53,890 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:03:53,890 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:03:53,890 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:03:53,890 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:03:53,891 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:03:53,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:03:53,891 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:03:53,892 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:03:53,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:03:53,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:03:53,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:03:53,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:03:53,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:03:53,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:03:53,893 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:03:53,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:03:53,894 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:03:53,894 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:03:53,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:03:53,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:03:53,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:03:53,895 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:03:53,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:03:53,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:03:53,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:03:53,896 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:03:53,897 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:03:53,897 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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2020-10-20 08:03:54,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:03:54,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:03:54,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:03:54,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:03:54,123 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:03:54,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2020-10-20 08:03:54,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89ead51c/2255daa1ed0e4dff8d4d08ce76aec67b/FLAG6145c6df3 [2020-10-20 08:03:54,629 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:03:54,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2020-10-20 08:03:54,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89ead51c/2255daa1ed0e4dff8d4d08ce76aec67b/FLAG6145c6df3 [2020-10-20 08:03:55,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89ead51c/2255daa1ed0e4dff8d4d08ce76aec67b [2020-10-20 08:03:55,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:03:55,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:03:55,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:03:55,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:03:55,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:03:55,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103c2e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55, skipping insertion in model container [2020-10-20 08:03:55,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:03:55,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:03:55,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:03:55,381 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:03:55,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:03:55,515 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:03:55,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55 WrapperNode [2020-10-20 08:03:55,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:03:55,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:03:55,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:03:55,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:03:55,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:03:55,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:03:55,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:03:55,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:03:55,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... [2020-10-20 08:03:55,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:03:55,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:03:55,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:03:55,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:03:55,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:03:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:03:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:03:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:03:56,373 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:03:56,373 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-10-20 08:03:56,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:56 BoogieIcfgContainer [2020-10-20 08:03:56,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:03:56,377 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:03:56,377 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:03:56,381 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:03:56,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:56,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:03:55" (1/3) ... [2020-10-20 08:03:56,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c07f41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:03:56, skipping insertion in model container [2020-10-20 08:03:56,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:56,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:55" (2/3) ... [2020-10-20 08:03:56,384 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c07f41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:03:56, skipping insertion in model container [2020-10-20 08:03:56,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:56,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:56" (3/3) ... [2020-10-20 08:03:56,386 INFO L373 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2020-10-20 08:03:56,435 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:03:56,436 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:03:56,436 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:03:56,436 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:03:56,437 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:03:56,437 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:03:56,437 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:03:56,438 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:03:56,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2020-10-20 08:03:56,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-20 08:03:56,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:56,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:56,502 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:56,503 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:56,503 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:03:56,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states. [2020-10-20 08:03:56,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-20 08:03:56,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:56,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:56,513 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:56,513 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:56,523 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 104#L396true assume !(1 == ~c_req_up~0); 108#L396-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 107#L407-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 125#L412-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 23#L417-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 40#L422-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 71#L427-1true assume !(0 == ~e_f~0); 95#L432-1true assume !(0 == ~e_g~0); 110#L437-1true assume !(0 == ~e_e~0); 3#L442-1true assume !(0 == ~e_c~0); 26#L447-1true assume !(0 == ~e_wl~0); 41#L452-1true assume !(1 == ~wl_pc~0); 19#L464true assume !(2 == ~wl_pc~0); 94#L465true assume !(1 == ~c1_pc~0); 17#L475true assume !(1 == ~c2_pc~0); 98#L484true assume !(1 == ~wb_pc~0); 68#L493true assume !(1 == ~e_c~0); 36#L502-1true assume !(1 == ~e_e~0); 63#L507-1true assume !(1 == ~e_f~0); 87#L512-1true assume !(1 == ~e_g~0); 99#L517-1true assume !(1 == ~e_c~0); 124#L522-1true assume !(1 == ~e_wl~0); 45#L664-1true [2020-10-20 08:03:56,524 INFO L796 eck$LassoCheckResult]: Loop: 45#L664-1true assume !false; 83#L534true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 74#L369true assume !true; 106#L385true start_simulation_~kernel_st~0 := 2; 58#L540true assume !(1 == ~c_req_up~0); 64#L540-2true start_simulation_~kernel_st~0 := 3; 14#L552true assume 0 == ~e_f~0;~e_f~0 := 1; 16#L552-2true assume 0 == ~e_g~0;~e_g~0 := 1; 35#L557-1true assume 0 == ~e_e~0;~e_e~0 := 1; 59#L562-1true assume 0 == ~e_c~0;~e_c~0 := 1; 84#L567-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 117#L572-1true assume 1 == ~wl_pc~0; 81#L578true assume 1 == ~e_wl~0;~wl_st~0 := 0; 13#L585true assume !(1 == ~c1_pc~0); 54#L595true assume !(1 == ~c2_pc~0); 29#L604true assume !(1 == ~wb_pc~0); 127#L613true assume 1 == ~e_c~0;~r_st~0 := 0; 80#L622-1true assume 1 == ~e_e~0;~e_e~0 := 2; 114#L627-1true assume 1 == ~e_f~0;~e_f~0 := 2; 9#L632-1true assume 1 == ~e_g~0;~e_g~0 := 2; 30#L637-1true assume 1 == ~e_c~0;~e_c~0 := 2; 46#L642-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 77#L647-1true assume 0 == ~wl_st~0; 45#L664-1true [2020-10-20 08:03:56,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2020-10-20 08:03:56,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:56,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295325960] [2020-10-20 08:03:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:56,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295325960] [2020-10-20 08:03:56,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:56,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:56,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116710898] [2020-10-20 08:03:56,764 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1991744151, now seen corresponding path program 1 times [2020-10-20 08:03:56,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:56,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923833979] [2020-10-20 08:03:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:56,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923833979] [2020-10-20 08:03:56,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:56,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:56,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421694606] [2020-10-20 08:03:56,808 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:56,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:03:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:03:56,831 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 2 states. [2020-10-20 08:03:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:56,849 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2020-10-20 08:03:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:03:56,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 217 transitions. [2020-10-20 08:03:56,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:56,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 212 transitions. [2020-10-20 08:03:56,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-20 08:03:56,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-20 08:03:56,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 212 transitions. [2020-10-20 08:03:56,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:56,868 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2020-10-20 08:03:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 212 transitions. [2020-10-20 08:03:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-20 08:03:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-20 08:03:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 212 transitions. [2020-10-20 08:03:56,912 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2020-10-20 08:03:56,912 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 212 transitions. [2020-10-20 08:03:56,913 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:03:56,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 212 transitions. [2020-10-20 08:03:56,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:56,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:56,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:56,917 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:56,917 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:56,918 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 275#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 276#L396 assume !(1 == ~c_req_up~0); 331#L396-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 374#L407-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 375#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 296#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 297#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 322#L427-1 assume !(0 == ~e_f~0); 355#L432-1 assume !(0 == ~e_g~0); 370#L437-1 assume !(0 == ~e_e~0); 258#L442-1 assume !(0 == ~e_c~0); 259#L447-1 assume !(0 == ~e_wl~0); 301#L452-1 assume !(1 == ~wl_pc~0); 289#L464 assume !(2 == ~wl_pc~0); 290#L465 assume !(1 == ~c1_pc~0); 285#L475 assume !(1 == ~c2_pc~0); 287#L484 assume !(1 == ~wb_pc~0); 293#L493 assume !(1 == ~e_c~0); 318#L502-1 assume !(1 == ~e_e~0); 319#L507-1 assume !(1 == ~e_f~0); 348#L512-1 assume !(1 == ~e_g~0); 364#L517-1 assume !(1 == ~e_c~0); 372#L522-1 assume !(1 == ~e_wl~0); 324#L664-1 [2020-10-20 08:03:56,918 INFO L796 eck$LassoCheckResult]: Loop: 324#L664-1 assume !false; 327#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 268#L369 assume !false; 335#L287 assume !(0 == ~wl_st~0); 337#L291 assume !(0 == ~c1_st~0); 373#L294 assume !(0 == ~c2_st~0); 362#L297 assume !(0 == ~wb_st~0); 363#L300 assume !(0 == ~r_st~0); 368#L385 start_simulation_~kernel_st~0 := 2; 346#L540 assume !(1 == ~c_req_up~0); 288#L540-2 start_simulation_~kernel_st~0 := 3; 280#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 281#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 284#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 317#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 347#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 361#L572-1 assume !(1 == ~wl_pc~0); 342#L584 assume !(2 == ~wl_pc~0); 279#L585 assume !(1 == ~c1_pc~0); 278#L595 assume !(1 == ~c2_pc~0); 305#L604 assume !(1 == ~wb_pc~0); 306#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 358#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 359#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 271#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 272#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 308#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 328#L647-1 assume 0 == ~wl_st~0; 324#L664-1 [2020-10-20 08:03:56,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2020-10-20 08:03:56,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:56,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422559337] [2020-10-20 08:03:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:56,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422559337] [2020-10-20 08:03:56,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:56,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:56,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451247331] [2020-10-20 08:03:56,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 1 times [2020-10-20 08:03:56,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:56,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687151405] [2020-10-20 08:03:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687151405] [2020-10-20 08:03:57,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:57,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006603206] [2020-10-20 08:03:57,007 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:57,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:57,008 INFO L87 Difference]: Start difference. First operand 119 states and 212 transitions. cyclomatic complexity: 94 Second operand 3 states. [2020-10-20 08:03:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:57,032 INFO L93 Difference]: Finished difference Result 119 states and 211 transitions. [2020-10-20 08:03:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:57,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 211 transitions. [2020-10-20 08:03:57,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:57,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 211 transitions. [2020-10-20 08:03:57,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-20 08:03:57,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-20 08:03:57,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 211 transitions. [2020-10-20 08:03:57,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:57,039 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2020-10-20 08:03:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 211 transitions. [2020-10-20 08:03:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-20 08:03:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-20 08:03:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 211 transitions. [2020-10-20 08:03:57,048 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2020-10-20 08:03:57,048 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 211 transitions. [2020-10-20 08:03:57,048 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:03:57,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 211 transitions. [2020-10-20 08:03:57,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:57,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:57,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:57,064 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,066 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,066 INFO L794 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 520#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 521#L396 assume !(1 == ~c_req_up~0); 576#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 619#L407-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 620#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 541#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 542#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 567#L427-1 assume !(0 == ~e_f~0); 600#L432-1 assume !(0 == ~e_g~0); 615#L437-1 assume !(0 == ~e_e~0); 503#L442-1 assume !(0 == ~e_c~0); 504#L447-1 assume !(0 == ~e_wl~0); 546#L452-1 assume !(1 == ~wl_pc~0); 534#L464 assume !(2 == ~wl_pc~0); 535#L465 assume !(1 == ~c1_pc~0); 530#L475 assume !(1 == ~c2_pc~0); 532#L484 assume !(1 == ~wb_pc~0); 538#L493 assume !(1 == ~e_c~0); 563#L502-1 assume !(1 == ~e_e~0); 564#L507-1 assume !(1 == ~e_f~0); 593#L512-1 assume !(1 == ~e_g~0); 609#L517-1 assume !(1 == ~e_c~0); 617#L522-1 assume !(1 == ~e_wl~0); 569#L664-1 [2020-10-20 08:03:57,067 INFO L796 eck$LassoCheckResult]: Loop: 569#L664-1 assume !false; 572#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 513#L369 assume !false; 580#L287 assume !(0 == ~wl_st~0); 582#L291 assume !(0 == ~c1_st~0); 618#L294 assume !(0 == ~c2_st~0); 607#L297 assume !(0 == ~wb_st~0); 608#L300 assume !(0 == ~r_st~0); 613#L385 start_simulation_~kernel_st~0 := 2; 591#L540 assume !(1 == ~c_req_up~0); 533#L540-2 start_simulation_~kernel_st~0 := 3; 525#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 526#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 529#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 562#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 592#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 606#L572-1 assume !(1 == ~wl_pc~0); 587#L584 assume !(2 == ~wl_pc~0); 524#L585 assume !(1 == ~c1_pc~0); 523#L595 assume !(1 == ~c2_pc~0); 550#L604 assume !(1 == ~wb_pc~0); 551#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 603#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 604#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 516#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 517#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 553#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 573#L647-1 assume 0 == ~wl_st~0; 569#L664-1 [2020-10-20 08:03:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2020-10-20 08:03:57,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568060630] [2020-10-20 08:03:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568060630] [2020-10-20 08:03:57,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:57,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917386446] [2020-10-20 08:03:57,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 2 times [2020-10-20 08:03:57,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026577514] [2020-10-20 08:03:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026577514] [2020-10-20 08:03:57,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:57,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760555380] [2020-10-20 08:03:57,199 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:57,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:57,200 INFO L87 Difference]: Start difference. First operand 119 states and 211 transitions. cyclomatic complexity: 93 Second operand 3 states. [2020-10-20 08:03:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:57,218 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2020-10-20 08:03:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:57,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 210 transitions. [2020-10-20 08:03:57,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:57,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 210 transitions. [2020-10-20 08:03:57,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-20 08:03:57,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-20 08:03:57,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 210 transitions. [2020-10-20 08:03:57,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:57,224 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2020-10-20 08:03:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 210 transitions. [2020-10-20 08:03:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-20 08:03:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-20 08:03:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 210 transitions. [2020-10-20 08:03:57,232 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2020-10-20 08:03:57,232 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 210 transitions. [2020-10-20 08:03:57,232 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:03:57,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 210 transitions. [2020-10-20 08:03:57,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:57,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:57,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:57,235 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,235 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,235 INFO L794 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 765#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 766#L396 assume !(1 == ~c_req_up~0); 821#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 864#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 865#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 786#L417-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 787#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 812#L427-1 assume !(0 == ~e_f~0); 845#L432-1 assume !(0 == ~e_g~0); 860#L437-1 assume !(0 == ~e_e~0); 748#L442-1 assume !(0 == ~e_c~0); 749#L447-1 assume !(0 == ~e_wl~0); 791#L452-1 assume !(1 == ~wl_pc~0); 779#L464 assume !(2 == ~wl_pc~0); 780#L465 assume !(1 == ~c1_pc~0); 775#L475 assume !(1 == ~c2_pc~0); 777#L484 assume !(1 == ~wb_pc~0); 783#L493 assume !(1 == ~e_c~0); 808#L502-1 assume !(1 == ~e_e~0); 809#L507-1 assume !(1 == ~e_f~0); 838#L512-1 assume !(1 == ~e_g~0); 854#L517-1 assume !(1 == ~e_c~0); 862#L522-1 assume !(1 == ~e_wl~0); 814#L664-1 [2020-10-20 08:03:57,236 INFO L796 eck$LassoCheckResult]: Loop: 814#L664-1 assume !false; 817#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 758#L369 assume !false; 825#L287 assume !(0 == ~wl_st~0); 827#L291 assume !(0 == ~c1_st~0); 863#L294 assume !(0 == ~c2_st~0); 852#L297 assume !(0 == ~wb_st~0); 853#L300 assume !(0 == ~r_st~0); 858#L385 start_simulation_~kernel_st~0 := 2; 836#L540 assume !(1 == ~c_req_up~0); 778#L540-2 start_simulation_~kernel_st~0 := 3; 770#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 771#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 774#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 807#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 837#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 851#L572-1 assume !(1 == ~wl_pc~0); 832#L584 assume !(2 == ~wl_pc~0); 769#L585 assume !(1 == ~c1_pc~0); 768#L595 assume !(1 == ~c2_pc~0); 795#L604 assume !(1 == ~wb_pc~0); 796#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 848#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 849#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 761#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 762#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 818#L647-1 assume 0 == ~wl_st~0; 814#L664-1 [2020-10-20 08:03:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2020-10-20 08:03:57,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377304254] [2020-10-20 08:03:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377304254] [2020-10-20 08:03:57,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:57,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028845919] [2020-10-20 08:03:57,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 3 times [2020-10-20 08:03:57,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703776010] [2020-10-20 08:03:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703776010] [2020-10-20 08:03:57,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:57,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341424816] [2020-10-20 08:03:57,302 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:57,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:57,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:57,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:57,302 INFO L87 Difference]: Start difference. First operand 119 states and 210 transitions. cyclomatic complexity: 92 Second operand 3 states. [2020-10-20 08:03:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:57,333 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2020-10-20 08:03:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:57,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 209 transitions. [2020-10-20 08:03:57,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:57,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 209 transitions. [2020-10-20 08:03:57,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-20 08:03:57,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-10-20 08:03:57,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 209 transitions. [2020-10-20 08:03:57,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:57,354 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2020-10-20 08:03:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 209 transitions. [2020-10-20 08:03:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-20 08:03:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-20 08:03:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 209 transitions. [2020-10-20 08:03:57,362 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2020-10-20 08:03:57,362 INFO L594 BuchiCegarLoop]: Abstraction has 119 states and 209 transitions. [2020-10-20 08:03:57,362 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:03:57,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 209 transitions. [2020-10-20 08:03:57,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 88 [2020-10-20 08:03:57,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:57,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:57,365 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,366 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,366 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1010#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1011#L396 assume !(1 == ~c_req_up~0); 1066#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1109#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1110#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1031#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1032#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1057#L427-1 assume !(0 == ~e_f~0); 1090#L432-1 assume !(0 == ~e_g~0); 1105#L437-1 assume !(0 == ~e_e~0); 993#L442-1 assume !(0 == ~e_c~0); 994#L447-1 assume !(0 == ~e_wl~0); 1036#L452-1 assume !(1 == ~wl_pc~0); 1024#L464 assume !(2 == ~wl_pc~0); 1025#L465 assume !(1 == ~c1_pc~0); 1020#L475 assume !(1 == ~c2_pc~0); 1022#L484 assume !(1 == ~wb_pc~0); 1028#L493 assume !(1 == ~e_c~0); 1053#L502-1 assume !(1 == ~e_e~0); 1054#L507-1 assume !(1 == ~e_f~0); 1083#L512-1 assume !(1 == ~e_g~0); 1099#L517-1 assume !(1 == ~e_c~0); 1107#L522-1 assume !(1 == ~e_wl~0); 1059#L664-1 [2020-10-20 08:03:57,366 INFO L796 eck$LassoCheckResult]: Loop: 1059#L664-1 assume !false; 1062#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1003#L369 assume !false; 1070#L287 assume !(0 == ~wl_st~0); 1072#L291 assume !(0 == ~c1_st~0); 1108#L294 assume !(0 == ~c2_st~0); 1097#L297 assume !(0 == ~wb_st~0); 1098#L300 assume !(0 == ~r_st~0); 1103#L385 start_simulation_~kernel_st~0 := 2; 1081#L540 assume !(1 == ~c_req_up~0); 1023#L540-2 start_simulation_~kernel_st~0 := 3; 1015#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 1016#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1019#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1052#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1082#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1096#L572-1 assume !(1 == ~wl_pc~0); 1077#L584 assume !(2 == ~wl_pc~0); 1014#L585 assume !(1 == ~c1_pc~0); 1013#L595 assume !(1 == ~c2_pc~0); 1040#L604 assume !(1 == ~wb_pc~0); 1041#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 1093#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1094#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1006#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1007#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1043#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1063#L647-1 assume 0 == ~wl_st~0; 1059#L664-1 [2020-10-20 08:03:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2020-10-20 08:03:57,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4367978] [2020-10-20 08:03:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:57,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:57,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:57,432 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash 860549372, now seen corresponding path program 4 times [2020-10-20 08:03:57,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615064383] [2020-10-20 08:03:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615064383] [2020-10-20 08:03:57,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:57,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955383085] [2020-10-20 08:03:57,457 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:57,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:57,459 INFO L87 Difference]: Start difference. First operand 119 states and 209 transitions. cyclomatic complexity: 91 Second operand 3 states. [2020-10-20 08:03:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:57,512 INFO L93 Difference]: Finished difference Result 171 states and 297 transitions. [2020-10-20 08:03:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:57,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 297 transitions. [2020-10-20 08:03:57,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2020-10-20 08:03:57,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 297 transitions. [2020-10-20 08:03:57,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2020-10-20 08:03:57,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2020-10-20 08:03:57,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 297 transitions. [2020-10-20 08:03:57,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:57,521 INFO L691 BuchiCegarLoop]: Abstraction has 171 states and 297 transitions. [2020-10-20 08:03:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 297 transitions. [2020-10-20 08:03:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-20 08:03:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-20 08:03:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 297 transitions. [2020-10-20 08:03:57,531 INFO L714 BuchiCegarLoop]: Abstraction has 171 states and 297 transitions. [2020-10-20 08:03:57,531 INFO L594 BuchiCegarLoop]: Abstraction has 171 states and 297 transitions. [2020-10-20 08:03:57,532 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:03:57,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 297 transitions. [2020-10-20 08:03:57,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 140 [2020-10-20 08:03:57,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:57,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:57,535 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,535 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:57,535 INFO L794 eck$LassoCheckResult]: Stem: 1403#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1307#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1308#L396 assume !(1 == ~c_req_up~0); 1364#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1410#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1411#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1328#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1329#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1355#L427-1 assume !(0 == ~e_f~0); 1389#L432-1 assume !(0 == ~e_g~0); 1406#L437-1 assume !(0 == ~e_e~0); 1289#L442-1 assume !(0 == ~e_c~0); 1290#L447-1 assume !(0 == ~e_wl~0); 1333#L452-1 assume !(1 == ~wl_pc~0); 1321#L464 assume !(2 == ~wl_pc~0); 1322#L465 assume !(1 == ~c1_pc~0); 1317#L475 assume !(1 == ~c2_pc~0); 1319#L484 assume !(1 == ~wb_pc~0); 1325#L493 assume !(1 == ~e_c~0); 1350#L502-1 assume !(1 == ~e_e~0); 1351#L507-1 assume !(1 == ~e_f~0); 1382#L512-1 assume !(1 == ~e_g~0); 1401#L517-1 assume !(1 == ~e_c~0); 1408#L522-1 assume !(1 == ~e_wl~0); 1415#L664-1 [2020-10-20 08:03:57,536 INFO L796 eck$LassoCheckResult]: Loop: 1415#L664-1 assume !false; 1419#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1418#L369 assume !false; 1417#L287 assume !(0 == ~wl_st~0); 1370#L291 assume !(0 == ~c1_st~0); 1409#L294 assume !(0 == ~c2_st~0); 1398#L297 assume !(0 == ~wb_st~0); 1400#L300 assume !(0 == ~r_st~0); 1404#L385 start_simulation_~kernel_st~0 := 2; 1380#L540 assume !(1 == ~c_req_up~0); 1320#L540-2 start_simulation_~kernel_st~0 := 3; 1312#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 1313#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1316#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1349#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1381#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1397#L572-1 assume 1 == ~wl_pc~0; 1395#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1311#L585 assume !(1 == ~c1_pc~0); 1310#L595 assume !(1 == ~c2_pc~0); 1337#L604 assume !(1 == ~wb_pc~0); 1338#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 1393#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1394#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1303#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1304#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1340#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1361#L647-1 assume 0 == ~wl_st~0; 1415#L664-1 [2020-10-20 08:03:57,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2020-10-20 08:03:57,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119414657] [2020-10-20 08:03:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:57,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:57,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:57,583 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash 311289651, now seen corresponding path program 1 times [2020-10-20 08:03:57,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128107026] [2020-10-20 08:03:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:57,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:57,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:57,603 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -629054583, now seen corresponding path program 1 times [2020-10-20 08:03:57,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:57,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688021207] [2020-10-20 08:03:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688021207] [2020-10-20 08:03:57,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:57,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:57,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330160345] [2020-10-20 08:03:57,755 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-20 08:03:57,856 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:57,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:57,858 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:57,858 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:57,858 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:57,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:57,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:57,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2020-10-20 08:03:57,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:57,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:57,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,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-10-20 08:03:57,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,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-10-20 08:03:57,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,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-10-20 08:03:57,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,280 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:58,280 INFO L404 LassoAnalysis]: Checking for nontermination... 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-10-20 08:03:58,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,312 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-20 08:03:58,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,367 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,372 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-10-20 08:03:58,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,437 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:58,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:58,503 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,516 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:58,550 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:58,550 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:58,551 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:58,551 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:58,551 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:58,551 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,551 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:58,551 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:58,551 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration6_Loop [2020-10-20 08:03:58,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:58,552 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:58,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:58,966 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:58,972 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 08:03:58,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:58,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:58,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:58,991 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:58,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:58,996 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:58,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,000 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) [2020-10-20 08:03:59,042 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-10-20 08:03:59,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,049 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) [2020-10-20 08:03:59,099 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-10-20 08:03:59,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:59,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:59,116 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:59,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:59,126 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,127 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2020-10-20 08:03:59,167 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:59,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:59,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:59,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:59,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:59,444 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:03:59,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 297 transitions. cyclomatic complexity: 127 Second operand 5 states. [2020-10-20 08:03:59,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 297 transitions. cyclomatic complexity: 127. Second operand 5 states. Result 599 states and 1036 transitions. Complement of second has 5 states. [2020-10-20 08:03:59,561 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-10-20 08:03:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2020-10-20 08:03:59,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:59,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:59,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:59,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:59,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 366 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:59,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:59,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 599 states and 1036 transitions. [2020-10-20 08:03:59,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 420 [2020-10-20 08:03:59,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 599 states to 599 states and 1036 transitions. [2020-10-20 08:03:59,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 452 [2020-10-20 08:03:59,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2020-10-20 08:03:59,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 599 states and 1036 transitions. [2020-10-20 08:03:59,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:59,588 INFO L691 BuchiCegarLoop]: Abstraction has 599 states and 1036 transitions. [2020-10-20 08:03:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states and 1036 transitions. [2020-10-20 08:03:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 455. [2020-10-20 08:03:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-20 08:03:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 789 transitions. [2020-10-20 08:03:59,608 INFO L714 BuchiCegarLoop]: Abstraction has 455 states and 789 transitions. [2020-10-20 08:03:59,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:59,609 INFO L87 Difference]: Start difference. First operand 455 states and 789 transitions. Second operand 3 states. [2020-10-20 08:03:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:59,642 INFO L93 Difference]: Finished difference Result 455 states and 780 transitions. [2020-10-20 08:03:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:59,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 780 transitions. [2020-10-20 08:03:59,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 280 [2020-10-20 08:03:59,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 455 states and 780 transitions. [2020-10-20 08:03:59,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2020-10-20 08:03:59,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2020-10-20 08:03:59,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 455 states and 780 transitions. [2020-10-20 08:03:59,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:59,653 INFO L691 BuchiCegarLoop]: Abstraction has 455 states and 780 transitions. [2020-10-20 08:03:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 780 transitions. [2020-10-20 08:03:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2020-10-20 08:03:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-20 08:03:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 780 transitions. [2020-10-20 08:03:59,665 INFO L714 BuchiCegarLoop]: Abstraction has 455 states and 780 transitions. [2020-10-20 08:03:59,665 INFO L594 BuchiCegarLoop]: Abstraction has 455 states and 780 transitions. [2020-10-20 08:03:59,665 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:03:59,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 780 transitions. [2020-10-20 08:03:59,668 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 280 [2020-10-20 08:03:59,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:59,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:59,671 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:59,671 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:59,671 INFO L794 eck$LassoCheckResult]: Stem: 3359#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3181#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 3182#L396 assume !(1 == ~c_req_up~0); 3281#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3374#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3375#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3214#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3215#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3262#L427-1 assume !(0 == ~e_f~0); 3330#L432-1 assume !(0 == ~e_g~0); 3365#L437-1 assume !(0 == ~e_e~0); 3148#L442-1 assume !(0 == ~e_c~0); 3149#L447-1 assume !(0 == ~e_wl~0); 3222#L452-1 assume !(1 == ~wl_pc~0); 3205#L464 assume !(2 == ~wl_pc~0); 3206#L465 assume !(1 == ~c1_pc~0); 3200#L475 assume !(1 == ~c2_pc~0); 3202#L484 assume !(1 == ~wb_pc~0); 3209#L493 assume !(1 == ~e_c~0); 3257#L502-1 assume !(1 == ~e_e~0); 3258#L507-1 assume !(1 == ~e_f~0); 3317#L512-1 assume !(1 == ~e_g~0); 3355#L517-1 assume !(1 == ~e_c~0); 3368#L522-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3269#L664-1 [2020-10-20 08:03:59,672 INFO L796 eck$LassoCheckResult]: Loop: 3269#L664-1 assume !false; 3270#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 3165#L369 assume !false; 3289#L287 assume 0 == ~wl_st~0; 3290#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 3360#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 3322#L58 assume 0 == ~wl_pc~0; 3296#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 3288#L309 assume !(0 == ~c1_st~0); 3534#L324 assume !(0 == ~c2_st~0); 3407#L339 assume !(0 == ~wb_st~0); 3405#L354 assume !(0 == ~r_st~0); 3394#L369 assume !false; 3395#L287 assume !(0 == ~wl_st~0); 3383#L291 assume !(0 == ~c1_st~0); 3370#L294 assume !(0 == ~c2_st~0); 3372#L297 assume !(0 == ~wb_st~0); 3416#L300 assume !(0 == ~r_st~0); 3415#L385 start_simulation_~kernel_st~0 := 2; 3413#L540 assume !(1 == ~c_req_up~0); 3412#L540-2 start_simulation_~kernel_st~0 := 3; 3411#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 3410#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3409#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3402#L562-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3403#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3476#L572-1 assume 1 == ~wl_pc~0; 3475#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3474#L585 assume !(1 == ~c1_pc~0); 3599#L595 assume !(1 == ~c2_pc~0); 3597#L604 assume !(1 == ~wb_pc~0); 3595#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 3594#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3593#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3592#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3235#L637-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3236#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3561#L647-1 assume 0 == ~wl_st~0; 3269#L664-1 [2020-10-20 08:03:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2020-10-20 08:03:59,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:59,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918413243] [2020-10-20 08:03:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:59,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918413243] [2020-10-20 08:03:59,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:59,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:59,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827143834] [2020-10-20 08:03:59,718 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 378230695, now seen corresponding path program 1 times [2020-10-20 08:03:59,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:59,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102906249] [2020-10-20 08:03:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:59,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:59,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:59,739 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:59,935 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-10-20 08:04:00,003 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:04:00,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:04:00,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:04:00,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:04:00,004 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:04:00,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:04:00,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:04:00,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2020-10-20 08:04:00,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:04:00,004 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:04:00,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,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-10-20 08:04:00,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,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-10-20 08:04:00,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-10-20 08:04:00,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,362 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:04:00,362 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 08:04:00,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,366 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:00,371 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-20 08:04:00,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,428 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,433 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:00,433 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-20 08:04:00,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,472 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:00,475 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-20 08:04:00,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,519 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,524 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:00,524 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-10-20 08:04:00,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,562 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:04:00,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:00,597 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:04:00,617 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:04:00,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:04:00,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:04:00,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:04:00,618 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:04:00,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,618 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:04:00,618 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:04:00,618 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2020-10-20 08:04:00,618 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:04:00,618 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:04:00,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,981 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:04:00,981 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,004 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-10-20 08:04:01,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:01,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:01,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:01,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:01,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:01,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:01,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:01,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:01,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:01,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:01,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:01,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:01,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:01,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:01,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:01,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:01,121 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-10-20 08:04:01,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:01,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:01,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:01,124 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:01,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:01,128 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:01,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,131 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:01,181 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-10-20 08:04:01,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:01,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:01,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:01,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:01,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:01,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:01,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,186 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) [2020-10-20 08:04:01,245 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-10-20 08:04:01,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:01,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:01,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:01,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:01,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:01,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:01,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:04:01,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:04:01,257 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) [2020-10-20 08:04:01,276 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:04:01,276 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:04:01,276 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:04:01,276 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~wl_pc~0) = -2*~wl_pc~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:04:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:01,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:04:01,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:04:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:01,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:04:01,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:04:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:01,489 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:04:01,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 780 transitions. cyclomatic complexity: 328 Second operand 5 states. [2020-10-20 08:04:01,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 780 transitions. cyclomatic complexity: 328. Second operand 5 states. Result 882 states and 1504 transitions. Complement of second has 7 states. [2020-10-20 08:04:01,620 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-10-20 08:04:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:04:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2020-10-20 08:04:01,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 364 transitions. Stem has 24 letters. Loop has 38 letters. [2020-10-20 08:04:01,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:01,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 364 transitions. Stem has 62 letters. Loop has 38 letters. [2020-10-20 08:04:01,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:01,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 364 transitions. Stem has 24 letters. Loop has 76 letters. [2020-10-20 08:04:01,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:01,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 1504 transitions. [2020-10-20 08:04:01,634 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 532 [2020-10-20 08:04:01,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 869 states and 1486 transitions. [2020-10-20 08:04:01,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2020-10-20 08:04:01,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2020-10-20 08:04:01,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 869 states and 1486 transitions. [2020-10-20 08:04:01,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:01,655 INFO L691 BuchiCegarLoop]: Abstraction has 869 states and 1486 transitions. [2020-10-20 08:04:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states and 1486 transitions. [2020-10-20 08:04:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 714. [2020-10-20 08:04:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-10-20 08:04:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1225 transitions. [2020-10-20 08:04:01,673 INFO L714 BuchiCegarLoop]: Abstraction has 714 states and 1225 transitions. [2020-10-20 08:04:01,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:04:01,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:04:01,674 INFO L87 Difference]: Start difference. First operand 714 states and 1225 transitions. Second operand 4 states. [2020-10-20 08:04:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:01,788 INFO L93 Difference]: Finished difference Result 1180 states and 2016 transitions. [2020-10-20 08:04:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:04:01,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1180 states and 2016 transitions. [2020-10-20 08:04:01,802 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 603 [2020-10-20 08:04:01,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1180 states to 1180 states and 2016 transitions. [2020-10-20 08:04:01,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 709 [2020-10-20 08:04:01,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 709 [2020-10-20 08:04:01,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1180 states and 2016 transitions. [2020-10-20 08:04:01,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:01,815 INFO L691 BuchiCegarLoop]: Abstraction has 1180 states and 2016 transitions. [2020-10-20 08:04:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states and 2016 transitions. [2020-10-20 08:04:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1178. [2020-10-20 08:04:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2020-10-20 08:04:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2014 transitions. [2020-10-20 08:04:01,836 INFO L714 BuchiCegarLoop]: Abstraction has 1178 states and 2014 transitions. [2020-10-20 08:04:01,836 INFO L594 BuchiCegarLoop]: Abstraction has 1178 states and 2014 transitions. [2020-10-20 08:04:01,836 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:04:01,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1178 states and 2014 transitions. [2020-10-20 08:04:01,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 603 [2020-10-20 08:04:01,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:01,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:01,846 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:01,846 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:01,846 INFO L794 eck$LassoCheckResult]: Stem: 6822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6630#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 6631#L396 assume !(1 == ~c_req_up~0); 6839#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6848#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6862#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6863#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6714#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6715#L427-1 assume !(0 == ~e_f~0); 6790#L432-1 assume !(0 == ~e_g~0); 6849#L437-1 assume !(0 == ~e_e~0); 6850#L442-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6599#L447-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6671#L452-1 assume !(1 == ~wl_pc~0); 7001#L464 assume !(2 == ~wl_pc~0); 6971#L465 assume !(1 == ~c1_pc~0); 6966#L475 assume !(1 == ~c2_pc~0); 6914#L484 assume !(1 == ~wb_pc~0); 6911#L493 assume !(1 == ~e_c~0); 6909#L502-1 assume !(1 == ~e_e~0); 6907#L507-1 assume !(1 == ~e_f~0); 6905#L512-1 assume !(1 == ~e_g~0); 6902#L517-1 assume !(1 == ~e_c~0); 6893#L522-1 assume !(1 == ~e_wl~0); 6861#L664-1 assume !false; 7063#L534 [2020-10-20 08:04:01,847 INFO L796 eck$LassoCheckResult]: Loop: 7063#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 7243#L369 assume !false; 7241#L287 assume 0 == ~wl_st~0; 7239#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 7235#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 7232#L58 assume 0 == ~wl_pc~0; 6754#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 7692#L309 assume !(0 == ~c1_st~0); 7681#L324 assume !(0 == ~c2_st~0); 7672#L339 assume !(0 == ~wb_st~0); 7669#L354 assume !(0 == ~r_st~0); 7666#L369 assume !false; 7616#L287 assume !(0 == ~wl_st~0); 7614#L291 assume !(0 == ~c1_st~0); 7611#L294 assume !(0 == ~c2_st~0); 7608#L297 assume !(0 == ~wb_st~0); 7605#L300 assume !(0 == ~r_st~0); 7603#L385 start_simulation_~kernel_st~0 := 2; 7600#L540 assume !(1 == ~c_req_up~0); 7597#L540-2 start_simulation_~kernel_st~0 := 3; 7595#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 7593#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 7591#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7586#L562-1 assume !(0 == ~e_c~0); 6804#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6805#L572-1 assume 1 == ~wl_pc~0; 7636#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 7635#L585 assume !(1 == ~c1_pc~0); 7633#L595 assume !(1 == ~c2_pc~0); 7629#L604 assume !(1 == ~wb_pc~0); 7626#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 7624#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 7622#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 7620#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 7619#L637-1 assume !(1 == ~e_c~0); 7293#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7291#L647-1 assume 0 == ~wl_st~0; 7292#L664-1 assume !false; 7063#L534 [2020-10-20 08:04:01,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,848 INFO L82 PathProgramCache]: Analyzing trace with hash 931746300, now seen corresponding path program 1 times [2020-10-20 08:04:01,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:01,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416466077] [2020-10-20 08:04:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:01,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416466077] [2020-10-20 08:04:01,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:01,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:04:01,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918816991] [2020-10-20 08:04:01,894 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1422753563, now seen corresponding path program 1 times [2020-10-20 08:04:01,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:01,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146708352] [2020-10-20 08:04:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:04:01,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146708352] [2020-10-20 08:04:01,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:01,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:01,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251616938] [2020-10-20 08:04:01,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:04:01,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:04:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:04:01,932 INFO L87 Difference]: Start difference. First operand 1178 states and 2014 transitions. cyclomatic complexity: 844 Second operand 4 states. [2020-10-20 08:04:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:02,060 INFO L93 Difference]: Finished difference Result 2126 states and 3618 transitions. [2020-10-20 08:04:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:04:02,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2126 states and 3618 transitions. [2020-10-20 08:04:02,076 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1099 [2020-10-20 08:04:02,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2126 states to 2126 states and 3618 transitions. [2020-10-20 08:04:02,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1284 [2020-10-20 08:04:02,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1284 [2020-10-20 08:04:02,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2126 states and 3618 transitions. [2020-10-20 08:04:02,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:02,096 INFO L691 BuchiCegarLoop]: Abstraction has 2126 states and 3618 transitions. [2020-10-20 08:04:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states and 3618 transitions. [2020-10-20 08:04:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2106. [2020-10-20 08:04:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-20 08:04:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3598 transitions. [2020-10-20 08:04:02,134 INFO L714 BuchiCegarLoop]: Abstraction has 2106 states and 3598 transitions. [2020-10-20 08:04:02,134 INFO L594 BuchiCegarLoop]: Abstraction has 2106 states and 3598 transitions. [2020-10-20 08:04:02,134 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:04:02,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2106 states and 3598 transitions. [2020-10-20 08:04:02,145 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1099 [2020-10-20 08:04:02,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:02,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:02,146 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,146 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,147 INFO L794 eck$LassoCheckResult]: Stem: 10149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 9944#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 9945#L396 assume !(1 == ~c_req_up~0); 10172#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10187#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10207#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10208#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10031#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 10032#L427-1 assume !(0 == ~e_f~0); 10118#L432-1 assume !(0 == ~e_g~0); 10161#L437-1 assume !(0 == ~e_e~0); 9912#L442-1 assume !(0 == ~e_c~0); 9913#L447-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10817#L452-1 assume !(1 == ~wl_pc~0); 10951#L464 assume !(2 == ~wl_pc~0); 10949#L465 assume !(1 == ~c1_pc~0); 10947#L475 assume !(1 == ~c2_pc~0); 10945#L484 assume !(1 == ~wb_pc~0); 10943#L493 assume !(1 == ~e_c~0); 10940#L502-1 assume !(1 == ~e_e~0); 10937#L507-1 assume 1 == ~e_f~0;~e_f~0 := 2; 10934#L512-1 assume !(1 == ~e_g~0); 10802#L517-1 assume !(1 == ~e_c~0); 10163#L522-1 assume !(1 == ~e_wl~0); 10206#L664-1 assume !false; 10716#L534 [2020-10-20 08:04:02,147 INFO L796 eck$LassoCheckResult]: Loop: 10716#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 11949#L369 assume !false; 11797#L287 assume 0 == ~wl_st~0; 11798#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 11787#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 11789#L58 assume 0 == ~wl_pc~0; 10173#L71 ~wl_st~0 := 2;~wl_pc~0 := 1;~e_wl~0 := 0; 10174#L309 assume !(0 == ~c1_st~0); 11892#L324 assume !(0 == ~c2_st~0); 11785#L339 assume !(0 == ~wb_st~0); 11783#L354 assume !(0 == ~r_st~0); 10121#L369 assume !false; 10122#L287 assume !(0 == ~wl_st~0); 10209#L291 assume !(0 == ~c1_st~0); 10210#L294 assume !(0 == ~c2_st~0); 10140#L297 assume !(0 == ~wb_st~0); 10142#L300 assume !(0 == ~r_st~0); 10177#L385 start_simulation_~kernel_st~0 := 2; 10178#L540 assume !(1 == ~c_req_up~0); 11697#L540-2 start_simulation_~kernel_st~0 := 3; 11698#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 9958#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9959#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10095#L562-1 assume !(0 == ~e_c~0); 10096#L567-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 10135#L572-1 assume 1 == ~wl_pc~0; 11319#L578 assume 1 == ~e_wl~0;~wl_st~0 := 0; 11320#L585 assume !(1 == ~c1_pc~0); 11308#L595 assume !(1 == ~c2_pc~0); 11307#L604 assume !(1 == ~wb_pc~0); 11831#L613 assume 1 == ~e_c~0;~r_st~0 := 0; 11830#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 11829#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 11294#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 11828#L637-1 assume !(1 == ~e_c~0); 11814#L642-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 11012#L647-1 assume 0 == ~wl_st~0; 11980#L664-1 assume !false; 10716#L534 [2020-10-20 08:04:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,147 INFO L82 PathProgramCache]: Analyzing trace with hash -81217992, now seen corresponding path program 1 times [2020-10-20 08:04:02,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447416091] [2020-10-20 08:04:02,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447416091] [2020-10-20 08:04:02,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:04:02,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945920532] [2020-10-20 08:04:02,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1422753563, now seen corresponding path program 2 times [2020-10-20 08:04:02,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494409800] [2020-10-20 08:04:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:04:02,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494409800] [2020-10-20 08:04:02,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:02,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173950091] [2020-10-20 08:04:02,191 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:04:02,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:04:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:04:02,192 INFO L87 Difference]: Start difference. First operand 2106 states and 3598 transitions. cyclomatic complexity: 1508 Second operand 4 states. [2020-10-20 08:04:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:02,285 INFO L93 Difference]: Finished difference Result 1864 states and 3088 transitions. [2020-10-20 08:04:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:04:02,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1864 states and 3088 transitions. [2020-10-20 08:04:02,299 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1019 [2020-10-20 08:04:02,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1864 states to 1864 states and 3088 transitions. [2020-10-20 08:04:02,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1105 [2020-10-20 08:04:02,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1105 [2020-10-20 08:04:02,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1864 states and 3088 transitions. [2020-10-20 08:04:02,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:02,314 INFO L691 BuchiCegarLoop]: Abstraction has 1864 states and 3088 transitions. [2020-10-20 08:04:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states and 3088 transitions. [2020-10-20 08:04:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1751. [2020-10-20 08:04:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2020-10-20 08:04:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2918 transitions. [2020-10-20 08:04:02,345 INFO L714 BuchiCegarLoop]: Abstraction has 1751 states and 2918 transitions. [2020-10-20 08:04:02,345 INFO L594 BuchiCegarLoop]: Abstraction has 1751 states and 2918 transitions. [2020-10-20 08:04:02,345 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:04:02,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1751 states and 2918 transitions. [2020-10-20 08:04:02,353 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 978 [2020-10-20 08:04:02,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:02,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:02,354 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,354 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,354 INFO L794 eck$LassoCheckResult]: Stem: 14108#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 13924#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 13925#L396 assume !(1 == ~c_req_up~0); 14025#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 14141#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 14142#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 13955#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 13956#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 14004#L427-1 assume !(0 == ~e_f~0); 14083#L432-1 assume !(0 == ~e_g~0); 14163#L437-1 assume !(0 == ~e_e~0); 13892#L442-1 assume !(0 == ~e_c~0); 13893#L447-1 assume !(0 == ~e_wl~0); 13965#L452-1 assume !(1 == ~wl_pc~0); 13946#L464 assume !(2 == ~wl_pc~0); 13947#L465 assume !(1 == ~c1_pc~0); 13943#L475 assume !(1 == ~c2_pc~0); 13945#L484 assume !(1 == ~wb_pc~0); 14080#L493 assume !(1 == ~e_c~0); 14000#L502-1 assume !(1 == ~e_e~0); 14001#L507-1 assume 1 == ~e_f~0;~e_f~0 := 2; 14438#L512-1 assume !(1 == ~e_g~0); 14127#L517-1 assume !(1 == ~e_c~0); 14128#L522-1 assume !(1 == ~e_wl~0); 14712#L664-1 assume !false; 14713#L534 [2020-10-20 08:04:02,355 INFO L796 eck$LassoCheckResult]: Loop: 14713#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 15591#L369 assume !false; 15590#L287 assume 0 == ~wl_st~0; 15589#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 15587#L313 assume 0 != eval_~tmp~0;~wl_st~0 := 1;havoc write_loop_~t~0;havoc write_loop_~t~0; 15586#L58 assume !(0 == ~wl_pc~0); 15585#L61 assume !(2 == ~wl_pc~0); 14041#L64 assume 1 == ~wl_pc~0; 13986#L16 assume !false; 14129#L80 write_loop_~t~0 := ~d~0;~data~0 := ~d~0;~processed~0 := 0;~e_f~0 := 1; 14150#L85 assume !(1 == ~c1_pc~0); 14055#L85-1 assume !(1 == ~c2_pc~0); 14026#L94 ~e_f~0 := 2;~wl_st~0 := 2;~wl_pc~0 := 2;~t_b~0 := write_loop_~t~0; 14027#L309 assume !(0 == ~c1_st~0); 15514#L324 assume !(0 == ~c2_st~0); 15474#L339 assume !(0 == ~wb_st~0); 15472#L354 assume !(0 == ~r_st~0); 15456#L369 assume !false; 15457#L287 assume !(0 == ~wl_st~0); 14159#L291 assume !(0 == ~c1_st~0); 14130#L294 assume !(0 == ~c2_st~0); 14131#L297 assume !(0 == ~wb_st~0); 14111#L300 assume !(0 == ~r_st~0); 14113#L385 start_simulation_~kernel_st~0 := 2; 14058#L540 assume !(1 == ~c_req_up~0); 13941#L540-2 start_simulation_~kernel_st~0 := 3; 15493#L552 assume 0 == ~e_f~0;~e_f~0 := 1; 15492#L552-2 assume 0 == ~e_g~0;~e_g~0 := 1; 15491#L557-1 assume 0 == ~e_e~0;~e_e~0 := 1; 14061#L562-1 assume !(0 == ~e_c~0); 14062#L567-1 assume !(0 == ~e_wl~0); 14151#L572-1 assume !(1 == ~wl_pc~0); 14091#L584 assume 2 == ~wl_pc~0; 14143#L586 assume 1 == ~e_e~0;~wl_st~0 := 0; 14144#L585 assume !(1 == ~c1_pc~0); 15486#L595 assume !(1 == ~c2_pc~0); 15482#L604 assume !(1 == ~wb_pc~0); 15477#L613 assume !(1 == ~e_c~0); 15478#L622-1 assume 1 == ~e_e~0;~e_e~0 := 2; 15635#L627-1 assume 1 == ~e_f~0;~e_f~0 := 2; 15634#L632-1 assume 1 == ~e_g~0;~e_g~0 := 2; 15633#L637-1 assume !(1 == ~e_c~0); 15632#L642-1 assume !(1 == ~e_wl~0); 15631#L647-1 assume 0 == ~wl_st~0; 15630#L664-1 assume !false; 14713#L534 [2020-10-20 08:04:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2020-10-20 08:04:02,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855779862] [2020-10-20 08:04:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855779862] [2020-10-20 08:04:02,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:04:02,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40690575] [2020-10-20 08:04:02,392 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1070317994, now seen corresponding path program 1 times [2020-10-20 08:04:02,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783312757] [2020-10-20 08:04:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783312757] [2020-10-20 08:04:02,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:04:02,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677274849] [2020-10-20 08:04:02,442 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:04:02,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:02,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:04:02,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:04:02,443 INFO L87 Difference]: Start difference. First operand 1751 states and 2918 transitions. cyclomatic complexity: 1176 Second operand 4 states. [2020-10-20 08:04:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:02,561 INFO L93 Difference]: Finished difference Result 2009 states and 3284 transitions. [2020-10-20 08:04:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:04:02,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2009 states and 3284 transitions. [2020-10-20 08:04:02,765 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1129 [2020-10-20 08:04:02,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2009 states to 2009 states and 3284 transitions. [2020-10-20 08:04:02,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1205 [2020-10-20 08:04:02,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1205 [2020-10-20 08:04:02,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2009 states and 3284 transitions. [2020-10-20 08:04:02,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:02,781 INFO L691 BuchiCegarLoop]: Abstraction has 2009 states and 3284 transitions. [2020-10-20 08:04:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states and 3284 transitions. [2020-10-20 08:04:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1977. [2020-10-20 08:04:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2020-10-20 08:04:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 3252 transitions. [2020-10-20 08:04:02,816 INFO L714 BuchiCegarLoop]: Abstraction has 1977 states and 3252 transitions. [2020-10-20 08:04:02,816 INFO L594 BuchiCegarLoop]: Abstraction has 1977 states and 3252 transitions. [2020-10-20 08:04:02,816 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:04:02,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1977 states and 3252 transitions. [2020-10-20 08:04:02,825 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1124 [2020-10-20 08:04:02,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:02,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:02,827 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,827 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,827 INFO L794 eck$LassoCheckResult]: Stem: 17883#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 17696#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 17697#L396 assume !(1 == ~c_req_up~0); 17910#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 17916#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 17935#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 17729#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 17730#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 17779#L427-1 assume !(0 == ~e_f~0); 17859#L432-1 assume !(0 == ~e_g~0); 17932#L437-1 assume !(0 == ~e_e~0); 17664#L442-1 assume !(0 == ~e_c~0); 17665#L447-1 assume !(0 == ~e_wl~0); 17739#L452-1 assume !(1 == ~wl_pc~0); 17943#L464 assume !(2 == ~wl_pc~0); 17892#L465 assume !(1 == ~c1_pc~0); 17891#L475 assume !(1 == ~c2_pc~0); 17899#L484 assume !(1 == ~wb_pc~0); 17724#L493 assume !(1 == ~e_c~0); 17776#L502-1 assume !(1 == ~e_e~0); 17777#L507-1 assume !(1 == ~e_f~0); 17845#L512-1 assume !(1 == ~e_g~0); 17900#L517-1 assume !(1 == ~e_c~0); 17901#L522-1 assume !(1 == ~e_wl~0); 17926#L664-1 assume !false; 18587#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 19232#L369 [2020-10-20 08:04:02,828 INFO L796 eck$LassoCheckResult]: Loop: 19232#L369 assume !false; 19233#L287 assume 0 == ~wl_st~0; 19228#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 19229#L313 assume !(0 != eval_~tmp~0); 19378#L309 assume !(0 == ~c1_st~0); 19376#L324 assume !(0 == ~c2_st~0); 19349#L339 assume !(0 == ~wb_st~0); 19347#L354 assume !(0 == ~r_st~0); 19232#L369 [2020-10-20 08:04:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,828 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2020-10-20 08:04:02,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376275204] [2020-10-20 08:04:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1277920495, now seen corresponding path program 1 times [2020-10-20 08:04:02,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598892107] [2020-10-20 08:04:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,860 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash 358965991, now seen corresponding path program 1 times [2020-10-20 08:04:02,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318520467] [2020-10-20 08:04:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318520467] [2020-10-20 08:04:02,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:02,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940533058] [2020-10-20 08:04:02,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:02,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:02,906 INFO L87 Difference]: Start difference. First operand 1977 states and 3252 transitions. cyclomatic complexity: 1284 Second operand 3 states. [2020-10-20 08:04:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:02,941 INFO L93 Difference]: Finished difference Result 3149 states and 5142 transitions. [2020-10-20 08:04:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:02,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3149 states and 5142 transitions. [2020-10-20 08:04:02,958 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1811 [2020-10-20 08:04:02,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3149 states to 3149 states and 5142 transitions. [2020-10-20 08:04:02,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1878 [2020-10-20 08:04:02,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1878 [2020-10-20 08:04:02,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3149 states and 5142 transitions. [2020-10-20 08:04:02,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:02,982 INFO L691 BuchiCegarLoop]: Abstraction has 3149 states and 5142 transitions. [2020-10-20 08:04:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states and 5142 transitions. [2020-10-20 08:04:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2020-10-20 08:04:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2020-10-20 08:04:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 5142 transitions. [2020-10-20 08:04:03,202 INFO L714 BuchiCegarLoop]: Abstraction has 3149 states and 5142 transitions. [2020-10-20 08:04:03,202 INFO L594 BuchiCegarLoop]: Abstraction has 3149 states and 5142 transitions. [2020-10-20 08:04:03,202 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:04:03,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3149 states and 5142 transitions. [2020-10-20 08:04:03,213 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1811 [2020-10-20 08:04:03,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:03,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:03,214 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:03,214 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:03,214 INFO L794 eck$LassoCheckResult]: Stem: 23023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22826#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 22827#L396 assume !(1 == ~c_req_up~0); 22933#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 23057#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 23058#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23075#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 23084#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 23083#L427-1 assume !(0 == ~e_f~0); 23082#L432-1 assume !(0 == ~e_g~0); 23081#L437-1 assume !(0 == ~e_e~0); 22794#L442-1 assume !(0 == ~e_c~0); 22795#L447-1 assume !(0 == ~e_wl~0); 22869#L452-1 assume !(1 == ~wl_pc~0); 23095#L464 assume !(2 == ~wl_pc~0); 23034#L465 assume !(1 == ~c1_pc~0); 23033#L475 assume !(1 == ~c2_pc~0); 23041#L484 assume !(1 == ~wb_pc~0); 22856#L493 assume !(1 == ~e_c~0); 22905#L502-1 assume !(1 == ~e_e~0); 22906#L507-1 assume !(1 == ~e_f~0); 22978#L512-1 assume !(1 == ~e_g~0); 23042#L517-1 assume !(1 == ~e_c~0); 23043#L522-1 assume !(1 == ~e_wl~0); 23074#L664-1 assume !false; 24163#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 25526#L369 [2020-10-20 08:04:03,215 INFO L796 eck$LassoCheckResult]: Loop: 25526#L369 assume !false; 25525#L287 assume 0 == ~wl_st~0; 25523#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 25522#L313 assume !(0 != eval_~tmp~0); 25521#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 25507#L328 assume !(0 != eval_~tmp___0~0); 25520#L324 assume !(0 == ~c2_st~0); 25533#L339 assume !(0 == ~wb_st~0); 25530#L354 assume !(0 == ~r_st~0); 25526#L369 [2020-10-20 08:04:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2020-10-20 08:04:03,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097714023] [2020-10-20 08:04:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,238 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash 910057440, now seen corresponding path program 1 times [2020-10-20 08:04:03,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462756299] [2020-10-20 08:04:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,250 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1807728408, now seen corresponding path program 1 times [2020-10-20 08:04:03,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251521798] [2020-10-20 08:04:03,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:03,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251521798] [2020-10-20 08:04:03,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:03,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:03,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292288878] [2020-10-20 08:04:03,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:03,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:03,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:03,352 INFO L87 Difference]: Start difference. First operand 3149 states and 5142 transitions. cyclomatic complexity: 2002 Second operand 3 states. [2020-10-20 08:04:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:03,406 INFO L93 Difference]: Finished difference Result 5098 states and 8207 transitions. [2020-10-20 08:04:03,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:03,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5098 states and 8207 transitions. [2020-10-20 08:04:03,443 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-20 08:04:03,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5098 states to 5098 states and 8207 transitions. [2020-10-20 08:04:03,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3040 [2020-10-20 08:04:03,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3040 [2020-10-20 08:04:03,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5098 states and 8207 transitions. [2020-10-20 08:04:03,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:03,483 INFO L691 BuchiCegarLoop]: Abstraction has 5098 states and 8207 transitions. [2020-10-20 08:04:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states and 8207 transitions. [2020-10-20 08:04:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 5098. [2020-10-20 08:04:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5098 states. [2020-10-20 08:04:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5098 states to 5098 states and 8207 transitions. [2020-10-20 08:04:03,630 INFO L714 BuchiCegarLoop]: Abstraction has 5098 states and 8207 transitions. [2020-10-20 08:04:03,630 INFO L594 BuchiCegarLoop]: Abstraction has 5098 states and 8207 transitions. [2020-10-20 08:04:03,630 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:04:03,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5098 states and 8207 transitions. [2020-10-20 08:04:03,646 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-20 08:04:03,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:03,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:03,647 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:03,648 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:03,648 INFO L794 eck$LassoCheckResult]: Stem: 31285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 31083#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 31084#L396 assume !(1 == ~c_req_up~0); 31186#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 31306#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 31307#L412-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 32048#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 32087#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 32086#L427-1 assume !(0 == ~e_f~0); 32085#L432-1 assume !(0 == ~e_g~0); 32084#L437-1 assume !(0 == ~e_e~0); 32083#L442-1 assume !(0 == ~e_c~0); 32082#L447-1 assume !(0 == ~e_wl~0); 32081#L452-1 assume !(1 == ~wl_pc~0); 32078#L464 assume !(2 == ~wl_pc~0); 32077#L465 assume !(1 == ~c1_pc~0); 32075#L475 assume !(1 == ~c2_pc~0); 32073#L484 assume !(1 == ~wb_pc~0); 32071#L493 assume !(1 == ~e_c~0); 32070#L502-1 assume !(1 == ~e_e~0); 32069#L507-1 assume !(1 == ~e_f~0); 32068#L512-1 assume !(1 == ~e_g~0); 32067#L517-1 assume !(1 == ~e_c~0); 32066#L522-1 assume !(1 == ~e_wl~0); 32064#L664-1 assume !false; 32065#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 35333#L369 [2020-10-20 08:04:03,648 INFO L796 eck$LassoCheckResult]: Loop: 35333#L369 assume !false; 35331#L287 assume 0 == ~wl_st~0; 35330#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 35328#L313 assume !(0 != eval_~tmp~0); 35329#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 35453#L328 assume !(0 != eval_~tmp___0~0); 35449#L324 assume !(0 == ~c2_st~0); 35343#L339 assume !(0 == ~wb_st~0); 35338#L354 assume !(0 == ~r_st~0); 35333#L369 [2020-10-20 08:04:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2020-10-20 08:04:03,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266876840] [2020-10-20 08:04:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:03,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266876840] [2020-10-20 08:04:03,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:03,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:03,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763003481] [2020-10-20 08:04:03,672 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,672 INFO L82 PathProgramCache]: Analyzing trace with hash 910057440, now seen corresponding path program 2 times [2020-10-20 08:04:03,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147938789] [2020-10-20 08:04:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,679 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:03,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:03,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:03,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:03,710 INFO L87 Difference]: Start difference. First operand 5098 states and 8207 transitions. cyclomatic complexity: 3118 Second operand 3 states. [2020-10-20 08:04:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:03,733 INFO L93 Difference]: Finished difference Result 5048 states and 8126 transitions. [2020-10-20 08:04:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:03,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5048 states and 8126 transitions. [2020-10-20 08:04:03,756 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-20 08:04:03,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5048 states to 5048 states and 8126 transitions. [2020-10-20 08:04:03,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2991 [2020-10-20 08:04:03,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2991 [2020-10-20 08:04:03,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5048 states and 8126 transitions. [2020-10-20 08:04:03,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:03,807 INFO L691 BuchiCegarLoop]: Abstraction has 5048 states and 8126 transitions. [2020-10-20 08:04:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states and 8126 transitions. [2020-10-20 08:04:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 5048. [2020-10-20 08:04:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5048 states. [2020-10-20 08:04:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 8126 transitions. [2020-10-20 08:04:04,116 INFO L714 BuchiCegarLoop]: Abstraction has 5048 states and 8126 transitions. [2020-10-20 08:04:04,116 INFO L594 BuchiCegarLoop]: Abstraction has 5048 states and 8126 transitions. [2020-10-20 08:04:04,116 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:04:04,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5048 states and 8126 transitions. [2020-10-20 08:04:04,134 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2918 [2020-10-20 08:04:04,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:04,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:04,135 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,135 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,135 INFO L794 eck$LassoCheckResult]: Stem: 41442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 41235#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 41236#L396 assume !(1 == ~c_req_up~0); 41471#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41480#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41506#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 41274#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41275#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41321#L427-1 assume !(0 == ~e_f~0); 41409#L432-1 assume !(0 == ~e_g~0); 41503#L437-1 assume !(0 == ~e_e~0); 41205#L442-1 assume !(0 == ~e_c~0); 41206#L447-1 assume !(0 == ~e_wl~0); 41284#L452-1 assume !(1 == ~wl_pc~0); 41514#L464 assume !(2 == ~wl_pc~0); 41454#L465 assume !(1 == ~c1_pc~0); 41453#L475 assume !(1 == ~c2_pc~0); 41462#L484 assume !(1 == ~wb_pc~0); 41269#L493 assume !(1 == ~e_c~0); 41318#L502-1 assume !(1 == ~e_e~0); 41319#L507-1 assume !(1 == ~e_f~0); 41395#L512-1 assume !(1 == ~e_g~0); 41463#L517-1 assume !(1 == ~e_c~0); 41464#L522-1 assume !(1 == ~e_wl~0); 41498#L664-1 assume !false; 43312#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 45291#L369 [2020-10-20 08:04:04,135 INFO L796 eck$LassoCheckResult]: Loop: 45291#L369 assume !false; 45948#L287 assume 0 == ~wl_st~0; 45947#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 45946#L313 assume !(0 != eval_~tmp~0); 45945#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 45933#L328 assume !(0 != eval_~tmp___0~0); 45307#L324 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 45301#L343 assume !(0 != eval_~tmp___1~0); 45302#L339 assume !(0 == ~wb_st~0); 45952#L354 assume !(0 == ~r_st~0); 45291#L369 [2020-10-20 08:04:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2020-10-20 08:04:04,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231727863] [2020-10-20 08:04:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,166 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1854610406, now seen corresponding path program 1 times [2020-10-20 08:04:04,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198607145] [2020-10-20 08:04:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,172 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,174 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash -206625774, now seen corresponding path program 1 times [2020-10-20 08:04:04,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367281583] [2020-10-20 08:04:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:04,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367281583] [2020-10-20 08:04:04,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:04,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:04,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004292501] [2020-10-20 08:04:04,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:04,245 INFO L87 Difference]: Start difference. First operand 5048 states and 8126 transitions. cyclomatic complexity: 3087 Second operand 3 states. [2020-10-20 08:04:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:04,335 INFO L93 Difference]: Finished difference Result 8741 states and 13910 transitions. [2020-10-20 08:04:04,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:04,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8741 states and 13910 transitions. [2020-10-20 08:04:04,380 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5065 [2020-10-20 08:04:04,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8741 states to 8741 states and 13910 transitions. [2020-10-20 08:04:04,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5150 [2020-10-20 08:04:04,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5150 [2020-10-20 08:04:04,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8741 states and 13910 transitions. [2020-10-20 08:04:04,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:04,427 INFO L691 BuchiCegarLoop]: Abstraction has 8741 states and 13910 transitions. [2020-10-20 08:04:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8741 states and 13910 transitions. [2020-10-20 08:04:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8741 to 8741. [2020-10-20 08:04:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2020-10-20 08:04:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 13910 transitions. [2020-10-20 08:04:04,870 INFO L714 BuchiCegarLoop]: Abstraction has 8741 states and 13910 transitions. [2020-10-20 08:04:04,870 INFO L594 BuchiCegarLoop]: Abstraction has 8741 states and 13910 transitions. [2020-10-20 08:04:04,870 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:04:04,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8741 states and 13910 transitions. [2020-10-20 08:04:04,902 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5065 [2020-10-20 08:04:04,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:04,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:04,903 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,904 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,904 INFO L794 eck$LassoCheckResult]: Stem: 55243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 55037#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 55038#L396 assume !(1 == ~c_req_up~0); 55275#L396-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 55281#L407-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 55304#L412-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 55069#L417-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 55070#L422-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 55117#L427-1 assume !(0 == ~e_f~0); 55202#L432-1 assume !(0 == ~e_g~0); 55301#L437-1 assume !(0 == ~e_e~0); 55002#L442-1 assume !(0 == ~e_c~0); 55003#L447-1 assume !(0 == ~e_wl~0); 55079#L452-1 assume !(1 == ~wl_pc~0); 55312#L464 assume !(2 == ~wl_pc~0); 55255#L465 assume !(1 == ~c1_pc~0); 55254#L475 assume !(1 == ~c2_pc~0); 55264#L484 assume !(1 == ~wb_pc~0); 55064#L493 assume !(1 == ~e_c~0); 55114#L502-1 assume !(1 == ~e_e~0); 55115#L507-1 assume !(1 == ~e_f~0); 55186#L512-1 assume !(1 == ~e_g~0); 55265#L517-1 assume !(1 == ~e_c~0); 55266#L522-1 assume !(1 == ~e_wl~0); 55294#L664-1 assume !false; 57270#L534 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 62178#L369 [2020-10-20 08:04:04,904 INFO L796 eck$LassoCheckResult]: Loop: 62178#L369 assume !false; 62175#L287 assume 0 == ~wl_st~0; 62174#L300-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 62172#L313 assume !(0 != eval_~tmp~0); 62173#L309 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 63541#L328 assume !(0 != eval_~tmp___0~0); 62538#L324 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 62535#L343 assume !(0 != eval_~tmp___1~0); 62534#L339 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 62523#L358 assume !(0 != eval_~tmp___2~0); 62182#L354 assume !(0 == ~r_st~0); 62178#L369 [2020-10-20 08:04:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2020-10-20 08:04:04,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461109768] [2020-10-20 08:04:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,925 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1658382155, now seen corresponding path program 1 times [2020-10-20 08:04:04,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305367628] [2020-10-20 08:04:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,933 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2110466115, now seen corresponding path program 1 times [2020-10-20 08:04:04,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382640716] [2020-10-20 08:04:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:05,874 WARN L193 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 157 [2020-10-20 08:04:06,100 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-20 08:04:06,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:04:06 BoogieIcfgContainer [2020-10-20 08:04:06,154 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:04:06,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:04:06,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:04:06,155 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:04:06,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:56" (3/4) ... [2020-10-20 08:04:06,159 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:04:06,224 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:04:06,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:04:06,226 INFO L168 Benchmark]: Toolchain (without parser) took 11214.15 ms. Allocated memory was 35.7 MB in the beginning and 177.2 MB in the end (delta: 141.6 MB). Free memory was 8.6 MB in the beginning and 97.9 MB in the end (delta: -89.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,226 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 35.7 MB. Free memory was 14.3 MB in the beginning and 14.3 MB in the end (delta: 47.2 kB). Peak memory consumption was 47.2 kB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.54 ms. Allocated memory was 35.7 MB in the beginning and 44.6 MB in the end (delta: 8.9 MB). Free memory was 7.7 MB in the beginning and 22.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.65 ms. Allocated memory is still 44.6 MB. Free memory was 22.9 MB in the beginning and 20.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,228 INFO L168 Benchmark]: Boogie Preprocessor took 64.44 ms. Allocated memory is still 44.6 MB. Free memory was 20.4 MB in the beginning and 18.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,228 INFO L168 Benchmark]: RCFGBuilder took 739.95 ms. Allocated memory was 44.6 MB in the beginning and 48.8 MB in the end (delta: 4.2 MB). Free memory was 18.0 MB in the beginning and 30.6 MB in the end (delta: -12.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,229 INFO L168 Benchmark]: BuchiAutomizer took 9777.80 ms. Allocated memory was 48.8 MB in the beginning and 177.2 MB in the end (delta: 128.5 MB). Free memory was 30.2 MB in the beginning and 101.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 112.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,229 INFO L168 Benchmark]: Witness Printer took 69.39 ms. Allocated memory is still 177.2 MB. Free memory was 101.9 MB in the beginning and 97.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:06,232 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 35.7 MB. Free memory was 14.3 MB in the beginning and 14.3 MB in the end (delta: 47.2 kB). Peak memory consumption was 47.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 498.54 ms. Allocated memory was 35.7 MB in the beginning and 44.6 MB in the end (delta: 8.9 MB). Free memory was 7.7 MB in the beginning and 22.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 54.65 ms. Allocated memory is still 44.6 MB. Free memory was 22.9 MB in the beginning and 20.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 64.44 ms. Allocated memory is still 44.6 MB. Free memory was 20.4 MB in the beginning and 18.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 739.95 ms. Allocated memory was 44.6 MB in the beginning and 48.8 MB in the end (delta: 4.2 MB). Free memory was 18.0 MB in the beginning and 30.6 MB in the end (delta: -12.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 9777.80 ms. Allocated memory was 48.8 MB in the beginning and 177.2 MB in the end (delta: 128.5 MB). Free memory was 30.2 MB in the beginning and 101.9 MB in the end (delta: -71.6 MB). Peak memory consumption was 112.1 MB. Max. memory is 14.3 GB. * Witness Printer took 69.39 ms. Allocated memory is still 177.2 MB. Free memory was 101.9 MB in the beginning and 97.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (14 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -2 * wl_pc + 1 and consists of 4 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8741 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 11. Automata minimization 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 466 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 8741 states and ocurred in iteration 14. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 4187 SDtfs, 3711 SDslu, 2257 SDs, 0 SdLazy, 384 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT1 SILN1 SILU0 SILI7 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf94 smp100 dnf150 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 286]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8785} State at position 1 is {wb_st=0, NULL=0, NULL=8785, c2_st=0, tmp=0, e_c=2, e_e=2, e_p_in=0, kernel_st=1, t_b=0, tmp___2=0, wb_pc=0, tmp___0=0, wb_i=1, c_t=0, NULL=0, NULL=0, c=0, wl_st=0, c2_pc=0, r_i=0, e_f=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dcdb37c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dbc66d0=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=8786, processed=0, \result=0, wl_pc=0, e_wl=2, tmp___1=0, data=0, p_in=0, tmp___3=0, c_req_up=0, NULL=8787, wl_i=1, NULL=0, c1_st=0, NULL=8788, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cffdb7d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b0dc5fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ea897c=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 286]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 [L396] COND FALSE !((int )c_req_up == 1) [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 [L432] COND FALSE !((int )e_f == 0) [L437] COND FALSE !((int )e_g == 0) [L442] COND FALSE !((int )e_e == 0) [L447] COND FALSE !((int )e_c == 0) [L452] COND FALSE !((int )e_wl == 0) [L457] COND FALSE !((int )wl_pc == 1) [L465] COND FALSE !((int )wl_pc == 2) [L475] COND FALSE !((int )c1_pc == 1) [L484] COND FALSE !((int )c2_pc == 1) [L493] COND FALSE !((int )wb_pc == 1) [L502] COND FALSE !((int )e_c == 1) [L507] COND FALSE !((int )e_e == 1) [L512] COND FALSE !((int )e_f == 1) [L517] COND FALSE !((int )e_g == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_wl == 1) [L533] COND TRUE 1 [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; Loop: [L286] COND TRUE 1 [L288] COND TRUE (int )wl_st == 0 [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND FALSE !(\read(tmp)) [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND FALSE !(\read(tmp___0)) [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND FALSE !(\read(tmp___1)) [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND FALSE !(\read(tmp___2)) [L369] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...