./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.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/toy.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 1ba07ae5f9ba9742e473cf2ed151649cad165d7c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:48,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:03:48,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:03:48,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:03:48,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:03:48,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:03:48,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:03:48,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:03:48,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:03:48,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:03:48,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:03:48,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:03:48,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:03:48,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:03:48,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:03:48,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:03:48,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:03:48,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:03:48,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:03:48,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:03:48,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:03:48,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:03:48,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:03:48,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:03:48,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:03:48,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:03:48,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:03:48,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:03:48,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:03:48,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:03:48,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:03:48,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:03:48,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:03:48,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:03:48,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:03:48,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:03:48,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:03:48,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:03:48,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:03:48,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:03:48,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:03:48,840 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:48,876 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:03:48,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:03:48,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:03:48,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:03:48,880 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:03:48,880 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:03:48,886 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:03:48,886 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:03:48,887 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:03:48,887 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:03:48,888 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:03:48,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:03:48,889 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:03:48,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:03:48,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:03:48,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:03:48,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:03:48,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:03:48,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:03:48,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:03:48,892 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:03:48,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:03:48,892 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:03:48,892 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:03:48,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:03:48,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:03:48,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:03:48,894 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:03:48,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:03:48,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:03:48,894 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:03:48,894 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:03:48,896 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:03:48,896 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 -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2020-10-20 08:03:49,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:03:49,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:03:49,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:03:49,137 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:03:49,138 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:03:49,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2020-10-20 08:03:49,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20933c0a6/38e9c94f46cb43d8a548cd562c9ab750/FLAG0a3ee80e6 [2020-10-20 08:03:49,704 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:03:49,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2020-10-20 08:03:49,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20933c0a6/38e9c94f46cb43d8a548cd562c9ab750/FLAG0a3ee80e6 [2020-10-20 08:03:50,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20933c0a6/38e9c94f46cb43d8a548cd562c9ab750 [2020-10-20 08:03:50,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:03:50,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:03:50,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:03:50,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:03:50,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:03:50,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:03:50" (1/1) ... [2020-10-20 08:03:50,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5eabbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:50, skipping insertion in model container [2020-10-20 08:03:50,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:03:50" (1/1) ... [2020-10-20 08:03:50,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:03:50,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:03:50,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:03:50,491 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:03:50,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:03:50,562 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:03:50,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:50 WrapperNode [2020-10-20 08:03:50,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:03:50,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:03:50,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:03:50,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:03:50,573 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:50" (1/1) ... [2020-10-20 08:03:50,585 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:50" (1/1) ... [2020-10-20 08:03:50,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:03:50,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:03:50,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:03:50,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:03:50,636 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:50" (1/1) ... [2020-10-20 08:03:50,637 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:50" (1/1) ... [2020-10-20 08:03:50,640 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:50" (1/1) ... [2020-10-20 08:03:50,640 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:50" (1/1) ... [2020-10-20 08:03:50,647 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:50" (1/1) ... [2020-10-20 08:03:50,656 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:50" (1/1) ... [2020-10-20 08:03:50,660 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:50" (1/1) ... [2020-10-20 08:03:50,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:03:50,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:03:50,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:03:50,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:03:50,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:50" (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:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:03:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:03:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:03:50,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:03:51,363 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:03:51,364 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-10-20 08:03:51,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:51 BoogieIcfgContainer [2020-10-20 08:03:51,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:03:51,367 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:03:51,367 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:03:51,373 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:03:51,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:51,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:03:50" (1/3) ... [2020-10-20 08:03:51,376 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5313dc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:03:51, skipping insertion in model container [2020-10-20 08:03:51,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:51,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:50" (2/3) ... [2020-10-20 08:03:51,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5313dc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:03:51, skipping insertion in model container [2020-10-20 08:03:51,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:51,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:51" (3/3) ... [2020-10-20 08:03:51,381 INFO L373 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2020-10-20 08:03:51,439 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:03:51,440 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:03:51,441 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:03:51,441 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:03:51,441 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:03:51,442 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:03:51,442 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:03:51,442 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:03:51,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states. [2020-10-20 08:03:51,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2020-10-20 08:03:51,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:51,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:51,549 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:51,550 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:51,550 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:03:51,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states. [2020-10-20 08:03:51,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2020-10-20 08:03:51,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:51,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:51,574 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:51,575 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:51,589 INFO L794 eck$LassoCheckResult]: Stem: 97#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(10);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; 12#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; 51#L400true assume !(1 == ~c_req_up~0); 36#L400-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 53#L411-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 73#L416-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 84#L421-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 108#L426-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 4#L431-1true assume !(0 == ~e_f~0); 26#L436-1true assume !(0 == ~e_g~0); 54#L441-1true assume !(0 == ~e_e~0); 75#L446-1true assume !(0 == ~e_c~0); 103#L451-1true assume !(0 == ~e_wl~0); 121#L456-1true assume !(1 == ~wl_pc~0); 74#L468true assume !(2 == ~wl_pc~0); 43#L469true assume !(1 == ~c1_pc~0); 93#L479true assume !(1 == ~c2_pc~0); 45#L488true assume !(1 == ~wb_pc~0); 14#L497true assume !(1 == ~e_c~0); 100#L506-1true assume !(1 == ~e_e~0); 118#L511-1true assume !(1 == ~e_f~0); 17#L516-1true assume !(1 == ~e_g~0); 46#L521-1true assume !(1 == ~e_c~0); 70#L526-1true assume !(1 == ~e_wl~0); 125#L668-1true [2020-10-20 08:03:51,593 INFO L796 eck$LassoCheckResult]: Loop: 125#L668-1true assume !false; 32#L538true 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; 21#L373true assume !true; 52#L389true start_simulation_~kernel_st~0 := 2; 9#L544true assume !(1 == ~c_req_up~0); 119#L544-2true start_simulation_~kernel_st~0 := 3; 89#L556true assume 0 == ~e_f~0;~e_f~0 := 1; 92#L556-2true assume 0 == ~e_g~0;~e_g~0 := 1; 111#L561-1true assume 0 == ~e_e~0;~e_e~0 := 1; 11#L566-1true assume 0 == ~e_c~0;~e_c~0 := 1; 33#L571-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 60#L576-1true assume !(1 == ~wl_pc~0); 8#L588true assume !(2 == ~wl_pc~0); 88#L589true assume !(1 == ~c1_pc~0); 6#L599true assume !(1 == ~c2_pc~0); 105#L608true assume !(1 == ~wb_pc~0); 62#L617true assume !(1 == ~e_c~0); 28#L626-1true assume 1 == ~e_e~0;~e_e~0 := 2; 58#L631-1true assume 1 == ~e_f~0;~e_f~0 := 2; 81#L636-1true assume 1 == ~e_g~0;~e_g~0 := 2; 106#L641-1true assume 1 == ~e_c~0;~e_c~0 := 2; 127#L646-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 24#L651-1true assume 0 == ~wl_st~0; 125#L668-1true [2020-10-20 08:03:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2020-10-20 08:03:51,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:51,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228003359] [2020-10-20 08:03:51,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:51,829 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:51,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228003359] [2020-10-20 08:03:51,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:51,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:51,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036746797] [2020-10-20 08:03:51,840 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1424502649, now seen corresponding path program 1 times [2020-10-20 08:03:51,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:51,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266874709] [2020-10-20 08:03:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:51,872 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:51,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266874709] [2020-10-20 08:03:51,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:51,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:51,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69094435] [2020-10-20 08:03:51,875 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:51,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:51,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:03:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:03:51,901 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2020-10-20 08:03:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:51,920 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2020-10-20 08:03:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:03:51,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 219 transitions. [2020-10-20 08:03:51,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:51,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 214 transitions. [2020-10-20 08:03:51,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2020-10-20 08:03:51,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2020-10-20 08:03:51,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 214 transitions. [2020-10-20 08:03:51,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:51,941 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2020-10-20 08:03:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 214 transitions. [2020-10-20 08:03:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-10-20 08:03:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-20 08:03:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 214 transitions. [2020-10-20 08:03:51,991 INFO L714 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2020-10-20 08:03:51,991 INFO L594 BuchiCegarLoop]: Abstraction has 120 states and 214 transitions. [2020-10-20 08:03:51,992 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:03:51,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 214 transitions. [2020-10-20 08:03:51,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:51,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:51,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:51,996 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:51,996 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:51,996 INFO L794 eck$LassoCheckResult]: Stem: 372#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(10);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; 284#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; 285#L400 assume !(1 == ~c_req_up~0); 320#L400-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 321#L411-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 340#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 355#L421-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 364#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 263#L431-1 assume !(0 == ~e_f~0); 264#L436-1 assume !(0 == ~e_g~0); 307#L441-1 assume !(0 == ~e_e~0); 341#L446-1 assume !(0 == ~e_c~0); 358#L451-1 assume !(0 == ~e_wl~0); 375#L456-1 assume !(1 == ~wl_pc~0); 356#L468 assume !(2 == ~wl_pc~0); 330#L469 assume !(1 == ~c1_pc~0); 329#L479 assume !(1 == ~c2_pc~0); 331#L488 assume !(1 == ~wb_pc~0); 288#L497 assume !(1 == ~e_c~0); 289#L506-1 assume !(1 == ~e_e~0); 373#L511-1 assume !(1 == ~e_f~0); 290#L516-1 assume !(1 == ~e_g~0); 291#L521-1 assume !(1 == ~e_c~0); 333#L526-1 assume !(1 == ~e_wl~0); 261#L668-1 [2020-10-20 08:03:51,997 INFO L796 eck$LassoCheckResult]: Loop: 261#L668-1 assume !false; 316#L538 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; 298#L373 assume !false; 299#L291 assume !(0 == ~wl_st~0); 342#L295 assume !(0 == ~c1_st~0); 343#L298 assume !(0 == ~c2_st~0); 338#L301 assume !(0 == ~wb_st~0); 311#L304 assume !(0 == ~r_st~0); 313#L389 start_simulation_~kernel_st~0 := 2; 277#L544 assume !(1 == ~c_req_up~0); 278#L544-2 start_simulation_~kernel_st~0 := 3; 367#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 368#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 370#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 282#L566-1 assume 0 == ~e_c~0;~e_c~0 := 1; 283#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 317#L576-1 assume !(1 == ~wl_pc~0); 274#L588 assume !(2 == ~wl_pc~0); 275#L589 assume !(1 == ~c1_pc~0); 268#L599 assume !(1 == ~c2_pc~0); 270#L608 assume !(1 == ~wb_pc~0); 302#L617 assume !(1 == ~e_c~0); 308#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 309#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 346#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 363#L641-1 assume 1 == ~e_c~0;~e_c~0 := 2; 376#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 303#L651-1 assume 0 == ~wl_st~0; 261#L668-1 [2020-10-20 08:03:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2020-10-20 08:03:51,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:51,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951214908] [2020-10-20 08:03:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,092 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:52,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951214908] [2020-10-20 08:03:52,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49345826] [2020-10-20 08:03:52,095 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1624185410, now seen corresponding path program 1 times [2020-10-20 08:03:52,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136297478] [2020-10-20 08:03:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,165 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:52,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136297478] [2020-10-20 08:03:52,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747052593] [2020-10-20 08:03:52,166 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:52,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:52,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:52,169 INFO L87 Difference]: Start difference. First operand 120 states and 214 transitions. cyclomatic complexity: 95 Second operand 3 states. [2020-10-20 08:03:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:52,209 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2020-10-20 08:03:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:52,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 213 transitions. [2020-10-20 08:03:52,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:52,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 213 transitions. [2020-10-20 08:03:52,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2020-10-20 08:03:52,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2020-10-20 08:03:52,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 213 transitions. [2020-10-20 08:03:52,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:52,221 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2020-10-20 08:03:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 213 transitions. [2020-10-20 08:03:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-10-20 08:03:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-20 08:03:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 213 transitions. [2020-10-20 08:03:52,234 INFO L714 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2020-10-20 08:03:52,234 INFO L594 BuchiCegarLoop]: Abstraction has 120 states and 213 transitions. [2020-10-20 08:03:52,235 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:03:52,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 213 transitions. [2020-10-20 08:03:52,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:52,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:52,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:52,242 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:52,242 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:52,243 INFO L794 eck$LassoCheckResult]: Stem: 619#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(10);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; 531#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; 532#L400 assume !(1 == ~c_req_up~0); 567#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 568#L411-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 587#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 602#L421-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 611#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 510#L431-1 assume !(0 == ~e_f~0); 511#L436-1 assume !(0 == ~e_g~0); 554#L441-1 assume !(0 == ~e_e~0); 588#L446-1 assume !(0 == ~e_c~0); 605#L451-1 assume !(0 == ~e_wl~0); 622#L456-1 assume !(1 == ~wl_pc~0); 603#L468 assume !(2 == ~wl_pc~0); 577#L469 assume !(1 == ~c1_pc~0); 576#L479 assume !(1 == ~c2_pc~0); 578#L488 assume !(1 == ~wb_pc~0); 535#L497 assume !(1 == ~e_c~0); 536#L506-1 assume !(1 == ~e_e~0); 620#L511-1 assume !(1 == ~e_f~0); 537#L516-1 assume !(1 == ~e_g~0); 538#L521-1 assume !(1 == ~e_c~0); 580#L526-1 assume !(1 == ~e_wl~0); 508#L668-1 [2020-10-20 08:03:52,243 INFO L796 eck$LassoCheckResult]: Loop: 508#L668-1 assume !false; 563#L538 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; 545#L373 assume !false; 546#L291 assume !(0 == ~wl_st~0); 589#L295 assume !(0 == ~c1_st~0); 590#L298 assume !(0 == ~c2_st~0); 585#L301 assume !(0 == ~wb_st~0); 558#L304 assume !(0 == ~r_st~0); 560#L389 start_simulation_~kernel_st~0 := 2; 524#L544 assume !(1 == ~c_req_up~0); 525#L544-2 start_simulation_~kernel_st~0 := 3; 614#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 615#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 617#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 529#L566-1 assume 0 == ~e_c~0;~e_c~0 := 1; 530#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 564#L576-1 assume !(1 == ~wl_pc~0); 521#L588 assume !(2 == ~wl_pc~0); 522#L589 assume !(1 == ~c1_pc~0); 515#L599 assume !(1 == ~c2_pc~0); 517#L608 assume !(1 == ~wb_pc~0); 549#L617 assume !(1 == ~e_c~0); 555#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 556#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 593#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 610#L641-1 assume 1 == ~e_c~0;~e_c~0 := 2; 623#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 550#L651-1 assume 0 == ~wl_st~0; 508#L668-1 [2020-10-20 08:03:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2020-10-20 08:03:52,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081931233] [2020-10-20 08:03:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,325 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:52,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081931233] [2020-10-20 08:03:52,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911972955] [2020-10-20 08:03:52,327 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1624185410, now seen corresponding path program 2 times [2020-10-20 08:03:52,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499525366] [2020-10-20 08:03:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,384 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:52,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499525366] [2020-10-20 08:03:52,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187713313] [2020-10-20 08:03:52,385 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:52,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:52,386 INFO L87 Difference]: Start difference. First operand 120 states and 213 transitions. cyclomatic complexity: 94 Second operand 3 states. [2020-10-20 08:03:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:52,399 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2020-10-20 08:03:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:52,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 212 transitions. [2020-10-20 08:03:52,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:52,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 212 transitions. [2020-10-20 08:03:52,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2020-10-20 08:03:52,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2020-10-20 08:03:52,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 212 transitions. [2020-10-20 08:03:52,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:52,405 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2020-10-20 08:03:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 212 transitions. [2020-10-20 08:03:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-10-20 08:03:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-20 08:03:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 212 transitions. [2020-10-20 08:03:52,412 INFO L714 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2020-10-20 08:03:52,412 INFO L594 BuchiCegarLoop]: Abstraction has 120 states and 212 transitions. [2020-10-20 08:03:52,412 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:03:52,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 212 transitions. [2020-10-20 08:03:52,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:52,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:52,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:52,415 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:52,415 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:52,415 INFO L794 eck$LassoCheckResult]: Stem: 866#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(10);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; 778#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; 779#L400 assume !(1 == ~c_req_up~0); 814#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 815#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 834#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 849#L421-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 858#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 757#L431-1 assume !(0 == ~e_f~0); 758#L436-1 assume !(0 == ~e_g~0); 801#L441-1 assume !(0 == ~e_e~0); 835#L446-1 assume !(0 == ~e_c~0); 852#L451-1 assume !(0 == ~e_wl~0); 869#L456-1 assume !(1 == ~wl_pc~0); 850#L468 assume !(2 == ~wl_pc~0); 824#L469 assume !(1 == ~c1_pc~0); 823#L479 assume !(1 == ~c2_pc~0); 825#L488 assume !(1 == ~wb_pc~0); 782#L497 assume !(1 == ~e_c~0); 783#L506-1 assume !(1 == ~e_e~0); 867#L511-1 assume !(1 == ~e_f~0); 784#L516-1 assume !(1 == ~e_g~0); 785#L521-1 assume !(1 == ~e_c~0); 827#L526-1 assume !(1 == ~e_wl~0); 755#L668-1 [2020-10-20 08:03:52,415 INFO L796 eck$LassoCheckResult]: Loop: 755#L668-1 assume !false; 810#L538 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; 792#L373 assume !false; 793#L291 assume !(0 == ~wl_st~0); 836#L295 assume !(0 == ~c1_st~0); 837#L298 assume !(0 == ~c2_st~0); 832#L301 assume !(0 == ~wb_st~0); 805#L304 assume !(0 == ~r_st~0); 807#L389 start_simulation_~kernel_st~0 := 2; 771#L544 assume !(1 == ~c_req_up~0); 772#L544-2 start_simulation_~kernel_st~0 := 3; 861#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 862#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 864#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 776#L566-1 assume 0 == ~e_c~0;~e_c~0 := 1; 777#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 811#L576-1 assume !(1 == ~wl_pc~0); 768#L588 assume !(2 == ~wl_pc~0); 769#L589 assume !(1 == ~c1_pc~0); 762#L599 assume !(1 == ~c2_pc~0); 764#L608 assume !(1 == ~wb_pc~0); 796#L617 assume !(1 == ~e_c~0); 802#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 803#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 840#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 857#L641-1 assume 1 == ~e_c~0;~e_c~0 := 2; 870#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 797#L651-1 assume 0 == ~wl_st~0; 755#L668-1 [2020-10-20 08:03:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2020-10-20 08:03:52,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349927876] [2020-10-20 08:03:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,445 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:52,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349927876] [2020-10-20 08:03:52,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112927615] [2020-10-20 08:03:52,446 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1624185410, now seen corresponding path program 3 times [2020-10-20 08:03:52,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280763527] [2020-10-20 08:03:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,466 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:52,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280763527] [2020-10-20 08:03:52,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269411588] [2020-10-20 08:03:52,468 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:52,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:52,469 INFO L87 Difference]: Start difference. First operand 120 states and 212 transitions. cyclomatic complexity: 93 Second operand 3 states. [2020-10-20 08:03:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:52,480 INFO L93 Difference]: Finished difference Result 120 states and 211 transitions. [2020-10-20 08:03:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:52,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 211 transitions. [2020-10-20 08:03:52,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:52,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 211 transitions. [2020-10-20 08:03:52,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2020-10-20 08:03:52,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2020-10-20 08:03:52,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 211 transitions. [2020-10-20 08:03:52,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:52,486 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2020-10-20 08:03:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 211 transitions. [2020-10-20 08:03:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-10-20 08:03:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-20 08:03:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 211 transitions. [2020-10-20 08:03:52,501 INFO L714 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2020-10-20 08:03:52,501 INFO L594 BuchiCegarLoop]: Abstraction has 120 states and 211 transitions. [2020-10-20 08:03:52,501 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:03:52,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 211 transitions. [2020-10-20 08:03:52,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2020-10-20 08:03:52,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:52,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:52,504 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:52,506 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:52,518 INFO L794 eck$LassoCheckResult]: Stem: 1113#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(10);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; 1025#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; 1026#L400 assume !(1 == ~c_req_up~0); 1061#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1062#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1081#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1096#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1105#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1004#L431-1 assume !(0 == ~e_f~0); 1005#L436-1 assume !(0 == ~e_g~0); 1048#L441-1 assume !(0 == ~e_e~0); 1082#L446-1 assume !(0 == ~e_c~0); 1099#L451-1 assume !(0 == ~e_wl~0); 1116#L456-1 assume !(1 == ~wl_pc~0); 1097#L468 assume !(2 == ~wl_pc~0); 1071#L469 assume !(1 == ~c1_pc~0); 1070#L479 assume !(1 == ~c2_pc~0); 1072#L488 assume !(1 == ~wb_pc~0); 1029#L497 assume !(1 == ~e_c~0); 1030#L506-1 assume !(1 == ~e_e~0); 1114#L511-1 assume !(1 == ~e_f~0); 1031#L516-1 assume !(1 == ~e_g~0); 1032#L521-1 assume !(1 == ~e_c~0); 1074#L526-1 assume !(1 == ~e_wl~0); 1002#L668-1 [2020-10-20 08:03:52,518 INFO L796 eck$LassoCheckResult]: Loop: 1002#L668-1 assume !false; 1057#L538 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; 1039#L373 assume !false; 1040#L291 assume !(0 == ~wl_st~0); 1083#L295 assume !(0 == ~c1_st~0); 1084#L298 assume !(0 == ~c2_st~0); 1079#L301 assume !(0 == ~wb_st~0); 1052#L304 assume !(0 == ~r_st~0); 1054#L389 start_simulation_~kernel_st~0 := 2; 1018#L544 assume !(1 == ~c_req_up~0); 1019#L544-2 start_simulation_~kernel_st~0 := 3; 1108#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 1109#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1111#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1023#L566-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1024#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1058#L576-1 assume !(1 == ~wl_pc~0); 1015#L588 assume !(2 == ~wl_pc~0); 1016#L589 assume !(1 == ~c1_pc~0); 1009#L599 assume !(1 == ~c2_pc~0); 1011#L608 assume !(1 == ~wb_pc~0); 1043#L617 assume !(1 == ~e_c~0); 1049#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1050#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1087#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1104#L641-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1117#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1044#L651-1 assume 0 == ~wl_st~0; 1002#L668-1 [2020-10-20 08:03:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2020-10-20 08:03:52,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962663189] [2020-10-20 08:03:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:52,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:52,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:52,579 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1624185410, now seen corresponding path program 4 times [2020-10-20 08:03:52,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682631073] [2020-10-20 08:03:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,597 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:52,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682631073] [2020-10-20 08:03:52,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:52,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733982790] [2020-10-20 08:03:52,599 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:52,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:52,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:52,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:52,600 INFO L87 Difference]: Start difference. First operand 120 states and 211 transitions. cyclomatic complexity: 92 Second operand 3 states. [2020-10-20 08:03:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:52,643 INFO L93 Difference]: Finished difference Result 152 states and 271 transitions. [2020-10-20 08:03:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:52,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 271 transitions. [2020-10-20 08:03:52,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2020-10-20 08:03:52,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 152 states and 271 transitions. [2020-10-20 08:03:52,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2020-10-20 08:03:52,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2020-10-20 08:03:52,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 271 transitions. [2020-10-20 08:03:52,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:52,649 INFO L691 BuchiCegarLoop]: Abstraction has 152 states and 271 transitions. [2020-10-20 08:03:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 271 transitions. [2020-10-20 08:03:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-20 08:03:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-20 08:03:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 271 transitions. [2020-10-20 08:03:52,656 INFO L714 BuchiCegarLoop]: Abstraction has 152 states and 271 transitions. [2020-10-20 08:03:52,657 INFO L594 BuchiCegarLoop]: Abstraction has 152 states and 271 transitions. [2020-10-20 08:03:52,657 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:03:52,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 271 transitions. [2020-10-20 08:03:52,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2020-10-20 08:03:52,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:52,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:52,660 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:52,660 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:52,660 INFO L794 eck$LassoCheckResult]: Stem: 1393#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(10);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; 1304#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; 1305#L400 assume !(1 == ~c_req_up~0); 1340#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1341#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1360#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1375#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1385#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1282#L431-1 assume !(0 == ~e_f~0); 1283#L436-1 assume !(0 == ~e_g~0); 1327#L441-1 assume !(0 == ~e_e~0); 1361#L446-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1378#L451-1 assume !(0 == ~e_wl~0); 1396#L456-1 assume !(1 == ~wl_pc~0); 1376#L468 assume !(2 == ~wl_pc~0); 1350#L469 assume !(1 == ~c1_pc~0); 1349#L479 assume !(1 == ~c2_pc~0); 1351#L488 assume !(1 == ~wb_pc~0); 1308#L497 assume 1 == ~e_c~0;~r_st~0 := 0; 1309#L506-1 assume !(1 == ~e_e~0); 1394#L511-1 assume !(1 == ~e_f~0); 1310#L516-1 assume !(1 == ~e_g~0); 1311#L521-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1353#L526-1 assume !(1 == ~e_wl~0); 1280#L668-1 [2020-10-20 08:03:52,660 INFO L796 eck$LassoCheckResult]: Loop: 1280#L668-1 assume !false; 1336#L538 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; 1318#L373 assume !false; 1319#L291 assume !(0 == ~wl_st~0); 1362#L295 assume !(0 == ~c1_st~0); 1363#L298 assume !(0 == ~c2_st~0); 1358#L301 assume !(0 == ~wb_st~0); 1331#L304 assume !(0 == ~r_st~0); 1333#L389 start_simulation_~kernel_st~0 := 2; 1296#L544 assume !(1 == ~c_req_up~0); 1297#L544-2 start_simulation_~kernel_st~0 := 3; 1388#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 1389#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1391#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1301#L566-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1302#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1337#L576-1 assume 1 == ~wl_pc~0; 1330#L582 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1294#L589 assume !(1 == ~c1_pc~0); 1287#L599 assume !(1 == ~c2_pc~0); 1289#L608 assume !(1 == ~wb_pc~0); 1322#L617 assume 1 == ~e_c~0;~r_st~0 := 0; 1328#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1329#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1366#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1384#L641-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1397#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1323#L651-1 assume 0 == ~wl_st~0; 1280#L668-1 [2020-10-20 08:03:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2020-10-20 08:03:52,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948221133] [2020-10-20 08:03:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:52,716 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:52,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948221133] [2020-10-20 08:03:52,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:52,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:03:52,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108062834] [2020-10-20 08:03:52,718 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash 346514803, now seen corresponding path program 1 times [2020-10-20 08:03:52,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:52,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124781569] [2020-10-20 08:03:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:52,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:52,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:52,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:52,944 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:52,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:52,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:52,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:52,946 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:52,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:52,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:52,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:52,946 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2020-10-20 08:03:52,946 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:52,947 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:52,970 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:52,978 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:52,981 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:52,988 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:52,990 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:52,994 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:52,998 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:53,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:53,008 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:53,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:03:53,014 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:53,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:03:53,024 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:53,027 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:53,031 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:53,037 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:53,040 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:53,047 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:53,051 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:53,055 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:53,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:03:53,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:03:53,068 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:53,070 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:53,074 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:53,077 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:53,410 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:53,411 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) [2020-10-20 08:03:53,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:53,427 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:53,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:53,439 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:53,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:53,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:53,484 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:53,484 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:53,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:53,507 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:53,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:53,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:53,553 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:53,586 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:53,587 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:53,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:53,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:53,587 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:53,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:53,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:53,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:53,588 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2020-10-20 08:03:53,588 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:53,588 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:53,592 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:53,596 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:53,599 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:53,606 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:53,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:53,612 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:53,616 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:53,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:53,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:53,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:03:53,633 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:53,636 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:53,642 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:53,666 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:53,670 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:53,678 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:53,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:03:53,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:03:53,691 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:53,695 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:53,698 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:53,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:03:53,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:03:53,710 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:53,714 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:53,717 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:53,991 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:53,997 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:54,013 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:54,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:54,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:54,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:54,019 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:54,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,023 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:54,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:54,028 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:54,090 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:54,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:54,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:54,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:54,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:54,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:54,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:54,094 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:54,097 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:54,149 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:54,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:54,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:54,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:54,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:54,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:54,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:54,154 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:54,157 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:54,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:54,164 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:54,180 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:54,180 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:54,181 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:03:54,183 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,225 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:54,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:54,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:54,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:54,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:54,430 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:54,437 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:54,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 271 transitions. cyclomatic complexity: 120 Second operand 5 states. [2020-10-20 08:03:54,575 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 271 transitions. cyclomatic complexity: 120. Second operand 5 states. Result 470 states and 831 transitions. Complement of second has 5 states. [2020-10-20 08:03:54,575 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:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2020-10-20 08:03:54,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 370 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:54,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:54,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 370 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:54,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:54,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 370 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:54,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:54,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 831 transitions. [2020-10-20 08:03:54,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 299 [2020-10-20 08:03:54,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 455 states and 801 transitions. [2020-10-20 08:03:54,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2020-10-20 08:03:54,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2020-10-20 08:03:54,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 455 states and 801 transitions. [2020-10-20 08:03:54,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:54,607 INFO L691 BuchiCegarLoop]: Abstraction has 455 states and 801 transitions. [2020-10-20 08:03:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states and 801 transitions. [2020-10-20 08:03:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 348. [2020-10-20 08:03:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-10-20 08:03:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 613 transitions. [2020-10-20 08:03:54,635 INFO L714 BuchiCegarLoop]: Abstraction has 348 states and 613 transitions. [2020-10-20 08:03:54,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:03:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:03:54,636 INFO L87 Difference]: Start difference. First operand 348 states and 613 transitions. Second operand 4 states. [2020-10-20 08:03:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:54,782 INFO L93 Difference]: Finished difference Result 634 states and 1098 transitions. [2020-10-20 08:03:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:03:54,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 634 states and 1098 transitions. [2020-10-20 08:03:54,789 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 358 [2020-10-20 08:03:54,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 634 states to 634 states and 1098 transitions. [2020-10-20 08:03:54,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 452 [2020-10-20 08:03:54,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 452 [2020-10-20 08:03:54,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 634 states and 1098 transitions. [2020-10-20 08:03:54,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:54,802 INFO L691 BuchiCegarLoop]: Abstraction has 634 states and 1098 transitions. [2020-10-20 08:03:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states and 1098 transitions. [2020-10-20 08:03:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 607. [2020-10-20 08:03:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2020-10-20 08:03:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1059 transitions. [2020-10-20 08:03:54,819 INFO L714 BuchiCegarLoop]: Abstraction has 607 states and 1059 transitions. [2020-10-20 08:03:54,819 INFO L594 BuchiCegarLoop]: Abstraction has 607 states and 1059 transitions. [2020-10-20 08:03:54,819 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:03:54,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 1059 transitions. [2020-10-20 08:03:54,823 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 358 [2020-10-20 08:03:54,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:54,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:54,828 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:54,828 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:54,829 INFO L794 eck$LassoCheckResult]: Stem: 3285#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(10);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; 3109#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; 3110#L400 assume !(1 == ~c_req_up~0); 3210#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3390#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3388#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3386#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3383#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3381#L431-1 assume !(0 == ~e_f~0); 3379#L436-1 assume !(0 == ~e_g~0); 3378#L441-1 assume !(0 == ~e_e~0); 3377#L446-1 assume !(0 == ~e_c~0); 3376#L451-1 assume !(0 == ~e_wl~0); 3375#L456-1 assume !(1 == ~wl_pc~0); 3372#L468 assume !(2 == ~wl_pc~0); 3370#L469 assume !(1 == ~c1_pc~0); 3367#L479 assume !(1 == ~c2_pc~0); 3349#L488 assume !(1 == ~wb_pc~0); 3340#L497 assume 1 == ~e_c~0;~r_st~0 := 0; 3116#L506-1 assume !(1 == ~e_e~0); 3286#L511-1 assume !(1 == ~e_f~0); 3117#L516-1 assume !(1 == ~e_g~0); 3118#L521-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3198#L526-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3246#L668-1 [2020-10-20 08:03:54,829 INFO L796 eck$LassoCheckResult]: Loop: 3246#L668-1 assume !false; 3500#L538 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; 3498#L373 assume !false; 3496#L291 assume !(0 == ~wl_st~0); 3494#L295 assume !(0 == ~c1_st~0); 3492#L298 assume !(0 == ~c2_st~0); 3490#L301 assume !(0 == ~wb_st~0); 3486#L304 assume !(0 == ~r_st~0); 3484#L389 start_simulation_~kernel_st~0 := 2; 3478#L544 assume !(1 == ~c_req_up~0); 3476#L544-2 start_simulation_~kernel_st~0 := 3; 3473#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 3474#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3469#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3470#L566-1 assume !(0 == ~e_c~0); 3448#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3466#L576-1 assume 1 == ~wl_pc~0; 3461#L582 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3460#L589 assume !(1 == ~c1_pc~0); 3455#L599 assume !(1 == ~c2_pc~0); 3454#L608 assume !(1 == ~wb_pc~0); 3430#L617 assume 1 == ~e_c~0;~r_st~0 := 0; 3429#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3426#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3423#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3418#L641-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3419#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3526#L651-1 assume 0 == ~wl_st~0; 3246#L668-1 [2020-10-20 08:03:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash 198346713, now seen corresponding path program 1 times [2020-10-20 08:03:54,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:54,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136139168] [2020-10-20 08:03:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:54,888 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:54,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136139168] [2020-10-20 08:03:54,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:54,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:54,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940504196] [2020-10-20 08:03:54,890 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash -664602447, now seen corresponding path program 1 times [2020-10-20 08:03:54,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:54,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935333997] [2020-10-20 08:03:54,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:54,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:54,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:54,906 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:55,070 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-10-20 08:03:55,124 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:55,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:55,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:55,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:55,125 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:55,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:55,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:55,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration7_Loop [2020-10-20 08:03:55,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:55,125 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:55,128 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:55,131 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:55,134 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:55,136 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:55,138 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:55,141 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:55,143 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:55,146 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:55,149 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:55,155 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:55,158 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:55,163 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:55,169 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:55,172 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:55,177 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:55,179 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:55,185 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:55,188 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:55,193 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:55,196 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:55,199 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:55,212 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:55,215 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:55,218 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:55,223 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:55,225 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:55,451 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:55,451 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,470 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,470 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,508 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,508 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,560 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,560 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,595 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,595 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,622 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,623 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet9=0} Honda state: {ULTIMATE.start_eval_#t~nondet9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:03:55,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,649 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:55,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,676 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,676 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,703 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:55,707 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:55,733 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:55,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:55,767 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:55,790 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:55,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:55,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:55,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:55,791 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:55,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:55,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:55,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration7_Loop [2020-10-20 08:03:55,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:55,791 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:55,794 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:55,803 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:55,805 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:55,807 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:55,809 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:55,811 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:55,814 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:55,817 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:55,824 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:55,827 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:55,829 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:55,834 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:55,836 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:55,841 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:55,844 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:55,849 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:55,853 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:55,856 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:55,863 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:55,866 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:55,868 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:55,870 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:55,872 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:55,874 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:55,876 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:55,881 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:56,134 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:56,135 INFO L489 LassoAnalysis]: Using template 'affine'. 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:03:56,146 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:56,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:56,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:56,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:56,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 20 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,206 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:56,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:56,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:56,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,214 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,250 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:56,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,252 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:56,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,253 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:56,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,294 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:56,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:56,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:56,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,332 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:56,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:56,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:56,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:56,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,359 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:56,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:56,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:56,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:56,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,399 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,401 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:56,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,402 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:56,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:56,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,431 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:56,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:56,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:56,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:56,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:56,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:56,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:56,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:56,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:56,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:56,451 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:56,454 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:56,455 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:03:56,455 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -2*~e_c~0 + 3 Supporting invariants [] Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,491 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:56,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:56,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:56,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:56,595 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,596 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:56,596 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 607 states and 1059 transitions. cyclomatic complexity: 458 Second operand 5 states. [2020-10-20 08:03:56,654 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 607 states and 1059 transitions. cyclomatic complexity: 458. Second operand 5 states. Result 989 states and 1720 transitions. Complement of second has 7 states. [2020-10-20 08:03:56,655 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:03:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2020-10-20 08:03:56,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:56,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:56,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:56,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:56,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:56,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:56,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 989 states and 1720 transitions. [2020-10-20 08:03:56,671 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 558 [2020-10-20 08:03:56,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 989 states to 985 states and 1712 transitions. [2020-10-20 08:03:56,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2020-10-20 08:03:56,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 639 [2020-10-20 08:03:56,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 985 states and 1712 transitions. [2020-10-20 08:03:56,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:56,685 INFO L691 BuchiCegarLoop]: Abstraction has 985 states and 1712 transitions. [2020-10-20 08:03:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states and 1712 transitions. [2020-10-20 08:03:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 528. [2020-10-20 08:03:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-20 08:03:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 921 transitions. [2020-10-20 08:03:56,707 INFO L714 BuchiCegarLoop]: Abstraction has 528 states and 921 transitions. [2020-10-20 08:03:56,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:56,708 INFO L87 Difference]: Start difference. First operand 528 states and 921 transitions. Second operand 3 states. [2020-10-20 08:03:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:56,751 INFO L93 Difference]: Finished difference Result 799 states and 1379 transitions. [2020-10-20 08:03:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:56,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 799 states and 1379 transitions. [2020-10-20 08:03:56,759 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 457 [2020-10-20 08:03:56,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 799 states to 631 states and 1089 transitions. [2020-10-20 08:03:56,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 537 [2020-10-20 08:03:56,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 542 [2020-10-20 08:03:56,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 1089 transitions. [2020-10-20 08:03:56,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:56,811 INFO L691 BuchiCegarLoop]: Abstraction has 631 states and 1089 transitions. [2020-10-20 08:03:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 1089 transitions. [2020-10-20 08:03:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 446. [2020-10-20 08:03:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-10-20 08:03:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 774 transitions. [2020-10-20 08:03:56,835 INFO L714 BuchiCegarLoop]: Abstraction has 446 states and 774 transitions. [2020-10-20 08:03:56,835 INFO L594 BuchiCegarLoop]: Abstraction has 446 states and 774 transitions. [2020-10-20 08:03:56,835 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:03:56,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 446 states and 774 transitions. [2020-10-20 08:03:56,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 279 [2020-10-20 08:03:56,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:56,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:56,841 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,841 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,842 INFO L794 eck$LassoCheckResult]: Stem: 6379#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(10);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; 6213#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; 6214#L400 assume !(1 == ~c_req_up~0); 6278#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6279#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6424#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6423#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6422#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6173#L431-1 assume !(0 == ~e_f~0); 6174#L436-1 assume !(0 == ~e_g~0); 6253#L441-1 assume !(0 == ~e_e~0); 6315#L446-1 assume !(0 == ~e_c~0); 6348#L451-1 assume !(0 == ~e_wl~0); 6395#L456-1 assume !(1 == ~wl_pc~0); 6396#L468 assume !(2 == ~wl_pc~0); 6294#L469 assume !(1 == ~c1_pc~0); 6293#L479 assume !(1 == ~c2_pc~0); 6296#L488 assume !(1 == ~wb_pc~0); 6219#L497 assume !(1 == ~e_c~0); 6220#L506-1 assume !(1 == ~e_e~0); 6392#L511-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6221#L516-1 assume !(1 == ~e_g~0); 6222#L521-1 assume !(1 == ~e_c~0); 6343#L526-1 assume !(1 == ~e_wl~0); 6168#L668-1 [2020-10-20 08:03:56,842 INFO L796 eck$LassoCheckResult]: Loop: 6168#L668-1 assume !false; 6400#L538 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; 6449#L373 assume !false; 6448#L291 assume !(0 == ~wl_st~0); 6447#L295 assume !(0 == ~c1_st~0); 6446#L298 assume !(0 == ~c2_st~0); 6445#L301 assume !(0 == ~wb_st~0); 6260#L304 assume !(0 == ~r_st~0); 6262#L389 start_simulation_~kernel_st~0 := 2; 6199#L544 assume !(1 == ~c_req_up~0); 6200#L544-2 start_simulation_~kernel_st~0 := 3; 6440#L556 assume 0 == ~e_f~0;~e_f~0 := 1; 6373#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6374#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6205#L566-1 assume !(0 == ~e_c~0); 6206#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6270#L576-1 assume 1 == ~wl_pc~0; 6258#L582 assume 1 == ~e_wl~0;~wl_st~0 := 0; 6188#L589 assume !(1 == ~c1_pc~0); 6175#L599 assume !(1 == ~c2_pc~0); 6177#L608 assume !(1 == ~wb_pc~0); 6240#L617 assume !(1 == ~e_c~0); 6254#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6255#L631-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6320#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6356#L641-1 assume !(1 == ~e_c~0); 6385#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6245#L651-1 assume 0 == ~wl_st~0; 6168#L668-1 [2020-10-20 08:03:56,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2020-10-20 08:03:56,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:56,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399955621] [2020-10-20 08:03:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:56,871 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,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399955621] [2020-10-20 08:03:56,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:56,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:03:56,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046645909] [2020-10-20 08:03:56,873 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1110406837, now seen corresponding path program 1 times [2020-10-20 08:03:56,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:56,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128862548] [2020-10-20 08:03:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:56,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:56,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:56,887 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:57,001 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:57,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:57,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:57,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:57,002 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:57,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:57,003 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:57,003 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2020-10-20 08:03:57,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:57,003 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:57,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:03:57,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:03:57,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:03:57,021 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,024 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,027 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,029 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,035 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,038 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,041 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,043 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,046 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,051 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,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:03:57,057 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,062 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,065 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,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:03:57,082 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,085 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,087 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,089 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,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:03:57,093 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,096 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,101 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,344 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:57,345 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:57,351 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:57,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:57,395 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:57,416 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:57,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:57,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:57,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:57,417 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:57,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:57,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:57,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration8_Loop [2020-10-20 08:03:57,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:57,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:57,419 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,422 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,426 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,431 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,434 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,439 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,441 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,443 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,445 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,448 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,463 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,467 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,470 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,473 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,477 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,479 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,482 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,484 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,487 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,491 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,495 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,498 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,500 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,502 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,510 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,514 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,758 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:57,759 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,765 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:57,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:57,774 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:57,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:57,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:57,815 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,818 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:57,818 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:57,818 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:03:57,818 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,851 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:57,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:57,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:57,983 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,983 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:57,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 446 states and 774 transitions. cyclomatic complexity: 331 Second operand 5 states. [2020-10-20 08:03:58,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 446 states and 774 transitions. cyclomatic complexity: 331. Second operand 5 states. Result 1463 states and 2534 transitions. Complement of second has 5 states. [2020-10-20 08:03:58,031 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:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2020-10-20 08:03:58,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 361 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:58,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:58,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 361 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:58,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:58,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 361 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:58,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:58,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1463 states and 2534 transitions. [2020-10-20 08:03:58,048 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 738 [2020-10-20 08:03:58,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1463 states to 1448 states and 2511 transitions. [2020-10-20 08:03:58,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 829 [2020-10-20 08:03:58,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 837 [2020-10-20 08:03:58,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1448 states and 2511 transitions. [2020-10-20 08:03:58,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:58,064 INFO L691 BuchiCegarLoop]: Abstraction has 1448 states and 2511 transitions. [2020-10-20 08:03:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states and 2511 transitions. [2020-10-20 08:03:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1054. [2020-10-20 08:03:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2020-10-20 08:03:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1842 transitions. [2020-10-20 08:03:58,087 INFO L714 BuchiCegarLoop]: Abstraction has 1054 states and 1842 transitions. [2020-10-20 08:03:58,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:03:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:03:58,088 INFO L87 Difference]: Start difference. First operand 1054 states and 1842 transitions. Second operand 4 states. [2020-10-20 08:03:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:58,239 INFO L93 Difference]: Finished difference Result 1372 states and 2377 transitions. [2020-10-20 08:03:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:03:58,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1372 states and 2377 transitions. [2020-10-20 08:03:58,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 595 [2020-10-20 08:03:58,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1372 states to 1372 states and 2377 transitions. [2020-10-20 08:03:58,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 758 [2020-10-20 08:03:58,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 758 [2020-10-20 08:03:58,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1372 states and 2377 transitions. [2020-10-20 08:03:58,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:58,277 INFO L691 BuchiCegarLoop]: Abstraction has 1372 states and 2377 transitions. [2020-10-20 08:03:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states and 2377 transitions. [2020-10-20 08:03:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1265. [2020-10-20 08:03:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2020-10-20 08:03:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2201 transitions. [2020-10-20 08:03:58,300 INFO L714 BuchiCegarLoop]: Abstraction has 1265 states and 2201 transitions. [2020-10-20 08:03:58,300 INFO L594 BuchiCegarLoop]: Abstraction has 1265 states and 2201 transitions. [2020-10-20 08:03:58,300 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:03:58,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1265 states and 2201 transitions. [2020-10-20 08:03:58,307 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 514 [2020-10-20 08:03:58,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:58,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:58,308 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:58,308 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:58,308 INFO L794 eck$LassoCheckResult]: Stem: 10916#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(10);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; 10729#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; 10730#L400 assume !(1 == ~c_req_up~0); 10831#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10833#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10834#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10896#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10897#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 10689#L431-1 assume !(0 == ~e_f~0); 10690#L436-1 assume !(0 == ~e_g~0); 10769#L441-1 assume !(0 == ~e_e~0); 10835#L446-1 assume !(0 == ~e_c~0); 10886#L451-1 assume !(0 == ~e_wl~0); 11081#L456-1 assume !(1 == ~wl_pc~0); 10881#L468 assume !(2 == ~wl_pc~0); 10882#L469 assume !(1 == ~c1_pc~0); 11078#L479 assume !(1 == ~c2_pc~0); 11076#L488 assume !(1 == ~wb_pc~0); 10735#L497 assume !(1 == ~e_c~0); 10736#L506-1 assume !(1 == ~e_e~0); 10936#L511-1 assume !(1 == ~e_f~0); 10937#L516-1 assume !(1 == ~e_g~0); 10819#L521-1 assume !(1 == ~e_c~0); 10820#L526-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 10877#L668-1 [2020-10-20 08:03:58,308 INFO L796 eck$LassoCheckResult]: Loop: 10877#L668-1 assume !false; 11740#L538 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; 11741#L373 assume !false; 11735#L291 assume !(0 == ~wl_st~0); 11736#L295 assume !(0 == ~c1_st~0); 11729#L298 assume !(0 == ~c2_st~0); 11730#L301 assume !(0 == ~wb_st~0); 11708#L304 assume !(0 == ~r_st~0); 11710#L389 start_simulation_~kernel_st~0 := 2; 11638#L544 assume !(1 == ~c_req_up~0); 11639#L544-2 start_simulation_~kernel_st~0 := 3; 11880#L556 assume !(0 == ~e_f~0); 11878#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 11873#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 11871#L566-1 assume !(0 == ~e_c~0); 11870#L571-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 11869#L576-1 assume 1 == ~wl_pc~0; 11867#L582 assume 1 == ~e_wl~0;~wl_st~0 := 0; 11864#L589 assume !(1 == ~c1_pc~0); 11861#L599 assume !(1 == ~c2_pc~0); 11858#L608 assume !(1 == ~wb_pc~0); 11855#L617 assume !(1 == ~e_c~0); 11851#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 11782#L631-1 assume !(1 == ~e_f~0); 11775#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 11761#L641-1 assume !(1 == ~e_c~0); 11758#L646-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 11753#L651-1 assume 0 == ~wl_st~0; 10877#L668-1 [2020-10-20 08:03:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2020-10-20 08:03:58,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733873509] [2020-10-20 08:03:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,331 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:58,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733873509] [2020-10-20 08:03:58,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:58,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147236913] [2020-10-20 08:03:58,332 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:58,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,332 INFO L82 PathProgramCache]: Analyzing trace with hash -476094023, now seen corresponding path program 1 times [2020-10-20 08:03:58,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950852667] [2020-10-20 08:03:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:58,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:58,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:58,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:58,454 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:58,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:58,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:58,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:58,454 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:58,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:58,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:58,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2020-10-20 08:03:58,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:58,455 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:58,456 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,459 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,463 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,465 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,468 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,471 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,474 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,476 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,478 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,481 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,487 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,496 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,501 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,504 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,510 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,513 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,515 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,518 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,521 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,523 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,527 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,530 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,532 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,535 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,536 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,550 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,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:58,799 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,807 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,807 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___2~0=0} Honda state: {ULTIMATE.start_eval_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,862 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,862 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,889 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,889 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,915 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,941 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,942 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:58,967 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:58,968 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:58,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:58,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:59,002 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:59,002 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:59,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:59,027 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:59,027 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_st~0=7} Honda state: {~wb_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:59,051 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 43 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:59,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:59,107 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:59,108 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:59,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:59,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:59,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:59,109 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:59,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:59,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:59,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration9_Loop [2020-10-20 08:03:59,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:59,109 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:59,111 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:59,117 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:59,119 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:59,121 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:59,123 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:59,135 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:59,140 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:59,142 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:59,143 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:59,145 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:59,169 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:59,182 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:59,187 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:59,189 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:59,192 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:59,195 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:59,197 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:59,201 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:59,203 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:59,205 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:59,211 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:59,213 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:59,216 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:59,218 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:59,220 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:59,222 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:59,477 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:59,477 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,485 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,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,487 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:59,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,488 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:59,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,493 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,525 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,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,529 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,550 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,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,552 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:59,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,552 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:59,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,554 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,577 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,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,582 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,617 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,628 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:59,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,629 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:59,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,630 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,654 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,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,657 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,680 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,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,683 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,705 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,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,712 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,734 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,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,736 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:59,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,739 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:59,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,741 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,767 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,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,768 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:59,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,769 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:59,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:59,772 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,794 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,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:59,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:59,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:59,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:59,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:59,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:59,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:59,802 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:59,802 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:59,804 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:59,804 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:03:59,805 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_wl~0) = -1*~e_wl~0 + 1 Supporting invariants [] [2020-10-20 08:03:59,825 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:59,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:59,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:59,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:59,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:59,909 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,909 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,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1265 states and 2201 transitions. cyclomatic complexity: 944 Second operand 5 states. [2020-10-20 08:03:59,968 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1265 states and 2201 transitions. cyclomatic complexity: 944. Second operand 5 states. Result 2556 states and 4440 transitions. Complement of second has 5 states. [2020-10-20 08:03:59,969 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,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2020-10-20 08:03:59,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 370 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:59,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:59,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 370 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:59,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:59,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 370 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:59,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:59,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2556 states and 4440 transitions. [2020-10-20 08:03:59,988 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1097 [2020-10-20 08:04:00,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2556 states to 2552 states and 4432 transitions. [2020-10-20 08:04:00,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1248 [2020-10-20 08:04:00,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1270 [2020-10-20 08:04:00,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 4432 transitions. [2020-10-20 08:04:00,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:00,008 INFO L691 BuchiCegarLoop]: Abstraction has 2552 states and 4432 transitions. [2020-10-20 08:04:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 4432 transitions. [2020-10-20 08:04:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2153. [2020-10-20 08:04:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2020-10-20 08:04:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 3746 transitions. [2020-10-20 08:04:00,048 INFO L714 BuchiCegarLoop]: Abstraction has 2153 states and 3746 transitions. [2020-10-20 08:04:00,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:04:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:04:00,048 INFO L87 Difference]: Start difference. First operand 2153 states and 3746 transitions. Second operand 4 states. [2020-10-20 08:04:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:00,374 INFO L93 Difference]: Finished difference Result 3113 states and 5362 transitions. [2020-10-20 08:04:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:04:00,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3113 states and 5362 transitions. [2020-10-20 08:04:00,395 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1173 [2020-10-20 08:04:00,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3113 states to 3113 states and 5362 transitions. [2020-10-20 08:04:00,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1534 [2020-10-20 08:04:00,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1534 [2020-10-20 08:04:00,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3113 states and 5362 transitions. [2020-10-20 08:04:00,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:00,417 INFO L691 BuchiCegarLoop]: Abstraction has 3113 states and 5362 transitions. [2020-10-20 08:04:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states and 5362 transitions. [2020-10-20 08:04:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2719. [2020-10-20 08:04:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2020-10-20 08:04:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4701 transitions. [2020-10-20 08:04:00,466 INFO L714 BuchiCegarLoop]: Abstraction has 2719 states and 4701 transitions. [2020-10-20 08:04:00,466 INFO L594 BuchiCegarLoop]: Abstraction has 2719 states and 4701 transitions. [2020-10-20 08:04:00,466 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:04:00,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2719 states and 4701 transitions. [2020-10-20 08:04:00,478 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 991 [2020-10-20 08:04:00,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:00,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:00,479 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:00,479 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:04:00,479 INFO L794 eck$LassoCheckResult]: Stem: 20198#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(10);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; 19997#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; 19998#L400 assume !(1 == ~c_req_up~0); 20101#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 20105#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 20106#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 20169#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 20170#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 19957#L431-1 assume !(0 == ~e_f~0); 19958#L436-1 assume !(0 == ~e_g~0); 20241#L441-1 assume !(0 == ~e_e~0); 20156#L446-1 assume !(0 == ~e_c~0); 20157#L451-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 20204#L456-1 assume !(1 == ~wl_pc~0); 20640#L468 assume !(2 == ~wl_pc~0); 20637#L469 assume !(1 == ~c1_pc~0); 20628#L479 assume !(1 == ~c2_pc~0); 20621#L488 assume !(1 == ~wb_pc~0); 20616#L497 assume !(1 == ~e_c~0); 20614#L506-1 assume !(1 == ~e_e~0); 20613#L511-1 assume !(1 == ~e_f~0); 20611#L516-1 assume !(1 == ~e_g~0); 20609#L521-1 assume !(1 == ~e_c~0); 20607#L526-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 20605#L668-1 assume !false; 20056#L538 [2020-10-20 08:04:00,479 INFO L796 eck$LassoCheckResult]: Loop: 20056#L538 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; 20019#L373 assume !false; 20020#L291 assume !(0 == ~wl_st~0); 22531#L295 assume !(0 == ~c1_st~0); 22533#L298 assume !(0 == ~c2_st~0); 22529#L301 assume !(0 == ~wb_st~0); 22530#L304 assume !(0 == ~r_st~0); 22532#L389 start_simulation_~kernel_st~0 := 2; 19983#L544 assume !(1 == ~c_req_up~0); 19984#L544-2 start_simulation_~kernel_st~0 := 3; 20181#L556 assume !(0 == ~e_f~0); 20182#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 20191#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 20219#L566-1 assume !(0 == ~e_c~0); 22664#L571-1 assume !(0 == ~e_wl~0); 22663#L576-1 assume !(1 == ~wl_pc~0); 21753#L588 assume !(2 == ~wl_pc~0); 22660#L589 assume !(1 == ~c1_pc~0); 19965#L599 assume !(1 == ~c2_pc~0); 19967#L608 assume !(1 == ~wb_pc~0); 20026#L617 assume !(1 == ~e_c~0); 20039#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 20040#L631-1 assume !(1 == ~e_f~0); 20116#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 20166#L641-1 assume !(1 == ~e_c~0); 20232#L646-1 assume !(1 == ~e_wl~0); 20233#L651-1 assume 0 == ~wl_st~0; 21769#L668-1 assume !false; 20056#L538 [2020-10-20 08:04:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash -79371012, now seen corresponding path program 1 times [2020-10-20 08:04:00,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:00,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729579896] [2020-10-20 08:04:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:00,503 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:00,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729579896] [2020-10-20 08:04:00,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:00,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:04:00,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103560886] [2020-10-20 08:04:00,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:00,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1867312416, now seen corresponding path program 1 times [2020-10-20 08:04:00,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:00,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331324224] [2020-10-20 08:04:00,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:00,517 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:00,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331324224] [2020-10-20 08:04:00,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:00,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:00,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217240818] [2020-10-20 08:04:00,518 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:04:00,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:04:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:04:00,519 INFO L87 Difference]: Start difference. First operand 2719 states and 4701 transitions. cyclomatic complexity: 1996 Second operand 4 states. [2020-10-20 08:04:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:00,599 INFO L93 Difference]: Finished difference Result 2772 states and 4664 transitions. [2020-10-20 08:04:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:04:00,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2772 states and 4664 transitions. [2020-10-20 08:04:00,654 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1014 [2020-10-20 08:04:00,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2772 states to 2772 states and 4664 transitions. [2020-10-20 08:04:00,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1176 [2020-10-20 08:04:00,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1176 [2020-10-20 08:04:00,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2772 states and 4664 transitions. [2020-10-20 08:04:00,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:00,676 INFO L691 BuchiCegarLoop]: Abstraction has 2772 states and 4664 transitions. [2020-10-20 08:04:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states and 4664 transitions. [2020-10-20 08:04:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2460. [2020-10-20 08:04:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2460 states. [2020-10-20 08:04:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 4176 transitions. [2020-10-20 08:04:00,724 INFO L714 BuchiCegarLoop]: Abstraction has 2460 states and 4176 transitions. [2020-10-20 08:04:00,724 INFO L594 BuchiCegarLoop]: Abstraction has 2460 states and 4176 transitions. [2020-10-20 08:04:00,724 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:04:00,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2460 states and 4176 transitions. [2020-10-20 08:04:00,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 838 [2020-10-20 08:04:00,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:00,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:00,733 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:00,733 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:04:00,733 INFO L794 eck$LassoCheckResult]: Stem: 25700#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(10);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; 25498#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; 25499#L400 assume !(1 == ~c_req_up~0); 25603#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 25604#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 25605#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 25672#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 25673#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 25458#L431-1 assume !(0 == ~e_f~0); 25459#L436-1 assume !(0 == ~e_g~0); 25606#L441-1 assume !(0 == ~e_e~0); 25607#L446-1 assume !(0 == ~e_c~0); 25754#L451-1 assume !(0 == ~e_wl~0); 25751#L456-1 assume !(1 == ~wl_pc~0); 25746#L468 assume !(2 == ~wl_pc~0); 25744#L469 assume !(1 == ~c1_pc~0); 25741#L479 assume !(1 == ~c2_pc~0); 25738#L488 assume !(1 == ~wb_pc~0); 25504#L497 assume !(1 == ~e_c~0); 25505#L506-1 assume !(1 == ~e_e~0); 25759#L511-1 assume !(1 == ~e_f~0); 25758#L516-1 assume !(1 == ~e_g~0); 25590#L521-1 assume !(1 == ~e_c~0); 25591#L526-1 assume !(1 == ~e_wl~0); 27369#L668-1 assume !false; 25780#L538 [2020-10-20 08:04:00,733 INFO L796 eck$LassoCheckResult]: Loop: 25780#L538 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; 27286#L373 assume !false; 27282#L291 assume !(0 == ~wl_st~0); 27283#L295 assume !(0 == ~c1_st~0); 27285#L298 assume !(0 == ~c2_st~0); 27280#L301 assume !(0 == ~wb_st~0); 27281#L304 assume !(0 == ~r_st~0); 27284#L389 start_simulation_~kernel_st~0 := 2; 27909#L544 assume !(1 == ~c_req_up~0); 27908#L544-2 start_simulation_~kernel_st~0 := 3; 27907#L556 assume !(0 == ~e_f~0); 27906#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 25715#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 25490#L566-1 assume !(0 == ~e_c~0); 25491#L571-1 assume !(0 == ~e_wl~0); 25559#L576-1 assume !(1 == ~wl_pc~0); 25472#L588 assume !(2 == ~wl_pc~0); 25473#L589 assume !(1 == ~c1_pc~0); 25460#L599 assume !(1 == ~c2_pc~0); 25462#L608 assume !(1 == ~wb_pc~0); 25531#L617 assume !(1 == ~e_c~0); 25540#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 25541#L631-1 assume !(1 == ~e_f~0); 27855#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 25708#L641-1 assume !(1 == ~e_c~0); 25709#L646-1 assume !(1 == ~e_wl~0); 25729#L651-1 assume 0 == ~wl_st~0; 27296#L668-1 assume !false; 25780#L538 [2020-10-20 08:04:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2020-10-20 08:04:00,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:00,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721341095] [2020-10-20 08:04:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:00,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:00,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:00,754 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1867312416, now seen corresponding path program 2 times [2020-10-20 08:04:00,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:00,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531339892] [2020-10-20 08:04:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:00,772 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:00,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531339892] [2020-10-20 08:04:00,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:00,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:00,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772468484] [2020-10-20 08:04:00,773 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:04:00,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:00,773 INFO L87 Difference]: Start difference. First operand 2460 states and 4176 transitions. cyclomatic complexity: 1726 Second operand 3 states. [2020-10-20 08:04:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:00,829 INFO L93 Difference]: Finished difference Result 3939 states and 6623 transitions. [2020-10-20 08:04:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:00,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3939 states and 6623 transitions. [2020-10-20 08:04:00,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1340 [2020-10-20 08:04:00,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3939 states to 3939 states and 6623 transitions. [2020-10-20 08:04:00,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1508 [2020-10-20 08:04:00,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1508 [2020-10-20 08:04:00,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3939 states and 6623 transitions. [2020-10-20 08:04:00,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:00,883 INFO L691 BuchiCegarLoop]: Abstraction has 3939 states and 6623 transitions. [2020-10-20 08:04:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states and 6623 transitions. [2020-10-20 08:04:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3939. [2020-10-20 08:04:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3939 states. [2020-10-20 08:04:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 6623 transitions. [2020-10-20 08:04:01,208 INFO L714 BuchiCegarLoop]: Abstraction has 3939 states and 6623 transitions. [2020-10-20 08:04:01,208 INFO L594 BuchiCegarLoop]: Abstraction has 3939 states and 6623 transitions. [2020-10-20 08:04:01,208 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:04:01,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3939 states and 6623 transitions. [2020-10-20 08:04:01,222 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1340 [2020-10-20 08:04:01,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:01,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:01,223 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,223 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, 1] [2020-10-20 08:04:01,223 INFO L794 eck$LassoCheckResult]: Stem: 32092#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(10);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; 31903#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; 31904#L400 assume !(1 == ~c_req_up~0); 32007#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 32145#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 32143#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 32142#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 32139#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 32138#L431-1 assume !(0 == ~e_f~0); 32137#L436-1 assume !(0 == ~e_g~0); 32136#L441-1 assume !(0 == ~e_e~0); 32058#L446-1 assume !(0 == ~e_c~0); 32059#L451-1 assume !(0 == ~e_wl~0); 32119#L456-1 assume !(1 == ~wl_pc~0); 32055#L468 assume !(2 == ~wl_pc~0); 32056#L469 assume !(1 == ~c1_pc~0); 32141#L479 assume !(1 == ~c2_pc~0); 32134#L488 assume !(1 == ~wb_pc~0); 31910#L497 assume !(1 == ~e_c~0); 31911#L506-1 assume !(1 == ~e_e~0); 32159#L511-1 assume !(1 == ~e_f~0); 32158#L516-1 assume !(1 == ~e_g~0); 31994#L521-1 assume !(1 == ~e_c~0); 31995#L526-1 assume !(1 == ~e_wl~0); 35367#L668-1 assume !false; 33356#L538 [2020-10-20 08:04:01,224 INFO L796 eck$LassoCheckResult]: Loop: 33356#L538 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; 33353#L373 assume !false; 33319#L291 assume !(0 == ~wl_st~0); 33320#L295 assume !(0 == ~c1_st~0); 33952#L298 assume !(0 == ~c2_st~0); 32004#L301 assume !(0 == ~wb_st~0); 31951#L304 assume !(0 == ~r_st~0); 31953#L389 start_simulation_~kernel_st~0 := 2; 31889#L544 assume !(1 == ~c_req_up~0); 31890#L544-2 start_simulation_~kernel_st~0 := 3; 32078#L556 assume !(0 == ~e_f~0); 32079#L556-2 assume 0 == ~e_g~0;~e_g~0 := 1; 32085#L561-1 assume 0 == ~e_e~0;~e_e~0 := 1; 35735#L566-1 assume !(0 == ~e_c~0); 35734#L571-1 assume !(0 == ~e_wl~0); 34027#L576-1 assume !(1 == ~wl_pc~0); 34023#L588 assume 2 == ~wl_pc~0; 35732#L590 assume 1 == ~e_e~0;~wl_st~0 := 0; 35731#L589 assume !(1 == ~c1_pc~0); 35729#L599 assume !(1 == ~c2_pc~0); 35725#L608 assume !(1 == ~wb_pc~0); 35723#L617 assume !(1 == ~e_c~0); 35722#L626-1 assume 1 == ~e_e~0;~e_e~0 := 2; 35721#L631-1 assume !(1 == ~e_f~0); 32068#L636-1 assume 1 == ~e_g~0;~e_g~0 := 2; 32069#L641-1 assume !(1 == ~e_c~0); 33657#L646-1 assume !(1 == ~e_wl~0); 35688#L651-1 assume 0 == ~wl_st~0; 33369#L668-1 assume !false; 33356#L538 [2020-10-20 08:04:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2020-10-20 08:04:01,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:01,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740214444] [2020-10-20 08:04:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:01,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:01,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:01,244 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1493800160, now seen corresponding path program 1 times [2020-10-20 08:04:01,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:01,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004132950] [2020-10-20 08:04:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:01,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:01,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:01,253 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2131193989, now seen corresponding path program 1 times [2020-10-20 08:04:01,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:01,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613426689] [2020-10-20 08:04:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:01,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613426689] [2020-10-20 08:04:01,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:01,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:01,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151537684] [2020-10-20 08:04:01,392 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-10-20 08:04:01,439 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:04:01,439 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:04:01,439 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:04:01,439 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:04:01,439 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:04:01,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:04:01,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:04:01,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration12_Loop [2020-10-20 08:04:01,440 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:04:01,440 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:04:01,441 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:01,443 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:01,445 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:01,448 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:01,449 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:01,453 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:01,455 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:01,460 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:01,462 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:01,468 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:01,470 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:01,474 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:01,477 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:01,479 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:01,481 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:01,483 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:01,485 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:01,490 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:01,492 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:01,494 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:01,508 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:01,510 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:01,512 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:01,515 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:01,518 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:01,520 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:01,750 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:04:01,750 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,763 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,791 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,819 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,819 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~wb_pc~0=-8} Honda state: {~wb_pc~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,844 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,844 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,867 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,870 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,870 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_f~0=3} Honda state: {~e_f~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,896 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,896 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,924 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,924 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e_wl~0=3} Honda state: {~e_wl~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:01,949 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:01,949 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:01,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:01,973 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 65 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:01,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:04:01,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:04:02,029 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:04:02,030 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:04:02,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:04:02,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:04:02,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:04:02,031 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:04:02,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:04:02,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:04:02,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration12_Loop [2020-10-20 08:04:02,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:04:02,031 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:04:02,032 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:02,035 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:02,037 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:02,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:02,046 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:02,050 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:02,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:02,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:02,061 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:02,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:02,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:02,085 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:02,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:02,090 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:02,093 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:02,096 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:02,101 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:02,104 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:02,106 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:02,108 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:02,111 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:02,114 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:02,120 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:02,122 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:02,124 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:02,128 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:02,392 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:04:02,392 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,406 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:02,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,408 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:02,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,408 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:02,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,410 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,433 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:02,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,435 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:02,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,436 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:02,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,437 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,460 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:02,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:02,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:02,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,464 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,487 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:02,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:02,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:02,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,514 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:02,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,516 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:02,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,516 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:02,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,518 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,541 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:02,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:02,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:02,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,545 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,568 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:02,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,570 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:02,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,570 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:02,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,572 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,593 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:02,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,595 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:02,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,596 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:02,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,597 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,619 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:02,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,621 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:02,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,622 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:02,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,634 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,655 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:02,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:02,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:02,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:02,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:02,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:02,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:02,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:02,660 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:04:02,662 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:04:02,663 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 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:02,665 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:04:02,665 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:04:02,666 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:04:02,666 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_g~0) = -1*~e_g~0 + 1 Supporting invariants [] [2020-10-20 08:04:02,688 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:04:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:04:02,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:04:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:04:02,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:04:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,771 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:02,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3939 states and 6623 transitions. cyclomatic complexity: 2694 Second operand 5 states. [2020-10-20 08:04:02,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3939 states and 6623 transitions. cyclomatic complexity: 2694. Second operand 5 states. Result 11292 states and 18969 transitions. Complement of second has 5 states. [2020-10-20 08:04:02,872 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:04:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:04:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-10-20 08:04:02,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 29 letters. [2020-10-20 08:04:02,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:02,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 54 letters. Loop has 29 letters. [2020-10-20 08:04:02,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:02,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 58 letters. [2020-10-20 08:04:02,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:02,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11292 states and 18969 transitions. [2020-10-20 08:04:02,921 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2584 [2020-10-20 08:04:02,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11292 states to 11292 states and 18969 transitions. [2020-10-20 08:04:02,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2899 [2020-10-20 08:04:02,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2940 [2020-10-20 08:04:03,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11292 states and 18969 transitions. [2020-10-20 08:04:03,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:03,001 INFO L691 BuchiCegarLoop]: Abstraction has 11292 states and 18969 transitions. [2020-10-20 08:04:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11292 states and 18969 transitions. [2020-10-20 08:04:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11292 to 11251. [2020-10-20 08:04:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11251 states. [2020-10-20 08:04:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11251 states to 11251 states and 18912 transitions. [2020-10-20 08:04:03,307 INFO L714 BuchiCegarLoop]: Abstraction has 11251 states and 18912 transitions. [2020-10-20 08:04:03,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:03,309 INFO L87 Difference]: Start difference. First operand 11251 states and 18912 transitions. Second operand 3 states. [2020-10-20 08:04:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:03,403 INFO L93 Difference]: Finished difference Result 10015 states and 16787 transitions. [2020-10-20 08:04:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:03,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10015 states and 16787 transitions. [2020-10-20 08:04:03,860 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2584 [2020-10-20 08:04:03,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10015 states to 10015 states and 16787 transitions. [2020-10-20 08:04:03,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2899 [2020-10-20 08:04:03,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2899 [2020-10-20 08:04:03,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10015 states and 16787 transitions. [2020-10-20 08:04:03,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:03,907 INFO L691 BuchiCegarLoop]: Abstraction has 10015 states and 16787 transitions. [2020-10-20 08:04:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10015 states and 16787 transitions. [2020-10-20 08:04:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10015 to 9301. [2020-10-20 08:04:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9301 states. [2020-10-20 08:04:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9301 states to 9301 states and 15639 transitions. [2020-10-20 08:04:04,040 INFO L714 BuchiCegarLoop]: Abstraction has 9301 states and 15639 transitions. [2020-10-20 08:04:04,040 INFO L594 BuchiCegarLoop]: Abstraction has 9301 states and 15639 transitions. [2020-10-20 08:04:04,040 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:04:04,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9301 states and 15639 transitions. [2020-10-20 08:04:04,072 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2584 [2020-10-20 08:04:04,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:04,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:04,073 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,073 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,073 INFO L794 eck$LassoCheckResult]: Stem: 68784#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(10);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; 68585#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; 68586#L400 assume !(1 == ~c_req_up~0); 68655#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 68656#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 68692#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 68736#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 68754#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 68545#L431-1 assume !(0 == ~e_f~0); 68546#L436-1 assume !(0 == ~e_g~0); 68627#L441-1 assume !(0 == ~e_e~0); 68834#L446-1 assume !(0 == ~e_c~0); 68833#L451-1 assume !(0 == ~e_wl~0); 68831#L456-1 assume !(1 == ~wl_pc~0); 68826#L468 assume !(2 == ~wl_pc~0); 68824#L469 assume !(1 == ~c1_pc~0); 68821#L479 assume !(1 == ~c2_pc~0); 68818#L488 assume !(1 == ~wb_pc~0); 68591#L497 assume !(1 == ~e_c~0); 68592#L506-1 assume !(1 == ~e_e~0); 68845#L511-1 assume !(1 == ~e_f~0); 68844#L516-1 assume !(1 == ~e_g~0); 68680#L521-1 assume !(1 == ~e_c~0); 68681#L526-1 assume !(1 == ~e_wl~0); 69202#L668-1 assume !false; 69132#L538 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; 69133#L373 [2020-10-20 08:04:04,074 INFO L796 eck$LassoCheckResult]: Loop: 69133#L373 assume !false; 75237#L291 assume 0 == ~wl_st~0; 75232#L304-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 75231#L317 assume !(0 != eval_~tmp~0); 75227#L313 assume !(0 == ~c1_st~0); 75223#L328 assume !(0 == ~c2_st~0); 75250#L343 assume !(0 == ~wb_st~0); 75246#L358 assume !(0 == ~r_st~0); 69133#L373 [2020-10-20 08:04:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2020-10-20 08:04:04,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604870046] [2020-10-20 08:04:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,111 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1282692020, now seen corresponding path program 1 times [2020-10-20 08:04:04,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783369090] [2020-10-20 08:04:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,126 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash 363737516, now seen corresponding path program 1 times [2020-10-20 08:04:04,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923869811] [2020-10-20 08:04:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:04,180 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,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923869811] [2020-10-20 08:04:04,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:04,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:04,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701598182] [2020-10-20 08:04:04,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:04,316 INFO L87 Difference]: Start difference. First operand 9301 states and 15639 transitions. cyclomatic complexity: 6359 Second operand 3 states. [2020-10-20 08:04:04,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:04,416 INFO L93 Difference]: Finished difference Result 14826 states and 24682 transitions. [2020-10-20 08:04:04,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:04,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14826 states and 24682 transitions. [2020-10-20 08:04:04,487 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4004 [2020-10-20 08:04:04,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14826 states to 14826 states and 24682 transitions. [2020-10-20 08:04:04,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4615 [2020-10-20 08:04:04,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4615 [2020-10-20 08:04:04,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14826 states and 24682 transitions. [2020-10-20 08:04:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:04,559 INFO L691 BuchiCegarLoop]: Abstraction has 14826 states and 24682 transitions. [2020-10-20 08:04:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14826 states and 24682 transitions. [2020-10-20 08:04:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14826 to 14826. [2020-10-20 08:04:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14826 states. [2020-10-20 08:04:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14826 states to 14826 states and 24682 transitions. [2020-10-20 08:04:05,168 INFO L714 BuchiCegarLoop]: Abstraction has 14826 states and 24682 transitions. [2020-10-20 08:04:05,168 INFO L594 BuchiCegarLoop]: Abstraction has 14826 states and 24682 transitions. [2020-10-20 08:04:05,168 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:04:05,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14826 states and 24682 transitions. [2020-10-20 08:04:05,215 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4004 [2020-10-20 08:04:05,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:05,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:05,216 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:05,216 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:05,216 INFO L794 eck$LassoCheckResult]: Stem: 92930#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(10);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; 92720#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; 92721#L400 assume !(1 == ~c_req_up~0); 92793#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 92794#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 92834#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 92903#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 92904#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 92680#L431-1 assume !(0 == ~e_f~0); 92681#L436-1 assume !(0 == ~e_g~0); 92761#L441-1 assume !(0 == ~e_e~0); 92889#L446-1 assume !(0 == ~e_c~0); 92890#L451-1 assume !(0 == ~e_wl~0); 92983#L456-1 assume !(1 == ~wl_pc~0); 92978#L468 assume !(2 == ~wl_pc~0); 92976#L469 assume !(1 == ~c1_pc~0); 92972#L479 assume !(1 == ~c2_pc~0); 92969#L488 assume !(1 == ~wb_pc~0); 92727#L497 assume !(1 == ~e_c~0); 92728#L506-1 assume !(1 == ~e_e~0); 92992#L511-1 assume !(1 == ~e_f~0); 92991#L516-1 assume !(1 == ~e_g~0); 92818#L521-1 assume !(1 == ~e_c~0); 92819#L526-1 assume !(1 == ~e_wl~0); 92882#L668-1 assume !false; 93672#L538 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; 93673#L373 [2020-10-20 08:04:05,217 INFO L796 eck$LassoCheckResult]: Loop: 93673#L373 assume !false; 103306#L291 assume 0 == ~wl_st~0; 103305#L304-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 103304#L317 assume !(0 != eval_~tmp~0); 103303#L313 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 103294#L332 assume !(0 != eval_~tmp___0~0); 103302#L328 assume !(0 == ~c2_st~0); 103319#L343 assume !(0 == ~wb_st~0); 103316#L358 assume !(0 == ~r_st~0); 93673#L373 [2020-10-20 08:04:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2020-10-20 08:04:05,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:05,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624717129] [2020-10-20 08:04:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,314 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1057974720, now seen corresponding path program 1 times [2020-10-20 08:04:05,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:05,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813364348] [2020-10-20 08:04:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,323 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1659811128, now seen corresponding path program 1 times [2020-10-20 08:04:05,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:05,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10714554] [2020-10-20 08:04:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:05,378 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:05,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10714554] [2020-10-20 08:04:05,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:05,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:05,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401676858] [2020-10-20 08:04:05,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:05,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:05,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:05,415 INFO L87 Difference]: Start difference. First operand 14826 states and 24682 transitions. cyclomatic complexity: 9877 Second operand 3 states. [2020-10-20 08:04:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:05,573 INFO L93 Difference]: Finished difference Result 23728 states and 38921 transitions. [2020-10-20 08:04:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:05,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23728 states and 38921 transitions. [2020-10-20 08:04:05,827 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6280 [2020-10-20 08:04:05,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23728 states to 23728 states and 38921 transitions. [2020-10-20 08:04:05,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7458 [2020-10-20 08:04:05,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7458 [2020-10-20 08:04:05,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23728 states and 38921 transitions. [2020-10-20 08:04:05,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:05,928 INFO L691 BuchiCegarLoop]: Abstraction has 23728 states and 38921 transitions. [2020-10-20 08:04:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23728 states and 38921 transitions. [2020-10-20 08:04:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23728 to 23728. [2020-10-20 08:04:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23728 states. [2020-10-20 08:04:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23728 states to 23728 states and 38921 transitions. [2020-10-20 08:04:06,327 INFO L714 BuchiCegarLoop]: Abstraction has 23728 states and 38921 transitions. [2020-10-20 08:04:06,327 INFO L594 BuchiCegarLoop]: Abstraction has 23728 states and 38921 transitions. [2020-10-20 08:04:06,327 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:04:06,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23728 states and 38921 transitions. [2020-10-20 08:04:06,813 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6280 [2020-10-20 08:04:06,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:06,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:06,814 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:06,814 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:06,814 INFO L794 eck$LassoCheckResult]: Stem: 131519#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(10);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; 131282#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; 131283#L400 assume !(1 == ~c_req_up~0); 131397#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 131401#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 131402#L416-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 131582#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 136726#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 136725#L431-1 assume !(0 == ~e_f~0); 136724#L436-1 assume !(0 == ~e_g~0); 136723#L441-1 assume !(0 == ~e_e~0); 136722#L446-1 assume !(0 == ~e_c~0); 136721#L451-1 assume !(0 == ~e_wl~0); 136720#L456-1 assume !(1 == ~wl_pc~0); 131573#L468 assume !(2 == ~wl_pc~0); 131571#L469 assume !(1 == ~c1_pc~0); 131567#L479 assume !(1 == ~c2_pc~0); 131564#L488 assume !(1 == ~wb_pc~0); 131288#L497 assume !(1 == ~e_c~0); 131289#L506-1 assume !(1 == ~e_e~0); 131587#L511-1 assume !(1 == ~e_f~0); 131586#L516-1 assume !(1 == ~e_g~0); 131386#L521-1 assume !(1 == ~e_c~0); 131387#L526-1 assume !(1 == ~e_wl~0); 131459#L668-1 assume !false; 132258#L538 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; 132259#L373 [2020-10-20 08:04:06,814 INFO L796 eck$LassoCheckResult]: Loop: 132259#L373 assume !false; 151422#L291 assume 0 == ~wl_st~0; 151421#L304-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 151418#L317 assume !(0 != eval_~tmp~0); 145391#L313 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 145388#L332 assume !(0 != eval_~tmp___0~0); 145389#L328 assume !(0 == ~c2_st~0); 151433#L343 assume !(0 == ~wb_st~0); 151427#L358 assume !(0 == ~r_st~0); 132259#L373 [2020-10-20 08:04:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2020-10-20 08:04:06,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:06,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788019117] [2020-10-20 08:04:06,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:06,828 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:06,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788019117] [2020-10-20 08:04:06,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:06,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:06,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095922230] [2020-10-20 08:04:06,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1057974720, now seen corresponding path program 2 times [2020-10-20 08:04:06,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:06,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910110033] [2020-10-20 08:04:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:06,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:06,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:06,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:06,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:06,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:06,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:06,866 INFO L87 Difference]: Start difference. First operand 23728 states and 38921 transitions. cyclomatic complexity: 15214 Second operand 3 states. [2020-10-20 08:04:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:06,935 INFO L93 Difference]: Finished difference Result 23657 states and 38802 transitions. [2020-10-20 08:04:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:06,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23657 states and 38802 transitions. [2020-10-20 08:04:07,071 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6280 [2020-10-20 08:04:07,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23657 states to 23657 states and 38802 transitions. [2020-10-20 08:04:07,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7391 [2020-10-20 08:04:07,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7391 [2020-10-20 08:04:07,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23657 states and 38802 transitions. [2020-10-20 08:04:07,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:07,173 INFO L691 BuchiCegarLoop]: Abstraction has 23657 states and 38802 transitions. [2020-10-20 08:04:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states and 38802 transitions. [2020-10-20 08:04:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 23657. [2020-10-20 08:04:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23657 states. [2020-10-20 08:04:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23657 states to 23657 states and 38802 transitions. [2020-10-20 08:04:07,696 INFO L714 BuchiCegarLoop]: Abstraction has 23657 states and 38802 transitions. [2020-10-20 08:04:07,696 INFO L594 BuchiCegarLoop]: Abstraction has 23657 states and 38802 transitions. [2020-10-20 08:04:07,696 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 08:04:07,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23657 states and 38802 transitions. [2020-10-20 08:04:07,770 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 6280 [2020-10-20 08:04:07,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:07,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:07,776 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:07,776 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:07,776 INFO L794 eck$LassoCheckResult]: Stem: 178891#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(10);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; 178673#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; 178674#L400 assume !(1 == ~c_req_up~0); 178754#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 178755#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 178789#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 178847#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 178865#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 178633#L431-1 assume !(0 == ~e_f~0); 178634#L436-1 assume !(0 == ~e_g~0); 178719#L441-1 assume !(0 == ~e_e~0); 178939#L446-1 assume !(0 == ~e_c~0); 178938#L451-1 assume !(0 == ~e_wl~0); 178936#L456-1 assume !(1 == ~wl_pc~0); 178931#L468 assume !(2 == ~wl_pc~0); 178929#L469 assume !(1 == ~c1_pc~0); 178926#L479 assume !(1 == ~c2_pc~0); 178923#L488 assume !(1 == ~wb_pc~0); 178679#L497 assume !(1 == ~e_c~0); 178680#L506-1 assume !(1 == ~e_e~0); 178950#L511-1 assume !(1 == ~e_f~0); 178949#L516-1 assume !(1 == ~e_g~0); 178777#L521-1 assume !(1 == ~e_c~0); 178778#L526-1 assume !(1 == ~e_wl~0); 182464#L668-1 assume !false; 179645#L538 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; 179646#L373 [2020-10-20 08:04:07,776 INFO L796 eck$LassoCheckResult]: Loop: 179646#L373 assume !false; 192302#L291 assume 0 == ~wl_st~0; 192299#L304-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 192297#L317 assume !(0 != eval_~tmp~0); 192298#L313 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 192407#L332 assume !(0 != eval_~tmp___0~0); 192515#L328 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 192506#L347 assume !(0 != eval_~tmp___1~0); 192313#L343 assume !(0 == ~wb_st~0); 192309#L358 assume !(0 == ~r_st~0); 179646#L373 [2020-10-20 08:04:07,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2020-10-20 08:04:07,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:07,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640294334] [2020-10-20 08:04:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:07,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:07,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:07,817 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1564142017, now seen corresponding path program 1 times [2020-10-20 08:04:07,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:07,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725240506] [2020-10-20 08:04:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:07,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:07,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:07,825 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash 83842615, now seen corresponding path program 1 times [2020-10-20 08:04:07,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:07,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599480629] [2020-10-20 08:04:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:07,946 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:07,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599480629] [2020-10-20 08:04:07,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:07,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:07,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36172169] [2020-10-20 08:04:07,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:07,989 INFO L87 Difference]: Start difference. First operand 23657 states and 38802 transitions. cyclomatic complexity: 15166 Second operand 3 states. [2020-10-20 08:04:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:08,120 INFO L93 Difference]: Finished difference Result 39861 states and 64279 transitions. [2020-10-20 08:04:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:08,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39861 states and 64279 transitions. [2020-10-20 08:04:08,392 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10688 [2020-10-20 08:04:08,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39861 states to 39861 states and 64279 transitions. [2020-10-20 08:04:08,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12447 [2020-10-20 08:04:08,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12447 [2020-10-20 08:04:08,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39861 states and 64279 transitions. [2020-10-20 08:04:08,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:08,531 INFO L691 BuchiCegarLoop]: Abstraction has 39861 states and 64279 transitions. [2020-10-20 08:04:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39861 states and 64279 transitions. [2020-10-20 08:04:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39861 to 39861. [2020-10-20 08:04:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39861 states. [2020-10-20 08:04:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39861 states to 39861 states and 64279 transitions. [2020-10-20 08:04:10,562 INFO L714 BuchiCegarLoop]: Abstraction has 39861 states and 64279 transitions. [2020-10-20 08:04:10,563 INFO L594 BuchiCegarLoop]: Abstraction has 39861 states and 64279 transitions. [2020-10-20 08:04:10,563 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 08:04:10,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39861 states and 64279 transitions. [2020-10-20 08:04:10,656 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10688 [2020-10-20 08:04:10,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:10,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:10,657 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:10,658 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:10,658 INFO L794 eck$LassoCheckResult]: Stem: 242436#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(10);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; 242195#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; 242196#L400 assume !(1 == ~c_req_up~0); 242275#L400-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 242276#L411-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 242320#L416-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 242401#L421-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 242402#L426-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 242157#L431-1 assume !(0 == ~e_f~0); 242158#L436-1 assume !(0 == ~e_g~0); 242241#L441-1 assume !(0 == ~e_e~0); 242383#L446-1 assume !(0 == ~e_c~0); 242384#L451-1 assume !(0 == ~e_wl~0); 242498#L456-1 assume !(1 == ~wl_pc~0); 242493#L468 assume !(2 == ~wl_pc~0); 242491#L469 assume !(1 == ~c1_pc~0); 242487#L479 assume !(1 == ~c2_pc~0); 242484#L488 assume !(1 == ~wb_pc~0); 242201#L497 assume !(1 == ~e_c~0); 242202#L506-1 assume !(1 == ~e_e~0); 242507#L511-1 assume !(1 == ~e_f~0); 242506#L516-1 assume !(1 == ~e_g~0); 242302#L521-1 assume !(1 == ~e_c~0); 242303#L526-1 assume !(1 == ~e_wl~0); 242375#L668-1 assume !false; 244932#L538 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; 244933#L373 [2020-10-20 08:04:10,658 INFO L796 eck$LassoCheckResult]: Loop: 244933#L373 assume !false; 267372#L291 assume 0 == ~wl_st~0; 267369#L304-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 267168#L317 assume !(0 != eval_~tmp~0); 267131#L313 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 267129#L332 assume !(0 != eval_~tmp___0~0); 266854#L328 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 266851#L347 assume !(0 != eval_~tmp___1~0); 266848#L343 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 266834#L362 assume !(0 != eval_~tmp___2~0); 266847#L358 assume !(0 == ~r_st~0); 244933#L373 [2020-10-20 08:04:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2020-10-20 08:04:10,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:10,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927303114] [2020-10-20 08:04:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:10,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:10,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:10,676 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1243796683, now seen corresponding path program 1 times [2020-10-20 08:04:10,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:10,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717557492] [2020-10-20 08:04:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:10,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:10,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:10,683 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1695880643, now seen corresponding path program 1 times [2020-10-20 08:04:10,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:10,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484103961] [2020-10-20 08:04:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:10,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:10,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:10,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:10,875 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-20 08:04:12,180 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 200 DAG size of output: 157 [2020-10-20 08:04:12,390 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-20 08:04:12,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:04:12 BoogieIcfgContainer [2020-10-20 08:04:12,425 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:04:12,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:04:12,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:04:12,426 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:04:12,426 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:51" (3/4) ... [2020-10-20 08:04:12,429 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:04:12,484 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:04:12,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:04:12,486 INFO L168 Benchmark]: Toolchain (without parser) took 22408.75 ms. Allocated memory was 39.8 MB in the beginning and 375.9 MB in the end (delta: 336.1 MB). Free memory was 14.3 MB in the beginning and 252.8 MB in the end (delta: -238.6 MB). Peak memory consumption was 97.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,487 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 39.3 MB. Free memory was 18.4 MB in the beginning and 18.3 MB in the end (delta: 50.4 kB). Peak memory consumption was 50.4 kB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.75 ms. Allocated memory was 39.8 MB in the beginning and 45.6 MB in the end (delta: 5.8 MB). Free memory was 13.4 MB in the beginning and 25.0 MB in the end (delta: -11.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 45.6 MB. Free memory was 25.0 MB in the beginning and 22.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,488 INFO L168 Benchmark]: Boogie Preprocessor took 40.89 ms. Allocated memory is still 45.6 MB. Free memory was 22.3 MB in the beginning and 20.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,488 INFO L168 Benchmark]: RCFGBuilder took 701.27 ms. Allocated memory was 45.6 MB in the beginning and 49.8 MB in the end (delta: 4.2 MB). Free memory was 20.1 MB in the beginning and 32.3 MB in the end (delta: -12.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,489 INFO L168 Benchmark]: BuchiAutomizer took 21058.57 ms. Allocated memory was 49.8 MB in the beginning and 375.9 MB in the end (delta: 326.1 MB). Free memory was 32.3 MB in the beginning and 258.8 MB in the end (delta: -226.4 MB). Peak memory consumption was 356.1 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,490 INFO L168 Benchmark]: Witness Printer took 59.11 ms. Allocated memory is still 375.9 MB. Free memory was 256.8 MB in the beginning and 252.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:12,492 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.29 ms. Allocated memory is still 39.3 MB. Free memory was 18.4 MB in the beginning and 18.3 MB in the end (delta: 50.4 kB). Peak memory consumption was 50.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 478.75 ms. Allocated memory was 39.8 MB in the beginning and 45.6 MB in the end (delta: 5.8 MB). Free memory was 13.4 MB in the beginning and 25.0 MB in the end (delta: -11.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 45.6 MB. Free memory was 25.0 MB in the beginning and 22.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 40.89 ms. Allocated memory is still 45.6 MB. Free memory was 22.3 MB in the beginning and 20.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 701.27 ms. Allocated memory was 45.6 MB in the beginning and 49.8 MB in the end (delta: 4.2 MB). Free memory was 20.1 MB in the beginning and 32.3 MB in the end (delta: -12.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 21058.57 ms. Allocated memory was 49.8 MB in the beginning and 375.9 MB in the end (delta: 326.1 MB). Free memory was 32.3 MB in the beginning and 258.8 MB in the end (delta: -226.4 MB). Peak memory consumption was 356.1 MB. Max. memory is 14.3 GB. * Witness Printer took 59.11 ms. Allocated memory is still 375.9 MB. Free memory was 256.8 MB in the beginning and 252.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 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 21 terminating modules (16 trivial, 5 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 * e_c + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * e_f + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_wl + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_g + 1 and consists of 3 locations. 16 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 39861 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.9s and 17 iterations. TraceHistogramMax:1. Analysis of lassos took 10.5s. Construction of modules took 0.7s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 16. Automata minimization 4.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 3137 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 2.1s Buchi closure took 0.0s. Biggest automaton had 39861 states and ocurred in iteration 16. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5367 SDtfs, 5113 SDslu, 3633 SDs, 0 SdLazy, 444 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI5 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq183 hnf97 smp100 dnf186 smp77 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 290]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {wb_st=0, NULL=0, NULL=1, 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@6a754ca9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d0c68cd=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=3, 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=4, wl_i=1, NULL=0, c1_st=0, NULL=2, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69a3bd32=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e7b57bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37301fdd=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 290]: 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 ; [L685] int __retres1 ; [L689] e_wl = 2 [L690] e_c = e_wl [L691] e_g = e_c [L692] e_f = e_g [L693] e_e = e_f [L694] wl_pc = 0 [L695] c1_pc = 0 [L696] c2_pc = 0 [L697] wb_pc = 0 [L698] wb_i = 1 [L699] c2_i = wb_i [L700] c1_i = c2_i [L701] wl_i = c1_i [L702] r_i = 0 [L703] c_req_up = 0 [L704] d = 0 [L705] c = 0 [L396] int kernel_st ; [L399] kernel_st = 0 [L400] COND FALSE !((int )c_req_up == 1) [L411] COND TRUE (int )wl_i == 1 [L412] wl_st = 0 [L416] COND TRUE (int )c1_i == 1 [L417] c1_st = 0 [L421] COND TRUE (int )c2_i == 1 [L422] c2_st = 0 [L426] COND TRUE (int )wb_i == 1 [L427] wb_st = 0 [L431] COND FALSE !((int )r_i == 1) [L434] r_st = 2 [L436] COND FALSE !((int )e_f == 0) [L441] COND FALSE !((int )e_g == 0) [L446] COND FALSE !((int )e_e == 0) [L451] COND FALSE !((int )e_c == 0) [L456] COND FALSE !((int )e_wl == 0) [L461] COND FALSE !((int )wl_pc == 1) [L469] COND FALSE !((int )wl_pc == 2) [L479] COND FALSE !((int )c1_pc == 1) [L488] COND FALSE !((int )c2_pc == 1) [L497] COND FALSE !((int )wb_pc == 1) [L506] COND FALSE !((int )e_c == 1) [L511] COND FALSE !((int )e_e == 1) [L516] COND FALSE !((int )e_f == 1) [L521] COND FALSE !((int )e_g == 1) [L526] COND FALSE !((int )e_c == 1) [L531] COND FALSE !((int )e_wl == 1) [L537] COND TRUE 1 [L540] kernel_st = 1 [L282] int tmp ; [L283] int tmp___0 ; [L284] int tmp___1 ; [L285] int tmp___2 ; [L286] int tmp___3 ; Loop: [L290] COND TRUE 1 [L292] COND TRUE (int )wl_st == 0 [L313] COND TRUE (int )wl_st == 0 [L315] tmp = __VERIFIER_nondet_int() [L317] COND FALSE !(\read(tmp)) [L328] COND TRUE (int )c1_st == 0 [L330] tmp___0 = __VERIFIER_nondet_int() [L332] COND FALSE !(\read(tmp___0)) [L343] COND TRUE (int )c2_st == 0 [L345] tmp___1 = __VERIFIER_nondet_int() [L347] COND FALSE !(\read(tmp___1)) [L358] COND TRUE (int )wb_st == 0 [L360] tmp___2 = __VERIFIER_nondet_int() [L362] COND FALSE !(\read(tmp___2)) [L373] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...