./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pipeline.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/pipeline.cil-1.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 --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 79bbe68806c3ba3852cd8c209d4ce80dca551636a131cc65daaf97524d927c63 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:51:52,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:51:52,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:51:52,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:51:52,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:51:52,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:51:52,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:51:52,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:51:52,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:51:52,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:51:52,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:51:52,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:51:52,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:51:52,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:51:52,508 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:51:52,508 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:51:52,508 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:51:52,508 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:51:52,509 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:51:52,509 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:51:52,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:51:52,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:51:52,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:51:52,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:51:52,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:51:52,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:51:52,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:51:52,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:51:52,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:51:52,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:51:52,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:51:52,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:51:52,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:51:52,515 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:51:52,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:51:52,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:51:52,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:51:52,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:51:52,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:51:52,517 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:51:52,517 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 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 -> 79bbe68806c3ba3852cd8c209d4ce80dca551636a131cc65daaf97524d927c63 [2024-11-17 08:51:52,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:51:52,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:51:52,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:51:52,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:51:52,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:51:52,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pipeline.cil-1.c [2024-11-17 08:51:54,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:51:54,273 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:51:54,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pipeline.cil-1.c [2024-11-17 08:51:54,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66dd7100f/13c7246ac0e34a17a4844fa9de7f78cc/FLAG20685bd90 [2024-11-17 08:51:54,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66dd7100f/13c7246ac0e34a17a4844fa9de7f78cc [2024-11-17 08:51:54,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:51:54,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:51:54,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:51:54,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:51:54,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:51:54,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e35d715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54, skipping insertion in model container [2024-11-17 08:51:54,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:51:54,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:51:54,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:51:54,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:51:54,624 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:51:54,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54 WrapperNode [2024-11-17 08:51:54,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:51:54,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:51:54,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:51:54,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:51:54,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,668 INFO L138 Inliner]: procedures = 20, calls = 18, calls flagged for inlining = 13, calls inlined = 25, statements flattened = 1045 [2024-11-17 08:51:54,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:51:54,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:51:54,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:51:54,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:51:54,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,704 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 08:51:54,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:51:54,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:51:54,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:51:54,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:51:54,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (1/1) ... [2024-11-17 08:51:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:51:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:51:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:51:54,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:51:54,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:51:54,883 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:51:54,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:51:55,610 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-17 08:51:55,611 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:51:55,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:51:55,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:51:55,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:55 BoogieIcfgContainer [2024-11-17 08:51:55,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:51:55,673 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:51:55,673 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:51:55,676 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:51:55,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:55,677 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:51:54" (1/3) ... [2024-11-17 08:51:55,678 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f13baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:51:55, skipping insertion in model container [2024-11-17 08:51:55,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:55,678 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:54" (2/3) ... [2024-11-17 08:51:55,678 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f13baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:51:55, skipping insertion in model container [2024-11-17 08:51:55,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:55,678 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:55" (3/3) ... [2024-11-17 08:51:55,679 INFO L332 chiAutomizerObserver]: Analyzing ICFG pipeline.cil-1.c [2024-11-17 08:51:55,725 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:51:55,725 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:51:55,725 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:51:55,725 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:51:55,725 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:51:55,726 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:51:55,726 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:51:55,726 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:51:55,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 439 states, 438 states have (on average 1.7831050228310503) internal successors, (781), 438 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:55,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 376 [2024-11-17 08:51:55,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:55,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:55,782 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:55,784 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:55,784 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:51:55,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 439 states, 438 states have (on average 1.7831050228310503) internal successors, (781), 438 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:55,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 376 [2024-11-17 08:51:55,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:55,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:55,797 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:55,799 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:55,805 INFO L745 eck$LassoCheckResult]: Stem: 430#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 28#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 10#L256-2true assume !(1 == ~main_in1_req_up~0); 411#L267-2true assume !(1 == ~main_in2_req_up~0); 347#L278-2true assume !(1 == ~main_sum_req_up~0); 356#L289-2true assume !(1 == ~main_diff_req_up~0); 324#L300-2true assume !(1 == ~main_pres_req_up~0); 320#L311-2true assume !(1 == ~main_dbl_req_up~0); 159#L322-2true assume !(1 == ~main_zero_req_up~0); 161#L333-2true assume !(1 == ~main_clk_req_up~0); 215#L351-2true assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 305#L356-2true assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 188#L361-2true assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 71#L366-2true assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 376#L371-2true assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 350#L376-2true assume !(0 == ~main_in1_ev~0); 62#L381-2true assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 407#L386-2true assume !(0 == ~main_sum_ev~0); 3#L391-2true assume !(0 == ~main_diff_ev~0); 368#L396-2true assume !(0 == ~main_pres_ev~0); 314#L401-2true assume !(0 == ~main_dbl_ev~0); 289#L406-2true assume !(0 == ~main_zero_ev~0); 123#L411-2true assume !(0 == ~main_clk_ev~0); 326#L416-2true assume !(0 == ~main_clk_pos_edge~0); 308#L421-2true assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 250#L426-2true assume !(1 == ~main_clk_pos_edge~0); 399#L431-2true assume !(1 == ~main_clk_pos_edge~0); 49#L436-2true assume !(1 == ~main_clk_pos_edge~0); 316#L441-2true assume !(1 == ~main_clk_pos_edge~0); 282#L446-2true assume !(1 == ~main_clk_pos_edge~0); 182#L451-2true assume !(1 == ~main_in1_ev~0); 379#L456-2true assume !(1 == ~main_in2_ev~0); 241#L461-2true assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 302#L466-2true assume !(1 == ~main_diff_ev~0); 348#L471-2true assume !(1 == ~main_pres_ev~0); 383#L476-2true assume !(1 == ~main_dbl_ev~0); 191#L481-2true assume !(1 == ~main_zero_ev~0); 331#L486-2true assume !(1 == ~main_clk_ev~0); 205#L491-2true assume !(1 == ~main_clk_pos_edge~0); 313#L496-2true assume !(1 == ~main_clk_neg_edge~0); 79#L502-4true [2024-11-17 08:51:55,806 INFO L747 eck$LassoCheckResult]: Loop: 79#L502-4true assume true; 345#L502-5true assume !false; 194#start_simulation_while_1_continue#1true assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 196#L146-4true assume !true; 270#L163-2true assume true; 125#L248-2true assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 173#L509-2true assume !(1 == ~main_in1_req_up~0); 403#L520-2true assume !(1 == ~main_in2_req_up~0); 83#L531-2true assume !(1 == ~main_sum_req_up~0); 167#L542-2true assume !(1 == ~main_diff_req_up~0); 163#L553-2true assume !(1 == ~main_pres_req_up~0); 113#L564-2true assume !(1 == ~main_dbl_req_up~0); 11#L575-2true assume !(1 == ~main_zero_req_up~0); 98#L586-2true assume !(1 == ~main_clk_req_up~0); 395#L604-2true start_simulation_~kernel_st~0#1 := 3; 295#L605-2true assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; 148#L610-2true assume 0 == ~main_in2_ev~0;~main_in2_ev~0 := 1; 227#L615-2true assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 372#L620-2true assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 101#L625-2true assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 42#L630-2true assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 46#L635-2true assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 251#L640-2true assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 146#L645-2true assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; 59#L650-2true assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 75#L655-2true assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 109#L660-2true assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 36#L665-2true assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 221#L670-2true assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 237#L675-2true assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 436#L680-2true assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 440#L685-2true assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 239#L690-2true assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 133#L695-2true assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 183#L700-2true assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 90#L705-2true assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 325#L710-2true assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 349#L715-2true assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 428#L720-2true assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 17#L725-2true assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 380#L730-2true assume 0 == ~N_generate_st~0; 79#L502-4true [2024-11-17 08:51:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1688945, now seen corresponding path program 1 times [2024-11-17 08:51:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441911528] [2024-11-17 08:51:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:56,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:56,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441911528] [2024-11-17 08:51:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441911528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:56,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:51:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713784954] [2024-11-17 08:51:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:56,126 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:51:56,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1794562173, now seen corresponding path program 1 times [2024-11-17 08:51:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985084874] [2024-11-17 08:51:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:56,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985084874] [2024-11-17 08:51:56,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985084874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:51:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137712616] [2024-11-17 08:51:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:56,154 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:56,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:51:56,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:51:56,183 INFO L87 Difference]: Start difference. First operand has 439 states, 438 states have (on average 1.7831050228310503) internal successors, (781), 438 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:56,457 INFO L93 Difference]: Finished difference Result 1012 states and 1753 transitions. [2024-11-17 08:51:56,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1012 states and 1753 transitions. [2024-11-17 08:51:56,466 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 869 [2024-11-17 08:51:56,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1012 states to 1010 states and 1751 transitions. [2024-11-17 08:51:56,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1010 [2024-11-17 08:51:56,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1010 [2024-11-17 08:51:56,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1010 states and 1751 transitions. [2024-11-17 08:51:56,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:56,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1010 states and 1751 transitions. [2024-11-17 08:51:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states and 1751 transitions. [2024-11-17 08:51:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2024-11-17 08:51:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1010 states have (on average 1.7336633663366336) internal successors, (1751), 1009 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1751 transitions. [2024-11-17 08:51:56,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1010 states and 1751 transitions. [2024-11-17 08:51:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:51:56,556 INFO L425 stractBuchiCegarLoop]: Abstraction has 1010 states and 1751 transitions. [2024-11-17 08:51:56,556 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:51:56,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1010 states and 1751 transitions. [2024-11-17 08:51:56,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 869 [2024-11-17 08:51:56,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:56,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:56,567 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:56,567 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:56,567 INFO L745 eck$LassoCheckResult]: Stem: 1957#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 1525#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1483#L256-2 assume !(1 == ~main_in1_req_up~0); 1485#L267-2 assume !(1 == ~main_in2_req_up~0); 1917#L278-2 assume !(1 == ~main_sum_req_up~0); 1507#L289-2 assume !(1 == ~main_diff_req_up~0); 1842#L300-2 assume !(1 == ~main_pres_req_up~0); 1820#L311-2 assume !(1 == ~main_dbl_req_up~0); 1646#L322-2 assume !(1 == ~main_zero_req_up~0); 1752#L333-2 assume !(1 == ~main_clk_req_up~0); 1582#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 1807#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 1783#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 1615#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 1616#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 1921#L376-2 assume !(0 == ~main_in1_ev~0); 1596#L381-2 assume !(0 == ~main_in2_ev~0); 1597#L386-2 assume !(0 == ~main_sum_ev~0); 1466#L391-2 assume !(0 == ~main_diff_ev~0); 1467#L396-2 assume !(0 == ~main_pres_ev~0); 1898#L401-2 assume !(0 == ~main_dbl_ev~0); 1883#L406-2 assume !(0 == ~main_zero_ev~0); 1696#L411-2 assume !(0 == ~main_clk_ev~0); 1697#L416-2 assume !(0 == ~main_clk_pos_edge~0); 1895#L421-2 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 1839#L426-2 assume !(1 == ~main_clk_pos_edge~0); 1840#L431-2 assume !(1 == ~main_clk_pos_edge~0); 1569#L436-2 assume !(1 == ~main_clk_pos_edge~0); 1570#L441-2 assume !(1 == ~main_clk_pos_edge~0); 1878#L446-2 assume !(1 == ~main_clk_pos_edge~0); 1776#L451-2 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 1777#L456-2 assume !(1 == ~main_in2_ev~0); 1938#L461-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 1890#L466-2 assume !(1 == ~main_diff_ev~0); 1891#L471-2 assume !(1 == ~main_pres_ev~0); 1918#L476-2 assume !(1 == ~main_dbl_ev~0); 1785#L481-2 assume !(1 == ~main_zero_ev~0); 1786#L486-2 assume !(1 == ~main_clk_ev~0); 2235#L491-2 assume !(1 == ~main_clk_pos_edge~0); 2233#L496-2 assume !(1 == ~main_clk_neg_edge~0); 1667#L502-4 [2024-11-17 08:51:56,567 INFO L747 eck$LassoCheckResult]: Loop: 1667#L502-4 assume true; 2230#L502-5 assume !false; 2227#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2222#L146-4 assume true; 2221#L146-5 assume !false; 2218#eval_while_0_continue#1 assume true; 2217#L148-2 assume !(0 == ~N_generate_st~0); 2216#L151-2 assume !(0 == ~S1_addsub_st~0); 2215#L154-2 assume !(0 == ~S2_presdbl_st~0); 2214#L157-2 assume !(0 == ~S3_zero_st~0); 2212#L160-2 assume !(0 == ~D_print_st~0); 2211#L163-2 assume true; 2210#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2208#L509-2 assume !(1 == ~main_in1_req_up~0); 2206#L520-2 assume !(1 == ~main_in2_req_up~0); 2202#L531-2 assume !(1 == ~main_sum_req_up~0); 2200#L542-2 assume !(1 == ~main_diff_req_up~0); 2184#L553-2 assume !(1 == ~main_pres_req_up~0); 2174#L564-2 assume !(1 == ~main_dbl_req_up~0); 2168#L575-2 assume !(1 == ~main_zero_req_up~0); 2160#L586-2 assume !(1 == ~main_clk_req_up~0); 2158#L604-2 start_simulation_~kernel_st~0#1 := 3; 2136#L605-2 assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; 2131#L610-2 assume !(0 == ~main_in2_ev~0); 2129#L615-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 1935#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 1662#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 1663#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 2116#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 2109#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 1733#L645-2 assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; 1589#L650-2 assume 0 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 1; 1590#L655-2 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 1622#L660-2 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 1542#L665-2 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 1543#L670-2 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 1810#L675-2 assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 1828#L680-2 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 1959#L685-2 assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 1829#L690-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 1709#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 1710#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 1647#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 1648#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 1919#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 1920#L720-2 assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 1501#L725-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 1502#L730-2 assume 0 == ~N_generate_st~0; 1667#L502-4 [2024-11-17 08:51:56,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash 131195697, now seen corresponding path program 1 times [2024-11-17 08:51:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453174391] [2024-11-17 08:51:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:56,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453174391] [2024-11-17 08:51:56,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453174391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:56,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:51:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145043163] [2024-11-17 08:51:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:56,661 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:51:56,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 638741383, now seen corresponding path program 1 times [2024-11-17 08:51:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683635343] [2024-11-17 08:51:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:56,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:56,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:57,270 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:51:57,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:51:57,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:51:57,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:51:57,271 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:51:57,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:57,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:51:57,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:51:57,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: pipeline.cil-1.c_Iteration2_Loop [2024-11-17 08:51:57,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:51:57,271 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:51:57,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,655 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:51:57,655 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:51:57,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:57,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:57,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:57,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:51:57,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:51:57,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:51:57,680 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:51:57,680 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:51:57,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:57,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:57,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:57,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:51:57,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:51:57,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:51:57,722 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:51:57,722 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:51:57,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:57,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:57,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:57,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:57,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:51:57,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:51:57,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:51:57,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:57,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:57,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:51:57,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:51:57,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:51:57,803 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:51:57,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:57,820 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:51:57,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:51:57,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:51:57,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:51:57,821 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:51:57,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:57,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:51:57,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:51:57,821 INFO L132 ssoRankerPreferences]: Filename of dumped script: pipeline.cil-1.c_Iteration2_Loop [2024-11-17 08:51:57,821 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:51:57,821 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:51:57,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:57,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:58,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:58,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:58,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:58,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:58,289 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:51:58,297 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:51:58,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:58,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:58,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:51:58,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:58,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:58,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:58,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:58,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:58,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:58,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:58,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:58,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:58,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:51:58,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:58,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:58,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:51:58,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:58,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:58,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:58,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:58,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:58,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:58,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:58,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:58,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:58,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:58,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:58,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:58,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:58,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:51:58,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:58,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:58,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:58,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:58,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:58,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:58,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:58,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:58,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:51:58,423 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:51:58,423 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:51:58,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:58,426 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:58,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:51:58,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:51:58,429 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:51:58,429 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:51:58,429 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~main_dbl_ev~0) = -1*~main_dbl_ev~0 + 1 Supporting invariants [] [2024-11-17 08:51:58,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:58,446 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:51:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:58,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:51:58,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:58,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:51:58,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:58,802 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:51:58,803 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1010 states and 1751 transitions. cyclomatic complexity: 745 Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:58,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1010 states and 1751 transitions. cyclomatic complexity: 745. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3673 states and 6357 transitions. Complement of second has 5 states. [2024-11-17 08:51:58,960 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 [2024-11-17 08:51:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-11-17 08:51:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1432 transitions. Stem has 40 letters. Loop has 48 letters. [2024-11-17 08:51:58,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:51:58,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1432 transitions. Stem has 88 letters. Loop has 48 letters. [2024-11-17 08:51:58,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:51:58,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1432 transitions. Stem has 40 letters. Loop has 96 letters. [2024-11-17 08:51:58,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:51:58,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3673 states and 6357 transitions. [2024-11-17 08:51:58,992 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2607 [2024-11-17 08:51:59,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3673 states to 3673 states and 6357 transitions. [2024-11-17 08:51:59,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2758 [2024-11-17 08:51:59,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2780 [2024-11-17 08:51:59,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3673 states and 6357 transitions. [2024-11-17 08:51:59,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:51:59,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3673 states and 6357 transitions. [2024-11-17 08:51:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states and 6357 transitions. [2024-11-17 08:51:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 2778. [2024-11-17 08:51:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2778 states, 2778 states have (on average 1.7314614830813535) internal successors, (4810), 2777 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4810 transitions. [2024-11-17 08:51:59,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2778 states and 4810 transitions. [2024-11-17 08:51:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:51:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:51:59,062 INFO L87 Difference]: Start difference. First operand 2778 states and 4810 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:59,233 INFO L93 Difference]: Finished difference Result 6042 states and 10402 transitions. [2024-11-17 08:51:59,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6042 states and 10402 transitions. [2024-11-17 08:51:59,260 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3774 [2024-11-17 08:51:59,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6042 states to 6042 states and 10402 transitions. [2024-11-17 08:51:59,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4082 [2024-11-17 08:51:59,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4082 [2024-11-17 08:51:59,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6042 states and 10402 transitions. [2024-11-17 08:51:59,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:51:59,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6042 states and 10402 transitions. [2024-11-17 08:51:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states and 10402 transitions. [2024-11-17 08:51:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 5996. [2024-11-17 08:51:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5996 states, 5996 states have (on average 1.719479653102068) internal successors, (10310), 5995 states have internal predecessors, (10310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:51:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 10310 transitions. [2024-11-17 08:51:59,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5996 states and 10310 transitions. [2024-11-17 08:51:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:51:59,437 INFO L425 stractBuchiCegarLoop]: Abstraction has 5996 states and 10310 transitions. [2024-11-17 08:51:59,437 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:51:59,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5996 states and 10310 transitions. [2024-11-17 08:51:59,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:51:59,455 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 3774 [2024-11-17 08:51:59,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:59,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:59,456 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:59,457 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:59,458 INFO L745 eck$LassoCheckResult]: Stem: 16302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 15368#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 15290#L256-2 assume !(1 == ~main_in1_req_up~0); 15292#L267-2 assume !(1 == ~main_in2_req_up~0); 16281#L278-2 assume !(1 == ~main_sum_req_up~0); 16546#L289-2 assume !(1 == ~main_diff_req_up~0); 16542#L300-2 assume !(1 == ~main_pres_req_up~0); 16540#L311-2 assume !(1 == ~main_dbl_req_up~0); 16537#L322-2 assume !(1 == ~main_zero_req_up~0); 16535#L333-2 assume !(1 == ~main_clk_req_up~0); 15486#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 15970#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 15913#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 15547#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 15548#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 16211#L376-2 assume !(0 == ~main_in1_ev~0); 15511#L381-2 assume !(0 == ~main_in2_ev~0); 15512#L386-2 assume !(0 == ~main_sum_ev~0); 15259#L391-2 assume !(0 == ~main_diff_ev~0); 15260#L396-2 assume !(0 == ~main_pres_ev~0); 16155#L401-2 assume !(0 == ~main_dbl_ev~0); 16122#L406-2 assume !(0 == ~main_zero_ev~0); 15723#L411-2 assume !(0 == ~main_clk_ev~0); 15724#L416-2 assume !(0 == ~main_clk_pos_edge~0); 16145#L421-2 assume !(0 == ~main_clk_neg_edge~0); 16040#L426-2 assume !(1 == ~main_clk_pos_edge~0); 16041#L431-2 assume !(1 == ~main_clk_pos_edge~0); 15462#L436-2 assume !(1 == ~main_clk_pos_edge~0); 15463#L441-2 assume !(1 == ~main_clk_pos_edge~0); 16108#L446-2 assume !(1 == ~main_clk_pos_edge~0); 15901#L451-2 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 15902#L456-2 assume !(1 == ~main_in2_ev~0); 17834#L461-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 17833#L466-2 assume !(1 == ~main_diff_ev~0); 17832#L471-2 assume !(1 == ~main_pres_ev~0); 16455#L476-2 assume !(1 == ~main_dbl_ev~0); 16452#L481-2 assume !(1 == ~main_zero_ev~0); 16453#L486-2 assume !(1 == ~main_clk_ev~0); 16446#L491-2 assume !(1 == ~main_clk_pos_edge~0); 16447#L496-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 15506#L502-4 [2024-11-17 08:51:59,458 INFO L747 eck$LassoCheckResult]: Loop: 15506#L502-4 assume true; 15574#L502-5 assume !false; 15924#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 15925#L146-4 assume true; 15928#L146-5 assume !false; 15929#eval_while_0_continue#1 assume true; 15958#L148-2 assume !(0 == ~N_generate_st~0); 15712#L151-2 assume !(0 == ~S1_addsub_st~0); 15663#L154-2 assume !(0 == ~S2_presdbl_st~0); 15665#L157-2 assume !(0 == ~S3_zero_st~0); 16081#L160-2 assume !(0 == ~D_print_st~0); 16083#L163-2 assume true; 15730#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 15731#L509-2 assume !(1 == ~main_in1_req_up~0); 15721#L520-2 assume !(1 == ~main_in2_req_up~0); 15587#L531-2 assume !(1 == ~main_sum_req_up~0); 15588#L542-2 assume !(1 == ~main_diff_req_up~0); 15718#L553-2 assume !(1 == ~main_pres_req_up~0); 15694#L564-2 assume !(1 == ~main_dbl_req_up~0); 15293#L575-2 assume !(1 == ~main_zero_req_up~0); 15295#L586-2 assume !(1 == ~main_clk_req_up~0); 15568#L604-2 start_simulation_~kernel_st~0#1 := 3; 16130#L605-2 assume 0 == ~main_in1_ev~0;~main_in1_ev~0 := 1; 15807#L610-2 assume !(0 == ~main_in2_ev~0); 15808#L615-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 15990#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 15649#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 15432#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 15433#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 15451#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 15800#L645-2 assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; 15499#L650-2 assume !(0 == ~main_clk_neg_edge~0); 15500#L655-2 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 15558#L660-2 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 15404#L665-2 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 15405#L670-2 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 15976#L675-2 assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 16015#L680-2 assume 1 == ~main_in1_ev~0;~main_in1_ev~0 := 2; 16308#L685-2 assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 16018#L690-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 15750#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 15751#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 15904#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 18228#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 16207#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 16208#L720-2 assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 18202#L725-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 18194#L730-2 assume 0 == ~N_generate_st~0; 15506#L502-4 [2024-11-17 08:51:59,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash -379338481, now seen corresponding path program 1 times [2024-11-17 08:51:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208280724] [2024-11-17 08:51:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:59,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208280724] [2024-11-17 08:51:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208280724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:59,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:51:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823135040] [2024-11-17 08:51:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:59,546 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:51:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1992051080, now seen corresponding path program 1 times [2024-11-17 08:51:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735815106] [2024-11-17 08:51:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:59,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:59,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:00,030 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:00,030 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:00,030 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:00,030 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:00,030 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:52:00,031 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,031 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:00,031 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:00,032 INFO L132 ssoRankerPreferences]: Filename of dumped script: pipeline.cil-1.c_Iteration3_Loop [2024-11-17 08:52:00,032 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:00,032 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:00,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,359 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:00,359 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:52:00,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:52:00,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:52:00,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:52:00,374 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:52:00,375 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:52:00,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:52:00,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:52:00,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:52:00,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:52:00,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:52:00,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:52:00,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:52:00,427 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:52:00,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:52:00,438 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:00,439 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:00,439 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:00,439 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:00,439 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:52:00,439 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,439 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:00,439 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:00,439 INFO L132 ssoRankerPreferences]: Filename of dumped script: pipeline.cil-1.c_Iteration3_Loop [2024-11-17 08:52:00,439 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:00,439 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:00,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,847 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:00,847 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:52:00,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:52:00,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:00,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:00,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:00,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:00,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:00,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:00,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:00,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:00,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:00,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:52:00,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,886 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:52:00,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:00,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:00,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:00,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:00,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:00,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:00,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:00,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:00,902 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:52:00,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:52:00,904 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:52:00,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:52:00,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:52:00,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:52:00,907 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:52:00,907 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~main_pres_ev~0) = -1*~main_pres_ev~0 + 1 Supporting invariants [] [2024-11-17 08:52:00,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:00,920 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:52:00,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:00,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:52:00,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:01,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:52:01,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:01,181 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:52:01,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5996 states and 10310 transitions. cyclomatic complexity: 4338 Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:01,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5996 states and 10310 transitions. cyclomatic complexity: 4338. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9171 states and 15803 transitions. Complement of second has 5 states. [2024-11-17 08:52:01,345 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 [2024-11-17 08:52:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-11-17 08:52:01,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1432 transitions. Stem has 40 letters. Loop has 48 letters. [2024-11-17 08:52:01,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:01,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1432 transitions. Stem has 88 letters. Loop has 48 letters. [2024-11-17 08:52:01,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:01,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1432 transitions. Stem has 40 letters. Loop has 96 letters. [2024-11-17 08:52:01,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:01,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9171 states and 15803 transitions. [2024-11-17 08:52:01,421 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 5840 [2024-11-17 08:52:01,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9171 states to 9171 states and 15803 transitions. [2024-11-17 08:52:01,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6127 [2024-11-17 08:52:01,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6159 [2024-11-17 08:52:01,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9171 states and 15803 transitions. [2024-11-17 08:52:01,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:01,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9171 states and 15803 transitions. [2024-11-17 08:52:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9171 states and 15803 transitions. [2024-11-17 08:52:01,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:52:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9171 to 8102. [2024-11-17 08:52:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8102 states, 8102 states have (on average 1.7226610713404098) internal successors, (13957), 8101 states have internal predecessors, (13957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8102 states to 8102 states and 13957 transitions. [2024-11-17 08:52:01,793 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8102 states and 13957 transitions. [2024-11-17 08:52:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:52:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:52:01,794 INFO L87 Difference]: Start difference. First operand 8102 states and 13957 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:02,160 INFO L93 Difference]: Finished difference Result 15834 states and 26680 transitions. [2024-11-17 08:52:02,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15834 states and 26680 transitions. [2024-11-17 08:52:02,226 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 9467 [2024-11-17 08:52:02,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15834 states to 15834 states and 26680 transitions. [2024-11-17 08:52:02,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9878 [2024-11-17 08:52:02,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9878 [2024-11-17 08:52:02,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15834 states and 26680 transitions. [2024-11-17 08:52:02,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:02,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15834 states and 26680 transitions. [2024-11-17 08:52:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15834 states and 26680 transitions. [2024-11-17 08:52:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15834 to 15758. [2024-11-17 08:52:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15758 states, 15758 states have (on average 1.683462368320853) internal successors, (26528), 15757 states have internal predecessors, (26528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15758 states to 15758 states and 26528 transitions. [2024-11-17 08:52:02,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15758 states and 26528 transitions. [2024-11-17 08:52:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:52:02,607 INFO L425 stractBuchiCegarLoop]: Abstraction has 15758 states and 26528 transitions. [2024-11-17 08:52:02,607 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:52:02,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15758 states and 26528 transitions. [2024-11-17 08:52:02,641 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 9467 [2024-11-17 08:52:02,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:02,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:02,643 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:02,643 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:02,643 INFO L745 eck$LassoCheckResult]: Stem: 55681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 54761#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 54682#L256-2 assume !(1 == ~main_in1_req_up~0); 54684#L267-2 assume !(1 == ~main_in2_req_up~0); 55780#L278-2 assume !(1 == ~main_sum_req_up~0); 55774#L289-2 assume !(1 == ~main_diff_req_up~0); 55767#L300-2 assume !(1 == ~main_pres_req_up~0); 55762#L311-2 assume !(1 == ~main_dbl_req_up~0); 55756#L322-2 assume !(1 == ~main_zero_req_up~0); 55749#L333-2 assume !(1 == ~main_clk_req_up~0); 55747#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 55745#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 55743#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 55741#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 55739#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 55737#L376-2 assume !(0 == ~main_in1_ev~0); 55734#L381-2 assume !(0 == ~main_in2_ev~0); 55732#L386-2 assume !(0 == ~main_sum_ev~0); 55733#L391-2 assume !(0 == ~main_diff_ev~0); 55728#L396-2 assume !(0 == ~main_pres_ev~0); 55729#L401-2 assume !(0 == ~main_dbl_ev~0); 55724#L406-2 assume !(0 == ~main_zero_ev~0); 55725#L411-2 assume !(0 == ~main_clk_ev~0); 55719#L416-2 assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; 55720#L421-2 assume !(0 == ~main_clk_neg_edge~0); 57473#L426-2 assume !(1 == ~main_clk_pos_edge~0); 57472#L431-2 assume !(1 == ~main_clk_pos_edge~0); 57471#L436-2 assume !(1 == ~main_clk_pos_edge~0); 57470#L441-2 assume !(1 == ~main_clk_pos_edge~0); 57469#L446-2 assume !(1 == ~main_clk_pos_edge~0); 57468#L451-2 assume !(1 == ~main_in1_ev~0); 57466#L456-2 assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 57467#L461-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 57768#L466-2 assume !(1 == ~main_diff_ev~0); 57767#L471-2 assume !(1 == ~main_pres_ev~0); 57766#L476-2 assume !(1 == ~main_dbl_ev~0); 57765#L481-2 assume !(1 == ~main_zero_ev~0); 57764#L486-2 assume !(1 == ~main_clk_ev~0); 57763#L491-2 assume !(1 == ~main_clk_pos_edge~0); 57760#L496-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 55531#L502-4 assume true; 61231#L502-5 [2024-11-17 08:52:02,643 INFO L747 eck$LassoCheckResult]: Loop: 61231#L502-5 assume !false; 63171#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 63163#L146-4 assume true; 63156#L146-5 assume !false; 63151#eval_while_0_continue#1 assume true; 63148#L148-2 assume !(0 == ~N_generate_st~0); 63146#L151-2 assume !(0 == ~S1_addsub_st~0); 63144#L154-2 assume !(0 == ~S2_presdbl_st~0); 63139#L157-2 assume !(0 == ~S3_zero_st~0); 63130#L160-2 assume !(0 == ~D_print_st~0); 63129#L163-2 assume true; 63128#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 63126#L509-2 assume !(1 == ~main_in1_req_up~0); 63116#L520-2 assume !(1 == ~main_in2_req_up~0); 63117#L531-2 assume !(1 == ~main_sum_req_up~0); 63214#L542-2 assume !(1 == ~main_diff_req_up~0); 62870#L553-2 assume !(1 == ~main_pres_req_up~0); 62865#L564-2 assume !(1 == ~main_dbl_req_up~0); 62862#L575-2 assume !(1 == ~main_zero_req_up~0); 62858#L586-2 assume !(1 == ~main_clk_req_up~0); 62856#L604-2 start_simulation_~kernel_st~0#1 := 3; 62853#L605-2 assume !(0 == ~main_in1_ev~0); 62854#L610-2 assume !(0 == ~main_in2_ev~0); 62885#L615-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 62882#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 62881#L625-2 assume !(0 == ~main_pres_ev~0); 62790#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 62789#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 62787#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 62785#L645-2 assume 0 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 1; 62129#L650-2 assume !(0 == ~main_clk_neg_edge~0); 62781#L655-2 assume 1 == ~main_clk_pos_edge~0;~N_generate_st~0 := 0; 62777#L660-2 assume 1 == ~main_clk_pos_edge~0;~S1_addsub_st~0 := 0; 62746#L665-2 assume 1 == ~main_clk_pos_edge~0;~S2_presdbl_st~0 := 0; 62743#L670-2 assume 1 == ~main_clk_pos_edge~0;~S3_zero_st~0 := 0; 62741#L675-2 assume 1 == ~main_clk_pos_edge~0;~D_print_st~0 := 0; 62739#L680-2 assume !(1 == ~main_in1_ev~0); 62736#L685-2 assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 62656#L690-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 62708#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 62705#L700-2 assume !(1 == ~main_pres_ev~0); 62699#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 62694#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 62689#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 62685#L720-2 assume 1 == ~main_clk_pos_edge~0;~main_clk_pos_edge~0 := 2; 62681#L725-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 62677#L730-2 assume 0 == ~N_generate_st~0; 62660#L502-4 assume true; 61231#L502-5 [2024-11-17 08:52:02,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 522044179, now seen corresponding path program 1 times [2024-11-17 08:52:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371040961] [2024-11-17 08:52:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371040961] [2024-11-17 08:52:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371040961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:02,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:52:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829251933] [2024-11-17 08:52:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:02,703 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:52:02,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1494978150, now seen corresponding path program 1 times [2024-11-17 08:52:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:02,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448222128] [2024-11-17 08:52:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:03,427 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:03,428 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:03,428 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:03,428 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:03,428 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:52:03,428 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:03,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:03,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:03,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: pipeline.cil-1.c_Iteration4_Loop [2024-11-17 08:52:03,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:03,431 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:03,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,790 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:03,790 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:52:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:03,791 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:03,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:52:03,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:52:03,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:52:03,814 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:52:03,814 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~main_pres_ev~0=-1} Honda state: {~main_pres_ev~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:52:03,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:52:03,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:03,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:03,826 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:03,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:52:03,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:52:03,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:52:03,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:52:03,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:03,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:03,852 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:03,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:52:03,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:52:03,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:52:03,868 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:52:03,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:03,879 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:03,879 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:03,879 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:03,879 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:03,879 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:52:03,879 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:03,879 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:03,879 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:03,879 INFO L132 ssoRankerPreferences]: Filename of dumped script: pipeline.cil-1.c_Iteration4_Loop [2024-11-17 08:52:03,879 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:03,879 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:03,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,233 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:04,233 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:52:04,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,235 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:52:04,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,247 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:52:04,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,247 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:52:04,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,261 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:52:04,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:52:04,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:52:04,277 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:52:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,279 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:52:04,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:52:04,280 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:52:04,281 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:52:04,281 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~main_clk_neg_edge~0) = -2*~main_clk_neg_edge~0 + 3 Supporting invariants [] [2024-11-17 08:52:04,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,292 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:52:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:04,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:52:04,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:04,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:52:04,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:04,450 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:52:04,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15758 states and 26528 transitions. cyclomatic complexity: 10834 Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:04,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15758 states and 26528 transitions. cyclomatic complexity: 10834. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35262 states and 59215 transitions. Complement of second has 5 states. [2024-11-17 08:52:04,602 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 [2024-11-17 08:52:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-11-17 08:52:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 755 transitions. Stem has 41 letters. Loop has 48 letters. [2024-11-17 08:52:04,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:04,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 755 transitions. Stem has 89 letters. Loop has 48 letters. [2024-11-17 08:52:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:04,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 755 transitions. Stem has 41 letters. Loop has 96 letters. [2024-11-17 08:52:04,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:04,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35262 states and 59215 transitions. [2024-11-17 08:52:04,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-17 08:52:04,812 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 12269 [2024-11-17 08:52:04,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35262 states to 35187 states and 58975 transitions. [2024-11-17 08:52:04,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12831 [2024-11-17 08:52:04,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12937 [2024-11-17 08:52:04,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35187 states and 58975 transitions. [2024-11-17 08:52:04,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:04,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35187 states and 58975 transitions. [2024-11-17 08:52:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35187 states and 58975 transitions. [2024-11-17 08:52:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35187 to 35006. [2024-11-17 08:52:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35006 states, 35006 states have (on average 1.6763697651831115) internal successors, (58683), 35005 states have internal predecessors, (58683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35006 states to 35006 states and 58683 transitions. [2024-11-17 08:52:05,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35006 states and 58683 transitions. [2024-11-17 08:52:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:05,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:52:05,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:52:05,478 INFO L87 Difference]: Start difference. First operand 35006 states and 58683 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:05,914 INFO L93 Difference]: Finished difference Result 30893 states and 51391 transitions. [2024-11-17 08:52:05,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30893 states and 51391 transitions. [2024-11-17 08:52:06,121 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 11158 [2024-11-17 08:52:06,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30893 states to 30893 states and 51391 transitions. [2024-11-17 08:52:06,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11689 [2024-11-17 08:52:06,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11689 [2024-11-17 08:52:06,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30893 states and 51391 transitions. [2024-11-17 08:52:06,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:06,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30893 states and 51391 transitions. [2024-11-17 08:52:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30893 states and 51391 transitions. [2024-11-17 08:52:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30893 to 25609. [2024-11-17 08:52:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25609 states, 25609 states have (on average 1.676519973446835) internal successors, (42934), 25608 states have internal predecessors, (42934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25609 states to 25609 states and 42934 transitions. [2024-11-17 08:52:06,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25609 states and 42934 transitions. [2024-11-17 08:52:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:52:06,847 INFO L425 stractBuchiCegarLoop]: Abstraction has 25609 states and 42934 transitions. [2024-11-17 08:52:06,847 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:52:06,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25609 states and 42934 transitions. [2024-11-17 08:52:06,906 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 9450 [2024-11-17 08:52:06,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:06,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:06,908 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:06,908 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:06,909 INFO L745 eck$LassoCheckResult]: Stem: 172938#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 171970#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 171891#L256-2 assume !(1 == ~main_in1_req_up~0); 171893#L267-2 assume !(1 == ~main_in2_req_up~0); 172551#L278-2 assume !(1 == ~main_sum_req_up~0); 173105#L289-2 assume !(1 == ~main_diff_req_up~0); 173101#L300-2 assume !(1 == ~main_pres_req_up~0); 172776#L311-2 assume !(1 == ~main_dbl_req_up~0); 172206#L322-2 assume !(1 == ~main_zero_req_up~0); 172432#L333-2 assume !(1 == ~main_clk_req_up~0); 172435#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 173149#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 173147#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 173145#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 173143#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 173141#L376-2 assume !(0 == ~main_in1_ev~0); 173136#L381-2 assume !(0 == ~main_in2_ev~0); 173137#L386-2 assume !(0 == ~main_sum_ev~0); 173128#L391-2 assume !(0 == ~main_diff_ev~0); 173129#L396-2 assume !(0 == ~main_pres_ev~0); 173120#L401-2 assume !(0 == ~main_dbl_ev~0); 173121#L406-2 assume !(0 == ~main_zero_ev~0); 173112#L411-2 assume !(0 == ~main_clk_ev~0); 173113#L416-2 assume !(0 == ~main_clk_pos_edge~0); 173107#L421-2 assume !(0 == ~main_clk_neg_edge~0); 173108#L426-2 assume !(1 == ~main_clk_pos_edge~0); 172893#L431-2 assume !(1 == ~main_clk_pos_edge~0); 172894#L436-2 assume !(1 == ~main_clk_pos_edge~0); 172770#L441-2 assume !(1 == ~main_clk_pos_edge~0); 172771#L446-2 assume !(1 == ~main_clk_pos_edge~0); 172494#L451-2 assume !(1 == ~main_in1_ev~0); 172495#L456-2 assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 172871#L461-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 172957#L466-2 assume !(1 == ~main_diff_ev~0); 172958#L471-2 assume !(1 == ~main_pres_ev~0); 172876#L476-2 assume !(1 == ~main_dbl_ev~0); 172877#L481-2 assume !(1 == ~main_zero_ev~0); 172790#L486-2 assume !(1 == ~main_clk_ev~0); 172791#L491-2 assume !(1 == ~main_clk_pos_edge~0); 173879#L496-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 173875#L502-4 assume true; 173877#L502-5 assume !false; 176157#start_simulation_while_1_continue#1 [2024-11-17 08:52:06,909 INFO L747 eck$LassoCheckResult]: Loop: 176157#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 195352#L146-4 assume true; 195351#L146-5 assume !false; 195350#eval_while_0_continue#1 assume true; 195349#L148-2 assume !(0 == ~N_generate_st~0); 195348#L151-2 assume !(0 == ~S1_addsub_st~0); 195347#L154-2 assume !(0 == ~S2_presdbl_st~0); 195346#L157-2 assume !(0 == ~S3_zero_st~0); 195344#L160-2 assume !(0 == ~D_print_st~0); 195343#L163-2 assume true; 195342#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 195340#L509-2 assume !(1 == ~main_in1_req_up~0); 195337#L520-2 assume !(1 == ~main_in2_req_up~0); 195333#L531-2 assume !(1 == ~main_sum_req_up~0); 195331#L542-2 assume !(1 == ~main_diff_req_up~0); 195325#L553-2 assume !(1 == ~main_pres_req_up~0); 194005#L564-2 assume !(1 == ~main_dbl_req_up~0); 194002#L575-2 assume !(1 == ~main_zero_req_up~0); 193999#L586-2 assume !(1 == ~main_clk_req_up~0); 194000#L604-2 start_simulation_~kernel_st~0#1 := 3; 195072#L605-2 assume !(0 == ~main_in1_ev~0); 195069#L610-2 assume !(0 == ~main_in2_ev~0); 195064#L615-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 195063#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 195062#L625-2 assume !(0 == ~main_pres_ev~0); 195061#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 195022#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 195012#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 195004#L645-2 assume !(0 == ~main_clk_pos_edge~0); 194994#L650-2 assume !(0 == ~main_clk_neg_edge~0); 194987#L655-2 assume !(1 == ~main_clk_pos_edge~0); 194984#L660-2 assume !(1 == ~main_clk_pos_edge~0); 194981#L665-2 assume !(1 == ~main_clk_pos_edge~0); 194978#L670-2 assume !(1 == ~main_clk_pos_edge~0); 194956#L675-2 assume !(1 == ~main_clk_pos_edge~0); 194950#L680-2 assume !(1 == ~main_in1_ev~0); 194944#L685-2 assume 1 == ~main_in2_ev~0;~main_in2_ev~0 := 2; 193907#L690-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 194933#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 194927#L700-2 assume !(1 == ~main_pres_ev~0); 194921#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 194915#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 194909#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 194904#L720-2 assume !(1 == ~main_clk_pos_edge~0); 194900#L725-2 assume !(1 == ~main_clk_neg_edge~0); 193851#L730-2 assume 0 == ~N_generate_st~0; 193846#L502-4 assume true; 195356#L502-5 assume !false; 176157#start_simulation_while_1_continue#1 [2024-11-17 08:52:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1840970804, now seen corresponding path program 1 times [2024-11-17 08:52:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029231955] [2024-11-17 08:52:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029231955] [2024-11-17 08:52:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029231955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:52:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818145510] [2024-11-17 08:52:06,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:06,986 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:52:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1569940058, now seen corresponding path program 1 times [2024-11-17 08:52:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276362290] [2024-11-17 08:52:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:07,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:07,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276362290] [2024-11-17 08:52:07,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276362290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:07,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:07,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:07,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634351244] [2024-11-17 08:52:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:07,011 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:07,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:52:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:52:07,011 INFO L87 Difference]: Start difference. First operand 25609 states and 42934 transitions. cyclomatic complexity: 17425 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:07,317 INFO L93 Difference]: Finished difference Result 34166 states and 57187 transitions. [2024-11-17 08:52:07,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34166 states and 57187 transitions. [2024-11-17 08:52:07,521 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 12324 [2024-11-17 08:52:07,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34166 states to 34166 states and 57187 transitions. [2024-11-17 08:52:07,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12992 [2024-11-17 08:52:07,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12992 [2024-11-17 08:52:07,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34166 states and 57187 transitions. [2024-11-17 08:52:07,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:07,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34166 states and 57187 transitions. [2024-11-17 08:52:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34166 states and 57187 transitions. [2024-11-17 08:52:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34166 to 34116. [2024-11-17 08:52:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34116 states, 34116 states have (on average 1.673320436158987) internal successors, (57087), 34115 states have internal predecessors, (57087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34116 states to 34116 states and 57087 transitions. [2024-11-17 08:52:08,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34116 states and 57087 transitions. [2024-11-17 08:52:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:52:08,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 34116 states and 57087 transitions. [2024-11-17 08:52:08,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:52:08,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34116 states and 57087 transitions. [2024-11-17 08:52:08,272 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 12324 [2024-11-17 08:52:08,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:08,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:08,273 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:08,273 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:08,273 INFO L745 eck$LassoCheckResult]: Stem: 232610#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 231753#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 231675#L256-2 assume !(1 == ~main_in1_req_up~0); 231677#L267-2 assume !(1 == ~main_in2_req_up~0); 232811#L278-2 assume !(1 == ~main_sum_req_up~0); 232822#L289-2 assume !(1 == ~main_diff_req_up~0); 232819#L300-2 assume !(1 == ~main_pres_req_up~0); 232496#L311-2 assume !(1 == ~main_dbl_req_up~0); 231990#L322-2 assume !(1 == ~main_zero_req_up~0); 232208#L333-2 assume !(1 == ~main_clk_req_up~0); 232211#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 232320#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 232278#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 231929#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 231930#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 232527#L376-2 assume !(0 == ~main_in1_ev~0); 232528#L381-2 assume !(0 == ~main_in2_ev~0); 236628#L386-2 assume !(0 == ~main_sum_ev~0); 236627#L391-2 assume !(0 == ~main_diff_ev~0); 236626#L396-2 assume !(0 == ~main_pres_ev~0); 236625#L401-2 assume !(0 == ~main_dbl_ev~0); 236624#L406-2 assume !(0 == ~main_zero_ev~0); 236623#L411-2 assume !(0 == ~main_clk_ev~0); 236622#L416-2 assume !(0 == ~main_clk_pos_edge~0); 236621#L421-2 assume !(0 == ~main_clk_neg_edge~0); 236620#L426-2 assume !(1 == ~main_clk_pos_edge~0); 236619#L431-2 assume !(1 == ~main_clk_pos_edge~0); 236618#L436-2 assume !(1 == ~main_clk_pos_edge~0); 236617#L441-2 assume !(1 == ~main_clk_pos_edge~0); 236616#L446-2 assume !(1 == ~main_clk_pos_edge~0); 236615#L451-2 assume !(1 == ~main_in1_ev~0); 236614#L456-2 assume !(1 == ~main_in2_ev~0); 236613#L461-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 236612#L466-2 assume !(1 == ~main_diff_ev~0); 236611#L471-2 assume !(1 == ~main_pres_ev~0); 236610#L476-2 assume !(1 == ~main_dbl_ev~0); 236609#L481-2 assume !(1 == ~main_zero_ev~0); 236608#L486-2 assume !(1 == ~main_clk_ev~0); 236607#L491-2 assume !(1 == ~main_clk_pos_edge~0); 236603#L496-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 236604#L502-4 assume true; 243007#L502-5 assume !false; 249130#start_simulation_while_1_continue#1 [2024-11-17 08:52:08,273 INFO L747 eck$LassoCheckResult]: Loop: 249130#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 256566#L146-4 assume true; 256565#L146-5 assume !false; 256564#eval_while_0_continue#1 assume true; 256563#L148-2 assume !(0 == ~N_generate_st~0); 256561#L151-2 assume !(0 == ~S1_addsub_st~0); 256560#L154-2 assume !(0 == ~S2_presdbl_st~0); 256558#L157-2 assume !(0 == ~S3_zero_st~0); 256556#L160-2 assume !(0 == ~D_print_st~0); 256555#L163-2 assume true; 256553#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 256551#L509-2 assume !(1 == ~main_in1_req_up~0); 256548#L520-2 assume !(1 == ~main_in2_req_up~0); 256544#L531-2 assume !(1 == ~main_sum_req_up~0); 256542#L542-2 assume !(1 == ~main_diff_req_up~0); 256538#L553-2 assume !(1 == ~main_pres_req_up~0); 256539#L564-2 assume !(1 == ~main_dbl_req_up~0); 256633#L575-2 assume !(1 == ~main_zero_req_up~0); 256629#L586-2 assume !(1 == ~main_clk_req_up~0); 256625#L604-2 start_simulation_~kernel_st~0#1 := 3; 256621#L605-2 assume !(0 == ~main_in1_ev~0); 256620#L610-2 assume !(0 == ~main_in2_ev~0); 256619#L615-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 256615#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 256611#L625-2 assume !(0 == ~main_pres_ev~0); 256607#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 256606#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 256605#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 256604#L645-2 assume !(0 == ~main_clk_pos_edge~0); 256603#L650-2 assume !(0 == ~main_clk_neg_edge~0); 256602#L655-2 assume !(1 == ~main_clk_pos_edge~0); 256601#L660-2 assume !(1 == ~main_clk_pos_edge~0); 256600#L665-2 assume !(1 == ~main_clk_pos_edge~0); 256599#L670-2 assume !(1 == ~main_clk_pos_edge~0); 256598#L675-2 assume !(1 == ~main_clk_pos_edge~0); 256597#L680-2 assume !(1 == ~main_in1_ev~0); 256596#L685-2 assume !(1 == ~main_in2_ev~0); 256595#L690-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 256594#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 256593#L700-2 assume !(1 == ~main_pres_ev~0); 256592#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 256591#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 256590#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 256589#L720-2 assume !(1 == ~main_clk_pos_edge~0); 256586#L725-2 assume !(1 == ~main_clk_neg_edge~0); 256582#L730-2 assume 0 == ~N_generate_st~0; 256574#L502-4 assume true; 256570#L502-5 assume !false; 249130#start_simulation_while_1_continue#1 [2024-11-17 08:52:08,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash 657045133, now seen corresponding path program 1 times [2024-11-17 08:52:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:08,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289051520] [2024-11-17 08:52:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:08,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289051520] [2024-11-17 08:52:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289051520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:08,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:52:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104146668] [2024-11-17 08:52:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:08,332 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:52:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1440857339, now seen corresponding path program 1 times [2024-11-17 08:52:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354216837] [2024-11-17 08:52:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:08,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:08,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354216837] [2024-11-17 08:52:08,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354216837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:08,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:08,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916078944] [2024-11-17 08:52:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:08,368 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:08,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:52:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:52:08,369 INFO L87 Difference]: Start difference. First operand 34116 states and 57087 transitions. cyclomatic complexity: 23091 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:08,871 INFO L93 Difference]: Finished difference Result 67002 states and 110373 transitions. [2024-11-17 08:52:08,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67002 states and 110373 transitions. [2024-11-17 08:52:09,212 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 22728 [2024-11-17 08:52:09,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67002 states to 67002 states and 110373 transitions. [2024-11-17 08:52:09,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24143 [2024-11-17 08:52:09,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24143 [2024-11-17 08:52:09,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67002 states and 110373 transitions. [2024-11-17 08:52:09,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:09,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67002 states and 110373 transitions. [2024-11-17 08:52:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67002 states and 110373 transitions. [2024-11-17 08:52:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67002 to 66924. [2024-11-17 08:52:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66924 states, 66924 states have (on average 1.6468979738210507) internal successors, (110217), 66923 states have internal predecessors, (110217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66924 states to 66924 states and 110217 transitions. [2024-11-17 08:52:10,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66924 states and 110217 transitions. [2024-11-17 08:52:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:52:10,280 INFO L425 stractBuchiCegarLoop]: Abstraction has 66924 states and 110217 transitions. [2024-11-17 08:52:10,284 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:52:10,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66924 states and 110217 transitions. [2024-11-17 08:52:10,511 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 22728 [2024-11-17 08:52:10,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:10,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:10,512 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:10,512 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:10,512 INFO L745 eck$LassoCheckResult]: Stem: 333807#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 332883#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 332805#L256-2 assume !(1 == ~main_in1_req_up~0); 332807#L267-2 assume !(1 == ~main_in2_req_up~0); 333473#L278-2 assume !(1 == ~main_sum_req_up~0); 334121#L289-2 assume !(1 == ~main_diff_req_up~0); 340444#L300-2 assume !(1 == ~main_pres_req_up~0); 340442#L311-2 assume !(1 == ~main_dbl_req_up~0); 334098#L322-2 assume !(1 == ~main_zero_req_up~0); 333361#L333-2 assume !(1 == ~main_clk_req_up~0); 332998#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 333484#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 333427#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 333059#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 333060#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 333721#L376-2 assume !(0 == ~main_in1_ev~0); 333722#L381-2 assume !(0 == ~main_in2_ev~0); 337749#L386-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 337748#L391-2 assume !(0 == ~main_diff_ev~0); 337747#L396-2 assume !(0 == ~main_pres_ev~0); 337746#L401-2 assume !(0 == ~main_dbl_ev~0); 337745#L406-2 assume !(0 == ~main_zero_ev~0); 337744#L411-2 assume !(0 == ~main_clk_ev~0); 337743#L416-2 assume !(0 == ~main_clk_pos_edge~0); 337742#L421-2 assume !(0 == ~main_clk_neg_edge~0); 337741#L426-2 assume !(1 == ~main_clk_pos_edge~0); 337740#L431-2 assume !(1 == ~main_clk_pos_edge~0); 337739#L436-2 assume !(1 == ~main_clk_pos_edge~0); 337738#L441-2 assume !(1 == ~main_clk_pos_edge~0); 337737#L446-2 assume !(1 == ~main_clk_pos_edge~0); 337736#L451-2 assume !(1 == ~main_in1_ev~0); 337735#L456-2 assume !(1 == ~main_in2_ev~0); 337732#L461-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 337733#L466-2 assume !(1 == ~main_diff_ev~0); 340416#L471-2 assume !(1 == ~main_pres_ev~0); 340415#L476-2 assume !(1 == ~main_dbl_ev~0); 340414#L481-2 assume !(1 == ~main_zero_ev~0); 340413#L486-2 assume !(1 == ~main_clk_ev~0); 340412#L491-2 assume !(1 == ~main_clk_pos_edge~0); 340410#L496-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 337719#L502-4 assume true; 337721#L502-5 assume !false; 372220#start_simulation_while_1_continue#1 [2024-11-17 08:52:10,513 INFO L747 eck$LassoCheckResult]: Loop: 372220#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 378284#L146-4 assume true; 378259#L146-5 assume !false; 378260#eval_while_0_continue#1 assume true; 378228#L148-2 assume !(0 == ~N_generate_st~0); 378229#L151-2 assume !(0 == ~S1_addsub_st~0); 378224#L154-2 assume !(0 == ~S2_presdbl_st~0); 378225#L157-2 assume !(0 == ~S3_zero_st~0); 378216#L160-2 assume !(0 == ~D_print_st~0); 378218#L163-2 assume true; 378162#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 378163#L509-2 assume !(1 == ~main_in1_req_up~0); 381238#L520-2 assume !(1 == ~main_in2_req_up~0); 381235#L531-2 assume !(1 == ~main_sum_req_up~0); 381233#L542-2 assume !(1 == ~main_diff_req_up~0); 381230#L553-2 assume !(1 == ~main_pres_req_up~0); 381226#L564-2 assume !(1 == ~main_dbl_req_up~0); 381224#L575-2 assume !(1 == ~main_zero_req_up~0); 381221#L586-2 assume !(1 == ~main_clk_req_up~0); 381219#L604-2 start_simulation_~kernel_st~0#1 := 3; 381218#L605-2 assume !(0 == ~main_in1_ev~0); 381217#L610-2 assume !(0 == ~main_in2_ev~0); 381216#L615-2 assume 0 == ~main_sum_ev~0;~main_sum_ev~0 := 1; 378930#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 379000#L625-2 assume !(0 == ~main_pres_ev~0); 378999#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 378038#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 378998#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 378997#L645-2 assume !(0 == ~main_clk_pos_edge~0); 378996#L650-2 assume !(0 == ~main_clk_neg_edge~0); 378995#L655-2 assume !(1 == ~main_clk_pos_edge~0); 378994#L660-2 assume !(1 == ~main_clk_pos_edge~0); 378993#L665-2 assume !(1 == ~main_clk_pos_edge~0); 378992#L670-2 assume !(1 == ~main_clk_pos_edge~0); 378991#L675-2 assume !(1 == ~main_clk_pos_edge~0); 378990#L680-2 assume !(1 == ~main_in1_ev~0); 377984#L685-2 assume !(1 == ~main_in2_ev~0); 377985#L690-2 assume 1 == ~main_sum_ev~0;~main_sum_ev~0 := 2; 378914#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 381201#L700-2 assume !(1 == ~main_pres_ev~0); 381200#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 377963#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 381199#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 381198#L720-2 assume !(1 == ~main_clk_pos_edge~0); 381197#L725-2 assume !(1 == ~main_clk_neg_edge~0); 381196#L730-2 assume 0 == ~N_generate_st~0; 377918#L502-4 assume true; 381246#L502-5 assume !false; 372220#start_simulation_while_1_continue#1 [2024-11-17 08:52:10,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1560712820, now seen corresponding path program 1 times [2024-11-17 08:52:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004133102] [2024-11-17 08:52:10,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004133102] [2024-11-17 08:52:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004133102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:10,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:52:10,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697574586] [2024-11-17 08:52:10,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:10,590 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:52:10,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1440857339, now seen corresponding path program 2 times [2024-11-17 08:52:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:10,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168843697] [2024-11-17 08:52:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168843697] [2024-11-17 08:52:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168843697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417233234] [2024-11-17 08:52:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:10,632 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:52:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:52:10,633 INFO L87 Difference]: Start difference. First operand 66924 states and 110217 transitions. cyclomatic complexity: 43493 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:11,208 INFO L93 Difference]: Finished difference Result 94291 states and 153707 transitions. [2024-11-17 08:52:11,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94291 states and 153707 transitions. [2024-11-17 08:52:11,671 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 33675 [2024-11-17 08:52:11,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94291 states to 94291 states and 153707 transitions. [2024-11-17 08:52:11,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35289 [2024-11-17 08:52:11,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35289 [2024-11-17 08:52:11,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94291 states and 153707 transitions. [2024-11-17 08:52:11,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:11,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94291 states and 153707 transitions. [2024-11-17 08:52:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94291 states and 153707 transitions. [2024-11-17 08:52:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94291 to 94291. [2024-11-17 08:52:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94291 states, 94291 states have (on average 1.6301343712549448) internal successors, (153707), 94290 states have internal predecessors, (153707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94291 states to 94291 states and 153707 transitions. [2024-11-17 08:52:13,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94291 states and 153707 transitions. [2024-11-17 08:52:13,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:52:13,052 INFO L425 stractBuchiCegarLoop]: Abstraction has 94291 states and 153707 transitions. [2024-11-17 08:52:13,052 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:52:13,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94291 states and 153707 transitions. [2024-11-17 08:52:13,442 INFO L131 ngComponentsAnalysis]: Automaton has 90 accepting balls. 33675 [2024-11-17 08:52:13,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:13,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:13,444 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:13,445 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:13,445 INFO L745 eck$LassoCheckResult]: Stem: 495059#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 494107#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 494029#L256-2 assume !(1 == ~main_in1_req_up~0); 494031#L267-2 assume !(1 == ~main_in2_req_up~0); 494704#L278-2 assume !(1 == ~main_sum_req_up~0); 494968#L289-2 assume !(1 == ~main_diff_req_up~0); 494793#L300-2 assume !(1 == ~main_pres_req_up~0); 494913#L311-2 assume !(1 == ~main_dbl_req_up~0); 494353#L322-2 assume !(1 == ~main_zero_req_up~0); 494590#L333-2 assume !(1 == ~main_clk_req_up~0); 494227#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 495781#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 494661#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 494287#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 494288#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 494954#L376-2 assume !(0 == ~main_in1_ev~0); 494955#L381-2 assume !(0 == ~main_in2_ev~0); 495039#L386-2 assume !(0 == ~main_sum_ev~0); 495040#L391-2 assume !(0 == ~main_diff_ev~0); 535540#L396-2 assume !(0 == ~main_pres_ev~0); 535539#L401-2 assume !(0 == ~main_dbl_ev~0); 535538#L406-2 assume !(0 == ~main_zero_ev~0); 535537#L411-2 assume !(0 == ~main_clk_ev~0); 535536#L416-2 assume !(0 == ~main_clk_pos_edge~0); 535535#L421-2 assume !(0 == ~main_clk_neg_edge~0); 535534#L426-2 assume !(1 == ~main_clk_pos_edge~0); 535533#L431-2 assume !(1 == ~main_clk_pos_edge~0); 535532#L436-2 assume !(1 == ~main_clk_pos_edge~0); 535531#L441-2 assume !(1 == ~main_clk_pos_edge~0); 535530#L446-2 assume !(1 == ~main_clk_pos_edge~0); 535529#L451-2 assume !(1 == ~main_in1_ev~0); 535528#L456-2 assume !(1 == ~main_in2_ev~0); 535527#L461-2 assume !(1 == ~main_sum_ev~0); 535526#L466-2 assume !(1 == ~main_diff_ev~0); 535525#L471-2 assume !(1 == ~main_pres_ev~0); 535524#L476-2 assume !(1 == ~main_dbl_ev~0); 535523#L481-2 assume !(1 == ~main_zero_ev~0); 535522#L486-2 assume !(1 == ~main_clk_ev~0); 535521#L491-2 assume !(1 == ~main_clk_pos_edge~0); 535520#L496-2 assume 1 == ~main_clk_neg_edge~0;~main_clk_neg_edge~0 := 2; 535519#L502-4 assume true; 508494#L502-5 assume !false; 508495#start_simulation_while_1_continue#1 [2024-11-17 08:52:13,445 INFO L747 eck$LassoCheckResult]: Loop: 508495#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 516868#L146-4 assume true; 516867#L146-5 assume !false; 516866#eval_while_0_continue#1 assume true; 516865#L148-2 assume !(0 == ~N_generate_st~0); 516864#L151-2 assume !(0 == ~S1_addsub_st~0); 516863#L154-2 assume !(0 == ~S2_presdbl_st~0); 516862#L157-2 assume !(0 == ~S3_zero_st~0); 516860#L160-2 assume !(0 == ~D_print_st~0); 516859#L163-2 assume true; 516858#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 516856#L509-2 assume !(1 == ~main_in1_req_up~0); 516853#L520-2 assume !(1 == ~main_in2_req_up~0); 516851#L531-2 assume !(1 == ~main_sum_req_up~0); 516849#L542-2 assume !(1 == ~main_diff_req_up~0); 516846#L553-2 assume !(1 == ~main_pres_req_up~0); 516842#L564-2 assume !(1 == ~main_dbl_req_up~0); 516840#L575-2 assume !(1 == ~main_zero_req_up~0); 516837#L586-2 assume !(1 == ~main_clk_req_up~0); 516835#L604-2 start_simulation_~kernel_st~0#1 := 3; 516834#L605-2 assume !(0 == ~main_in1_ev~0); 516833#L610-2 assume !(0 == ~main_in2_ev~0); 516832#L615-2 assume !(0 == ~main_sum_ev~0); 516831#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 516830#L625-2 assume !(0 == ~main_pres_ev~0); 516829#L630-2 assume 0 == ~main_dbl_ev~0;~main_dbl_ev~0 := 1; 516827#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 516826#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 516825#L645-2 assume !(0 == ~main_clk_pos_edge~0); 516824#L650-2 assume !(0 == ~main_clk_neg_edge~0); 516823#L655-2 assume !(1 == ~main_clk_pos_edge~0); 516822#L660-2 assume !(1 == ~main_clk_pos_edge~0); 516821#L665-2 assume !(1 == ~main_clk_pos_edge~0); 516820#L670-2 assume !(1 == ~main_clk_pos_edge~0); 516819#L675-2 assume !(1 == ~main_clk_pos_edge~0); 516818#L680-2 assume !(1 == ~main_in1_ev~0); 516817#L685-2 assume !(1 == ~main_in2_ev~0); 516797#L690-2 assume !(1 == ~main_sum_ev~0); 516795#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 516794#L700-2 assume !(1 == ~main_pres_ev~0); 516793#L705-2 assume 1 == ~main_dbl_ev~0;~main_dbl_ev~0 := 2; 516789#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 516787#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 516785#L720-2 assume !(1 == ~main_clk_pos_edge~0); 516783#L725-2 assume !(1 == ~main_clk_neg_edge~0); 516781#L730-2 assume 0 == ~N_generate_st~0; 512936#L502-4 assume true; 516872#L502-5 assume !false; 508495#start_simulation_while_1_continue#1 [2024-11-17 08:52:13,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 460531628, now seen corresponding path program 1 times [2024-11-17 08:52:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312648515] [2024-11-17 08:52:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:13,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312648515] [2024-11-17 08:52:13,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312648515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:13,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:13,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:52:13,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11532706] [2024-11-17 08:52:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:13,524 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:52:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1088178405, now seen corresponding path program 1 times [2024-11-17 08:52:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020006849] [2024-11-17 08:52:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:13,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:13,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020006849] [2024-11-17 08:52:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020006849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:13,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216679662] [2024-11-17 08:52:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:13,563 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:13,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:52:13,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:52:13,564 INFO L87 Difference]: Start difference. First operand 94291 states and 153707 transitions. cyclomatic complexity: 59676 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:13,965 INFO L93 Difference]: Finished difference Result 87393 states and 143232 transitions. [2024-11-17 08:52:13,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87393 states and 143232 transitions. [2024-11-17 08:52:14,213 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 33677 [2024-11-17 08:52:14,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87393 states to 56668 states and 94211 transitions. [2024-11-17 08:52:14,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35119 [2024-11-17 08:52:14,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35119 [2024-11-17 08:52:14,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56668 states and 94211 transitions. [2024-11-17 08:52:14,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:14,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56668 states and 94211 transitions. [2024-11-17 08:52:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56668 states and 94211 transitions. [2024-11-17 08:52:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56668 to 36966. [2024-11-17 08:52:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36966 states, 36966 states have (on average 1.6754044256884706) internal successors, (61933), 36965 states have internal predecessors, (61933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36966 states to 36966 states and 61933 transitions. [2024-11-17 08:52:15,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36966 states and 61933 transitions. [2024-11-17 08:52:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:52:15,080 INFO L425 stractBuchiCegarLoop]: Abstraction has 36966 states and 61933 transitions. [2024-11-17 08:52:15,080 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:52:15,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36966 states and 61933 transitions. [2024-11-17 08:52:15,155 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 21861 [2024-11-17 08:52:15,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:15,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:15,156 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:15,156 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:15,156 INFO L745 eck$LassoCheckResult]: Stem: 676648#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 675800#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 675723#L256-2 assume !(1 == ~main_in1_req_up~0); 675725#L267-2 assume !(1 == ~main_in2_req_up~0); 676353#L278-2 assume !(1 == ~main_sum_req_up~0); 676592#L289-2 assume !(1 == ~main_diff_req_up~0); 676437#L300-2 assume !(1 == ~main_pres_req_up~0); 676539#L311-2 assume !(1 == ~main_dbl_req_up~0); 676047#L322-2 assume !(1 == ~main_zero_req_up~0); 676261#L333-2 assume !(1 == ~main_clk_req_up~0); 675925#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 676520#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 676521#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 675984#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 675985#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 676579#L376-2 assume !(0 == ~main_in1_ev~0); 676580#L381-2 assume !(0 == ~main_in2_ev~0); 683508#L386-2 assume !(0 == ~main_sum_ev~0); 683507#L391-2 assume !(0 == ~main_diff_ev~0); 683506#L396-2 assume !(0 == ~main_pres_ev~0); 683505#L401-2 assume !(0 == ~main_dbl_ev~0); 683504#L406-2 assume !(0 == ~main_zero_ev~0); 683503#L411-2 assume !(0 == ~main_clk_ev~0); 683502#L416-2 assume !(0 == ~main_clk_pos_edge~0); 683501#L421-2 assume !(0 == ~main_clk_neg_edge~0); 683500#L426-2 assume !(1 == ~main_clk_pos_edge~0); 683499#L431-2 assume !(1 == ~main_clk_pos_edge~0); 683498#L436-2 assume !(1 == ~main_clk_pos_edge~0); 683497#L441-2 assume !(1 == ~main_clk_pos_edge~0); 683496#L446-2 assume !(1 == ~main_clk_pos_edge~0); 683495#L451-2 assume !(1 == ~main_in1_ev~0); 683494#L456-2 assume !(1 == ~main_in2_ev~0); 683493#L461-2 assume !(1 == ~main_sum_ev~0); 683492#L466-2 assume !(1 == ~main_diff_ev~0); 683491#L471-2 assume !(1 == ~main_pres_ev~0); 683490#L476-2 assume !(1 == ~main_dbl_ev~0); 683489#L481-2 assume !(1 == ~main_zero_ev~0); 683488#L486-2 assume !(1 == ~main_clk_ev~0); 683487#L491-2 assume !(1 == ~main_clk_pos_edge~0); 683480#L496-2 assume !(1 == ~main_clk_neg_edge~0); 683477#L502-4 assume true; 683478#L502-5 [2024-11-17 08:52:15,156 INFO L747 eck$LassoCheckResult]: Loop: 683478#L502-5 assume !false; 692427#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 692417#L146-4 assume true; 692410#L146-5 assume !false; 692406#eval_while_0_continue#1 assume true; 692402#L148-2 assume !(0 == ~N_generate_st~0); 692398#L151-2 assume !(0 == ~S1_addsub_st~0); 692394#L154-2 assume !(0 == ~S2_presdbl_st~0); 692389#L157-2 assume !(0 == ~S3_zero_st~0); 692385#L160-2 assume !(0 == ~D_print_st~0); 692380#L163-2 assume true; 692372#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 692364#L509-2 assume !(1 == ~main_in1_req_up~0); 692354#L520-2 assume !(1 == ~main_in2_req_up~0); 692344#L531-2 assume !(1 == ~main_sum_req_up~0); 692342#L542-2 assume !(1 == ~main_diff_req_up~0); 692312#L553-2 assume !(1 == ~main_pres_req_up~0); 692307#L564-2 assume !(1 == ~main_dbl_req_up~0); 692304#L575-2 assume !(1 == ~main_zero_req_up~0); 692301#L586-2 assume !(1 == ~main_clk_req_up~0); 692296#L604-2 start_simulation_~kernel_st~0#1 := 3; 692260#L605-2 assume !(0 == ~main_in1_ev~0); 692244#L610-2 assume !(0 == ~main_in2_ev~0); 692239#L615-2 assume !(0 == ~main_sum_ev~0); 692233#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 692197#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 692196#L630-2 assume !(0 == ~main_dbl_ev~0); 692191#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 692186#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 692181#L645-2 assume !(0 == ~main_clk_pos_edge~0); 692176#L650-2 assume !(0 == ~main_clk_neg_edge~0); 692171#L655-2 assume !(1 == ~main_clk_pos_edge~0); 692166#L660-2 assume !(1 == ~main_clk_pos_edge~0); 692161#L665-2 assume !(1 == ~main_clk_pos_edge~0); 692155#L670-2 assume !(1 == ~main_clk_pos_edge~0); 692151#L675-2 assume !(1 == ~main_clk_pos_edge~0); 692147#L680-2 assume !(1 == ~main_in1_ev~0); 692143#L685-2 assume !(1 == ~main_in2_ev~0); 692139#L690-2 assume !(1 == ~main_sum_ev~0); 692135#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 692131#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 692127#L705-2 assume !(1 == ~main_dbl_ev~0); 692123#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 692119#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 692115#L720-2 assume !(1 == ~main_clk_pos_edge~0); 692111#L725-2 assume !(1 == ~main_clk_neg_edge~0); 692105#L730-2 assume 0 == ~N_generate_st~0; 692090#L502-4 assume true; 683478#L502-5 [2024-11-17 08:52:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1815971185, now seen corresponding path program 1 times [2024-11-17 08:52:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937892061] [2024-11-17 08:52:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:15,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:15,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:15,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -406920611, now seen corresponding path program 1 times [2024-11-17 08:52:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991843311] [2024-11-17 08:52:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:15,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991843311] [2024-11-17 08:52:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991843311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819012924] [2024-11-17 08:52:15,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:15,229 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:52:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:52:15,230 INFO L87 Difference]: Start difference. First operand 36966 states and 61933 transitions. cyclomatic complexity: 25037 Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:15,619 INFO L93 Difference]: Finished difference Result 52828 states and 89191 transitions. [2024-11-17 08:52:15,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52828 states and 89191 transitions. [2024-11-17 08:52:15,809 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 30825 [2024-11-17 08:52:15,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52828 states to 52828 states and 89191 transitions. [2024-11-17 08:52:15,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32869 [2024-11-17 08:52:15,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32869 [2024-11-17 08:52:15,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52828 states and 89191 transitions. [2024-11-17 08:52:15,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:15,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52828 states and 89191 transitions. [2024-11-17 08:52:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52828 states and 89191 transitions. [2024-11-17 08:52:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52828 to 52828. [2024-11-17 08:52:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52828 states, 52828 states have (on average 1.688328159309457) internal successors, (89191), 52827 states have internal predecessors, (89191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52828 states to 52828 states and 89191 transitions. [2024-11-17 08:52:16,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52828 states and 89191 transitions. [2024-11-17 08:52:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:52:16,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 52828 states and 89191 transitions. [2024-11-17 08:52:16,548 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:52:16,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52828 states and 89191 transitions. [2024-11-17 08:52:16,694 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 30825 [2024-11-17 08:52:16,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:16,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:16,697 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:16,697 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:16,697 INFO L745 eck$LassoCheckResult]: Stem: 766553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 765601#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 765524#L256-2 assume !(1 == ~main_in1_req_up~0); 765526#L267-2 assume !(1 == ~main_in2_req_up~0); 766449#L278-2 assume !(1 == ~main_sum_req_up~0); 765568#L289-2 assume !(1 == ~main_diff_req_up~0); 766283#L300-2 assume !(1 == ~main_pres_req_up~0); 766240#L311-2 assume !(1 == ~main_dbl_req_up~0); 765848#L322-2 assume !(1 == ~main_zero_req_up~0); 766074#L333-2 assume !(1 == ~main_clk_req_up~0); 766077#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 772382#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 772381#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 772380#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 772379#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 772378#L376-2 assume !(0 == ~main_in1_ev~0); 772377#L381-2 assume !(0 == ~main_in2_ev~0); 772375#L386-2 assume !(0 == ~main_sum_ev~0); 772376#L391-2 assume !(0 == ~main_diff_ev~0); 772656#L396-2 assume !(0 == ~main_pres_ev~0); 772655#L401-2 assume !(0 == ~main_dbl_ev~0); 772654#L406-2 assume !(0 == ~main_zero_ev~0); 772653#L411-2 assume !(0 == ~main_clk_ev~0); 772652#L416-2 assume !(0 == ~main_clk_pos_edge~0); 772651#L421-2 assume !(0 == ~main_clk_neg_edge~0); 772650#L426-2 assume !(1 == ~main_clk_pos_edge~0); 772649#L431-2 assume !(1 == ~main_clk_pos_edge~0); 772648#L436-2 assume !(1 == ~main_clk_pos_edge~0); 772647#L441-2 assume !(1 == ~main_clk_pos_edge~0); 772646#L446-2 assume !(1 == ~main_clk_pos_edge~0); 772645#L451-2 assume !(1 == ~main_in1_ev~0); 772644#L456-2 assume !(1 == ~main_in2_ev~0); 772643#L461-2 assume !(1 == ~main_sum_ev~0); 772642#L466-2 assume !(1 == ~main_diff_ev~0); 772641#L471-2 assume !(1 == ~main_pres_ev~0); 772640#L476-2 assume !(1 == ~main_dbl_ev~0); 772639#L481-2 assume !(1 == ~main_zero_ev~0); 772638#L486-2 assume !(1 == ~main_clk_ev~0); 772637#L491-2 assume !(1 == ~main_clk_pos_edge~0); 772636#L496-2 assume !(1 == ~main_clk_neg_edge~0); 772634#L502-4 assume true; 772635#L502-5 [2024-11-17 08:52:16,698 INFO L747 eck$LassoCheckResult]: Loop: 772635#L502-5 assume !false; 788405#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 788403#L146-4 assume true; 788386#L146-5 assume !false; 788387#eval_while_0_continue#1 assume true; 788373#L148-2 assume !(0 == ~N_generate_st~0); 788374#L151-2 assume !(0 == ~S1_addsub_st~0); 788365#L154-2 assume !(0 == ~S2_presdbl_st~0); 788366#L157-2 assume !(0 == ~S3_zero_st~0); 788357#L160-2 assume !(0 == ~D_print_st~0); 788359#L163-2 assume true; 788347#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 788348#L509-2 assume !(1 == ~main_in1_req_up~0); 788318#L520-2 assume !(1 == ~main_in2_req_up~0); 788319#L531-2 assume !(1 == ~main_sum_req_up~0); 788520#L542-2 assume !(1 == ~main_diff_req_up~0); 788514#L553-2 assume !(1 == ~main_pres_req_up~0); 788507#L564-2 assume !(1 == ~main_dbl_req_up~0); 788502#L575-2 assume !(1 == ~main_zero_req_up~0); 788495#L586-2 assume !(1 == ~main_clk_req_up~0); 788496#L604-2 start_simulation_~kernel_st~0#1 := 3; 788968#L605-2 assume !(0 == ~main_in1_ev~0); 788967#L610-2 assume !(0 == ~main_in2_ev~0); 788966#L615-2 assume !(0 == ~main_sum_ev~0); 788965#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 788964#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 788963#L630-2 assume !(0 == ~main_dbl_ev~0); 788962#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 788961#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 788960#L645-2 assume !(0 == ~main_clk_pos_edge~0); 788959#L650-2 assume !(0 == ~main_clk_neg_edge~0); 788958#L655-2 assume !(1 == ~main_clk_pos_edge~0); 788957#L660-2 assume !(1 == ~main_clk_pos_edge~0); 788956#L665-2 assume !(1 == ~main_clk_pos_edge~0); 788953#L670-2 assume !(1 == ~main_clk_pos_edge~0); 788949#L675-2 assume !(1 == ~main_clk_pos_edge~0); 788945#L680-2 assume !(1 == ~main_in1_ev~0); 788940#L685-2 assume !(1 == ~main_in2_ev~0); 788938#L690-2 assume !(1 == ~main_sum_ev~0); 788936#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 788934#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 788933#L705-2 assume !(1 == ~main_dbl_ev~0); 788930#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 788926#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 788922#L720-2 assume !(1 == ~main_clk_pos_edge~0); 788921#L725-2 assume !(1 == ~main_clk_neg_edge~0); 788920#L730-2 assume !(0 == ~N_generate_st~0); 788918#L733-2 assume 0 == ~S1_addsub_st~0; 788911#L502-4 assume true; 772635#L502-5 [2024-11-17 08:52:16,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1815971185, now seen corresponding path program 2 times [2024-11-17 08:52:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:16,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192585703] [2024-11-17 08:52:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:16,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:16,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:16,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:16,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash 270359992, now seen corresponding path program 1 times [2024-11-17 08:52:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:16,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325688238] [2024-11-17 08:52:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:16,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325688238] [2024-11-17 08:52:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325688238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:17,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:17,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922889639] [2024-11-17 08:52:17,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:17,023 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:52:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:52:17,024 INFO L87 Difference]: Start difference. First operand 52828 states and 89191 transitions. cyclomatic complexity: 36443 Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:17,204 INFO L93 Difference]: Finished difference Result 83002 states and 140657 transitions. [2024-11-17 08:52:17,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83002 states and 140657 transitions. [2024-11-17 08:52:17,490 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 47837 [2024-11-17 08:52:17,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83002 states to 83002 states and 140657 transitions. [2024-11-17 08:52:17,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51664 [2024-11-17 08:52:17,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51664 [2024-11-17 08:52:17,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83002 states and 140657 transitions. [2024-11-17 08:52:17,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:17,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83002 states and 140657 transitions. [2024-11-17 08:52:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83002 states and 140657 transitions. [2024-11-17 08:52:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83002 to 83002. [2024-11-17 08:52:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83002 states, 83002 states have (on average 1.694621816341775) internal successors, (140657), 83001 states have internal predecessors, (140657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83002 states to 83002 states and 140657 transitions. [2024-11-17 08:52:18,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83002 states and 140657 transitions. [2024-11-17 08:52:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:52:18,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 83002 states and 140657 transitions. [2024-11-17 08:52:18,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:52:18,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83002 states and 140657 transitions. [2024-11-17 08:52:18,891 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 47837 [2024-11-17 08:52:18,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:18,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:18,892 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:18,892 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:18,892 INFO L745 eck$LassoCheckResult]: Stem: 902485#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 901434#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 901357#L256-2 assume !(1 == ~main_in1_req_up~0); 901359#L267-2 assume !(1 == ~main_in2_req_up~0); 905597#L278-2 assume !(1 == ~main_sum_req_up~0); 905667#L289-2 assume !(1 == ~main_diff_req_up~0); 905660#L300-2 assume !(1 == ~main_pres_req_up~0); 905657#L311-2 assume !(1 == ~main_dbl_req_up~0); 905653#L322-2 assume !(1 == ~main_zero_req_up~0); 905647#L333-2 assume !(1 == ~main_clk_req_up~0); 905644#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 905645#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 905803#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 905808#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 905807#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 905806#L376-2 assume !(0 == ~main_in1_ev~0); 905805#L381-2 assume !(0 == ~main_in2_ev~0); 905804#L386-2 assume !(0 == ~main_sum_ev~0); 905802#L391-2 assume !(0 == ~main_diff_ev~0); 905800#L396-2 assume !(0 == ~main_pres_ev~0); 905798#L401-2 assume !(0 == ~main_dbl_ev~0); 905796#L406-2 assume !(0 == ~main_zero_ev~0); 905794#L411-2 assume !(0 == ~main_clk_ev~0); 905792#L416-2 assume !(0 == ~main_clk_pos_edge~0); 905790#L421-2 assume !(0 == ~main_clk_neg_edge~0); 905788#L426-2 assume !(1 == ~main_clk_pos_edge~0); 905786#L431-2 assume !(1 == ~main_clk_pos_edge~0); 905784#L436-2 assume !(1 == ~main_clk_pos_edge~0); 905782#L441-2 assume !(1 == ~main_clk_pos_edge~0); 905780#L446-2 assume !(1 == ~main_clk_pos_edge~0); 905778#L451-2 assume !(1 == ~main_in1_ev~0); 905776#L456-2 assume !(1 == ~main_in2_ev~0); 905774#L461-2 assume !(1 == ~main_sum_ev~0); 905772#L466-2 assume !(1 == ~main_diff_ev~0); 905770#L471-2 assume !(1 == ~main_pres_ev~0); 905768#L476-2 assume !(1 == ~main_dbl_ev~0); 905765#L481-2 assume !(1 == ~main_zero_ev~0); 905762#L486-2 assume !(1 == ~main_clk_ev~0); 905675#L491-2 assume !(1 == ~main_clk_pos_edge~0); 905360#L496-2 assume !(1 == ~main_clk_neg_edge~0); 905346#L502-4 assume true; 905347#L502-5 [2024-11-17 08:52:18,892 INFO L747 eck$LassoCheckResult]: Loop: 905347#L502-5 assume !false; 937871#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 937869#L146-4 assume true; 937843#L146-5 assume !false; 937844#eval_while_0_continue#1 assume true; 938023#L148-2 assume !(0 == ~N_generate_st~0); 938017#L151-2 assume !(0 == ~S1_addsub_st~0); 937816#L154-2 assume !(0 == ~S2_presdbl_st~0); 937817#L157-2 assume !(0 == ~S3_zero_st~0); 937808#L160-2 assume !(0 == ~D_print_st~0); 937810#L163-2 assume true; 937799#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 937800#L509-2 assume !(1 == ~main_in1_req_up~0); 938014#L520-2 assume !(1 == ~main_in2_req_up~0); 937777#L531-2 assume !(1 == ~main_sum_req_up~0); 937778#L542-2 assume !(1 == ~main_diff_req_up~0); 938007#L553-2 assume !(1 == ~main_pres_req_up~0); 938000#L564-2 assume !(1 == ~main_dbl_req_up~0); 937994#L575-2 assume !(1 == ~main_zero_req_up~0); 937988#L586-2 assume !(1 == ~main_clk_req_up~0); 937989#L604-2 start_simulation_~kernel_st~0#1 := 3; 938069#L605-2 assume !(0 == ~main_in1_ev~0); 938068#L610-2 assume !(0 == ~main_in2_ev~0); 938067#L615-2 assume !(0 == ~main_sum_ev~0); 938066#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 938065#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 938064#L630-2 assume !(0 == ~main_dbl_ev~0); 938063#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 938062#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 938061#L645-2 assume !(0 == ~main_clk_pos_edge~0); 938060#L650-2 assume !(0 == ~main_clk_neg_edge~0); 938059#L655-2 assume !(1 == ~main_clk_pos_edge~0); 938058#L660-2 assume !(1 == ~main_clk_pos_edge~0); 938057#L665-2 assume !(1 == ~main_clk_pos_edge~0); 938056#L670-2 assume !(1 == ~main_clk_pos_edge~0); 938055#L675-2 assume !(1 == ~main_clk_pos_edge~0); 938054#L680-2 assume !(1 == ~main_in1_ev~0); 938053#L685-2 assume !(1 == ~main_in2_ev~0); 938052#L690-2 assume !(1 == ~main_sum_ev~0); 938051#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 938050#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 938049#L705-2 assume !(1 == ~main_dbl_ev~0); 938048#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 938047#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 938046#L720-2 assume !(1 == ~main_clk_pos_edge~0); 938045#L725-2 assume !(1 == ~main_clk_neg_edge~0); 938044#L730-2 assume !(0 == ~N_generate_st~0); 937556#L733-2 assume !(0 == ~S1_addsub_st~0); 937557#L736-2 assume 0 == ~S2_presdbl_st~0; 937880#L502-4 assume true; 905347#L502-5 [2024-11-17 08:52:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1815971185, now seen corresponding path program 3 times [2024-11-17 08:52:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:18,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013042586] [2024-11-17 08:52:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:18,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:18,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash -208777857, now seen corresponding path program 1 times [2024-11-17 08:52:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071442533] [2024-11-17 08:52:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:18,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071442533] [2024-11-17 08:52:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071442533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:18,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340683757] [2024-11-17 08:52:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:18,924 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:52:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:52:18,925 INFO L87 Difference]: Start difference. First operand 83002 states and 140657 transitions. cyclomatic complexity: 57755 Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:19,695 INFO L93 Difference]: Finished difference Result 140080 states and 237099 transitions. [2024-11-17 08:52:19,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140080 states and 237099 transitions. [2024-11-17 08:52:20,095 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 79922 [2024-11-17 08:52:20,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140080 states to 140080 states and 237099 transitions. [2024-11-17 08:52:20,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87237 [2024-11-17 08:52:20,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87237 [2024-11-17 08:52:20,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140080 states and 237099 transitions. [2024-11-17 08:52:20,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:20,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140080 states and 237099 transitions. [2024-11-17 08:52:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140080 states and 237099 transitions. [2024-11-17 08:52:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140080 to 140080. [2024-11-17 08:52:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140080 states, 140080 states have (on average 1.6925970873786407) internal successors, (237099), 140079 states have internal predecessors, (237099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140080 states to 140080 states and 237099 transitions. [2024-11-17 08:52:22,798 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140080 states and 237099 transitions. [2024-11-17 08:52:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:52:22,799 INFO L425 stractBuchiCegarLoop]: Abstraction has 140080 states and 237099 transitions. [2024-11-17 08:52:22,799 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:52:22,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140080 states and 237099 transitions. [2024-11-17 08:52:23,074 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 79922 [2024-11-17 08:52:23,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:23,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:23,075 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:23,075 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:23,075 INFO L745 eck$LassoCheckResult]: Stem: 1125657#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 1124524#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1124446#L256-2 assume !(1 == ~main_in1_req_up~0); 1124448#L267-2 assume !(1 == ~main_in2_req_up~0); 1125625#L278-2 assume !(1 == ~main_sum_req_up~0); 1133726#L289-2 assume !(1 == ~main_diff_req_up~0); 1133599#L300-2 assume !(1 == ~main_pres_req_up~0); 1133595#L311-2 assume !(1 == ~main_dbl_req_up~0); 1133589#L322-2 assume !(1 == ~main_zero_req_up~0); 1133585#L333-2 assume !(1 == ~main_clk_req_up~0); 1133586#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 1179744#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 1179865#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 1180169#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 1180168#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 1180166#L376-2 assume !(0 == ~main_in1_ev~0); 1180164#L381-2 assume !(0 == ~main_in2_ev~0); 1180162#L386-2 assume !(0 == ~main_sum_ev~0); 1180160#L391-2 assume !(0 == ~main_diff_ev~0); 1180158#L396-2 assume !(0 == ~main_pres_ev~0); 1180156#L401-2 assume !(0 == ~main_dbl_ev~0); 1180154#L406-2 assume !(0 == ~main_zero_ev~0); 1180152#L411-2 assume !(0 == ~main_clk_ev~0); 1180150#L416-2 assume !(0 == ~main_clk_pos_edge~0); 1180148#L421-2 assume !(0 == ~main_clk_neg_edge~0); 1180146#L426-2 assume !(1 == ~main_clk_pos_edge~0); 1180144#L431-2 assume !(1 == ~main_clk_pos_edge~0); 1180142#L436-2 assume !(1 == ~main_clk_pos_edge~0); 1180140#L441-2 assume !(1 == ~main_clk_pos_edge~0); 1180138#L446-2 assume !(1 == ~main_clk_pos_edge~0); 1180136#L451-2 assume !(1 == ~main_in1_ev~0); 1180134#L456-2 assume !(1 == ~main_in2_ev~0); 1180132#L461-2 assume !(1 == ~main_sum_ev~0); 1180130#L466-2 assume !(1 == ~main_diff_ev~0); 1180128#L471-2 assume !(1 == ~main_pres_ev~0); 1180126#L476-2 assume !(1 == ~main_dbl_ev~0); 1180124#L481-2 assume !(1 == ~main_zero_ev~0); 1180122#L486-2 assume !(1 == ~main_clk_ev~0); 1180120#L491-2 assume !(1 == ~main_clk_pos_edge~0); 1180118#L496-2 assume !(1 == ~main_clk_neg_edge~0); 1180115#L502-4 assume true; 1180116#L502-5 [2024-11-17 08:52:23,076 INFO L747 eck$LassoCheckResult]: Loop: 1180116#L502-5 assume !false; 1186028#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1186045#L146-4 assume true; 1185977#L146-5 assume !false; 1185978#eval_while_0_continue#1 assume true; 1185965#L148-2 assume !(0 == ~N_generate_st~0); 1185966#L151-2 assume !(0 == ~S1_addsub_st~0); 1185878#L154-2 assume !(0 == ~S2_presdbl_st~0); 1185613#L157-2 assume !(0 == ~S3_zero_st~0); 1185614#L160-2 assume !(0 == ~D_print_st~0); 1185605#L163-2 assume true; 1185606#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1185592#L509-2 assume !(1 == ~main_in1_req_up~0); 1185591#L520-2 assume !(1 == ~main_in2_req_up~0); 1185867#L531-2 assume !(1 == ~main_sum_req_up~0); 1185865#L542-2 assume !(1 == ~main_diff_req_up~0); 1185862#L553-2 assume !(1 == ~main_pres_req_up~0); 1185858#L564-2 assume !(1 == ~main_dbl_req_up~0); 1185853#L575-2 assume !(1 == ~main_zero_req_up~0); 1185846#L586-2 assume !(1 == ~main_clk_req_up~0); 1185847#L604-2 start_simulation_~kernel_st~0#1 := 3; 1186086#L605-2 assume !(0 == ~main_in1_ev~0); 1186085#L610-2 assume !(0 == ~main_in2_ev~0); 1186084#L615-2 assume !(0 == ~main_sum_ev~0); 1186083#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 1186082#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 1186081#L630-2 assume !(0 == ~main_dbl_ev~0); 1186080#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 1186079#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 1186078#L645-2 assume !(0 == ~main_clk_pos_edge~0); 1186077#L650-2 assume !(0 == ~main_clk_neg_edge~0); 1186076#L655-2 assume !(1 == ~main_clk_pos_edge~0); 1186075#L660-2 assume !(1 == ~main_clk_pos_edge~0); 1186074#L665-2 assume !(1 == ~main_clk_pos_edge~0); 1186073#L670-2 assume !(1 == ~main_clk_pos_edge~0); 1186072#L675-2 assume !(1 == ~main_clk_pos_edge~0); 1186071#L680-2 assume !(1 == ~main_in1_ev~0); 1186070#L685-2 assume !(1 == ~main_in2_ev~0); 1186069#L690-2 assume !(1 == ~main_sum_ev~0); 1186068#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 1186067#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 1186066#L705-2 assume !(1 == ~main_dbl_ev~0); 1186065#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 1186064#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 1186063#L720-2 assume !(1 == ~main_clk_pos_edge~0); 1186062#L725-2 assume !(1 == ~main_clk_neg_edge~0); 1186061#L730-2 assume !(0 == ~N_generate_st~0); 1186060#L733-2 assume !(0 == ~S1_addsub_st~0); 1186059#L736-2 assume !(0 == ~S2_presdbl_st~0); 1186058#L739-2 assume 0 == ~S3_zero_st~0; 1186053#L502-4 assume true; 1180116#L502-5 [2024-11-17 08:52:23,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1815971185, now seen corresponding path program 4 times [2024-11-17 08:52:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:23,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999714468] [2024-11-17 08:52:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:23,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:23,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:23,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:23,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2117817946, now seen corresponding path program 1 times [2024-11-17 08:52:23,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:23,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565050812] [2024-11-17 08:52:23,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:23,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565050812] [2024-11-17 08:52:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565050812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164629816] [2024-11-17 08:52:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:23,136 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:52:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:52:23,137 INFO L87 Difference]: Start difference. First operand 140080 states and 237099 transitions. cyclomatic complexity: 97159 Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:24,629 INFO L93 Difference]: Finished difference Result 247526 states and 416613 transitions. [2024-11-17 08:52:24,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247526 states and 416613 transitions. [2024-11-17 08:52:25,410 INFO L131 ngComponentsAnalysis]: Automaton has 119 accepting balls. 140107 [2024-11-17 08:52:26,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247526 states to 247526 states and 416613 transitions. [2024-11-17 08:52:26,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154242 [2024-11-17 08:52:26,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154242 [2024-11-17 08:52:26,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247526 states and 416613 transitions. [2024-11-17 08:52:26,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:26,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247526 states and 416613 transitions. [2024-11-17 08:52:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247526 states and 416613 transitions. [2024-11-17 08:52:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247526 to 247526. [2024-11-17 08:52:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247526 states, 247526 states have (on average 1.6831080371354927) internal successors, (416613), 247525 states have internal predecessors, (416613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247526 states to 247526 states and 416613 transitions. [2024-11-17 08:52:29,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 247526 states and 416613 transitions. [2024-11-17 08:52:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:52:29,896 INFO L425 stractBuchiCegarLoop]: Abstraction has 247526 states and 416613 transitions. [2024-11-17 08:52:29,896 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:52:29,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247526 states and 416613 transitions. [2024-11-17 08:52:30,490 INFO L131 ngComponentsAnalysis]: Automaton has 119 accepting balls. 140107 [2024-11-17 08:52:30,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:30,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:31,110 INFO L148 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:31,110 INFO L149 hiAutomatonCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:31,110 INFO L745 eck$LassoCheckResult]: Stem: 1513357#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~main_in1_val~0 := 0;~main_in1_val_t~0 := 0;~main_in1_ev~0 := 0;~main_in1_req_up~0 := 0;~main_in2_val~0 := 0;~main_in2_val_t~0 := 0;~main_in2_ev~0 := 0;~main_in2_req_up~0 := 0;~main_diff_val~0 := 0;~main_diff_val_t~0 := 0;~main_diff_ev~0 := 0;~main_diff_req_up~0 := 0;~main_sum_val~0 := 0;~main_sum_val_t~0 := 0;~main_sum_ev~0 := 0;~main_sum_req_up~0 := 0;~main_pres_val~0 := 0;~main_pres_val_t~0 := 0;~main_pres_ev~0 := 0;~main_pres_req_up~0 := 0;~main_dbl_val~0 := 0;~main_dbl_val_t~0 := 0;~main_dbl_ev~0 := 0;~main_dbl_req_up~0 := 0;~main_zero_val~0 := 0;~main_zero_val_t~0 := 0;~main_zero_ev~0 := 0;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_val_t~0 := 0;~main_clk_ev~0 := 0;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 0;~main_clk_neg_edge~0 := 0;~N_generate_st~0 := 0;~N_generate_i~0 := 0;~S1_addsub_st~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_st~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_st~0 := 0;~S3_zero_i~0 := 0;~D_z~0 := 0;~D_print_st~0 := 0;~D_print_i~0 := 0; 1512133#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~0#1;havoc main_~count~0#1;havoc main_~__retres2~0#1;~main_in1_ev~0 := 2;~main_in1_req_up~0 := 0;~main_in2_ev~0 := 2;~main_in2_req_up~0 := 0;~main_diff_ev~0 := 2;~main_diff_req_up~0 := 0;~main_sum_ev~0 := 2;~main_sum_req_up~0 := 0;~main_pres_ev~0 := 2;~main_pres_req_up~0 := 0;~main_dbl_ev~0 := 2;~main_dbl_req_up~0 := 0;~main_zero_ev~0 := 2;~main_zero_req_up~0 := 0;~main_clk_val~0 := 0;~main_clk_ev~0 := 2;~main_clk_req_up~0 := 0;~main_clk_pos_edge~0 := 2;~main_clk_neg_edge~0 := 2;main_~count~0#1 := 0;~N_generate_i~0 := 0;~S1_addsub_i~0 := 0;~S2_presdbl_i~0 := 0;~S3_zero_i~0 := 0;~D_print_i~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1512057#L256-2 assume !(1 == ~main_in1_req_up~0); 1512059#L267-2 assume !(1 == ~main_in2_req_up~0); 1536303#L278-2 assume !(1 == ~main_sum_req_up~0); 1536297#L289-2 assume !(1 == ~main_diff_req_up~0); 1536289#L300-2 assume !(1 == ~main_pres_req_up~0); 1536110#L311-2 assume !(1 == ~main_dbl_req_up~0); 1536106#L322-2 assume !(1 == ~main_zero_req_up~0); 1536102#L333-2 assume !(1 == ~main_clk_req_up~0); 1536103#L351-2 assume !(1 == ~N_generate_i~0);~N_generate_st~0 := 2; 1567600#L356-2 assume !(1 == ~S1_addsub_i~0);~S1_addsub_st~0 := 2; 1567710#L361-2 assume !(1 == ~S2_presdbl_i~0);~S2_presdbl_st~0 := 2; 1568024#L366-2 assume !(1 == ~S3_zero_i~0);~S3_zero_st~0 := 2; 1568149#L371-2 assume !(1 == ~D_print_i~0);~D_print_st~0 := 2; 1568147#L376-2 assume !(0 == ~main_in1_ev~0); 1568144#L381-2 assume !(0 == ~main_in2_ev~0); 1568141#L386-2 assume !(0 == ~main_sum_ev~0); 1568138#L391-2 assume !(0 == ~main_diff_ev~0); 1568135#L396-2 assume !(0 == ~main_pres_ev~0); 1568132#L401-2 assume !(0 == ~main_dbl_ev~0); 1568129#L406-2 assume !(0 == ~main_zero_ev~0); 1568126#L411-2 assume !(0 == ~main_clk_ev~0); 1568123#L416-2 assume !(0 == ~main_clk_pos_edge~0); 1568120#L421-2 assume !(0 == ~main_clk_neg_edge~0); 1568117#L426-2 assume !(1 == ~main_clk_pos_edge~0); 1568114#L431-2 assume !(1 == ~main_clk_pos_edge~0); 1568111#L436-2 assume !(1 == ~main_clk_pos_edge~0); 1568108#L441-2 assume !(1 == ~main_clk_pos_edge~0); 1568104#L446-2 assume !(1 == ~main_clk_pos_edge~0); 1568100#L451-2 assume !(1 == ~main_in1_ev~0); 1568096#L456-2 assume !(1 == ~main_in2_ev~0); 1568092#L461-2 assume !(1 == ~main_sum_ev~0); 1568088#L466-2 assume !(1 == ~main_diff_ev~0); 1568084#L471-2 assume !(1 == ~main_pres_ev~0); 1568079#L476-2 assume !(1 == ~main_dbl_ev~0); 1568074#L481-2 assume !(1 == ~main_zero_ev~0); 1568069#L486-2 assume !(1 == ~main_clk_ev~0); 1568064#L491-2 assume !(1 == ~main_clk_pos_edge~0); 1568059#L496-2 assume !(1 == ~main_clk_neg_edge~0); 1568052#L502-4 assume true; 1568053#L502-5 [2024-11-17 08:52:31,110 INFO L747 eck$LassoCheckResult]: Loop: 1568053#L502-5 assume !false; 1666034#start_simulation_while_1_continue#1 assume true;start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1666032#L146-4 assume true; 1665992#L146-5 assume !false; 1665993#eval_while_0_continue#1 assume true; 1665976#L148-2 assume !(0 == ~N_generate_st~0); 1665789#L151-2 assume !(0 == ~S1_addsub_st~0); 1665790#L154-2 assume !(0 == ~S2_presdbl_st~0); 1665778#L157-2 assume !(0 == ~S3_zero_st~0); 1665772#L160-2 assume !(0 == ~D_print_st~0); 1665767#L163-2 assume true; 1665760#L248-2 assume true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1665754#L509-2 assume !(1 == ~main_in1_req_up~0); 1665748#L520-2 assume !(1 == ~main_in2_req_up~0); 1665749#L531-2 assume !(1 == ~main_sum_req_up~0); 1665780#L542-2 assume !(1 == ~main_diff_req_up~0); 1665775#L553-2 assume !(1 == ~main_pres_req_up~0); 1665769#L564-2 assume !(1 == ~main_dbl_req_up~0); 1665765#L575-2 assume !(1 == ~main_zero_req_up~0); 1665758#L586-2 assume !(1 == ~main_clk_req_up~0); 1665752#L604-2 start_simulation_~kernel_st~0#1 := 3; 1665747#L605-2 assume !(0 == ~main_in1_ev~0); 1665741#L610-2 assume !(0 == ~main_in2_ev~0); 1665735#L615-2 assume !(0 == ~main_sum_ev~0); 1665728#L620-2 assume 0 == ~main_diff_ev~0;~main_diff_ev~0 := 1; 1665721#L625-2 assume 0 == ~main_pres_ev~0;~main_pres_ev~0 := 1; 1665713#L630-2 assume !(0 == ~main_dbl_ev~0); 1665701#L635-2 assume 0 == ~main_zero_ev~0;~main_zero_ev~0 := 1; 1665693#L640-2 assume 0 == ~main_clk_ev~0;~main_clk_ev~0 := 1; 1665688#L645-2 assume !(0 == ~main_clk_pos_edge~0); 1665685#L650-2 assume !(0 == ~main_clk_neg_edge~0); 1665680#L655-2 assume !(1 == ~main_clk_pos_edge~0); 1665674#L660-2 assume !(1 == ~main_clk_pos_edge~0); 1665671#L665-2 assume !(1 == ~main_clk_pos_edge~0); 1665667#L670-2 assume !(1 == ~main_clk_pos_edge~0); 1665664#L675-2 assume !(1 == ~main_clk_pos_edge~0); 1665659#L680-2 assume !(1 == ~main_in1_ev~0); 1665655#L685-2 assume !(1 == ~main_in2_ev~0); 1665651#L690-2 assume !(1 == ~main_sum_ev~0); 1665646#L695-2 assume 1 == ~main_diff_ev~0;~main_diff_ev~0 := 2; 1665564#L700-2 assume 1 == ~main_pres_ev~0;~main_pres_ev~0 := 2; 1665561#L705-2 assume !(1 == ~main_dbl_ev~0); 1665555#L710-2 assume 1 == ~main_zero_ev~0;~main_zero_ev~0 := 2; 1665552#L715-2 assume 1 == ~main_clk_ev~0;~main_clk_ev~0 := 2; 1665550#L720-2 assume !(1 == ~main_clk_pos_edge~0); 1665548#L725-2 assume !(1 == ~main_clk_neg_edge~0); 1665546#L730-2 assume !(0 == ~N_generate_st~0); 1665472#L733-2 assume !(0 == ~S1_addsub_st~0); 1665468#L736-2 assume !(0 == ~S2_presdbl_st~0); 1665464#L739-2 assume !(0 == ~S3_zero_st~0); 1665459#L742-2 assume 0 == ~D_print_st~0; 1665460#L502-4 assume true; 1568053#L502-5 [2024-11-17 08:52:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1815971185, now seen corresponding path program 5 times [2024-11-17 08:52:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319646118] [2024-11-17 08:52:31,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:31,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:31,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:31,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1227843745, now seen corresponding path program 1 times [2024-11-17 08:52:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:31,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340384143] [2024-11-17 08:52:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:52:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340384143] [2024-11-17 08:52:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340384143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:52:31,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:52:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:52:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726908331] [2024-11-17 08:52:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:52:31,197 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:52:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:52:31,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:52:31,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:52:31,201 INFO L87 Difference]: Start difference. First operand 247526 states and 416613 transitions. cyclomatic complexity: 169307 Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:52:32,227 INFO L93 Difference]: Finished difference Result 448434 states and 748003 transitions. [2024-11-17 08:52:32,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 448434 states and 748003 transitions. [2024-11-17 08:52:34,702 INFO L131 ngComponentsAnalysis]: Automaton has 189 accepting balls. 250494 [2024-11-17 08:52:35,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 448434 states to 448434 states and 748003 transitions. [2024-11-17 08:52:35,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279521 [2024-11-17 08:52:35,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279521 [2024-11-17 08:52:35,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 448434 states and 748003 transitions. [2024-11-17 08:52:35,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:35,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 448434 states and 748003 transitions. [2024-11-17 08:52:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448434 states and 748003 transitions.