./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme --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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:55:51,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:55:51,221 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 11:55:51,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:55:51,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:55:51,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:55:51,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:55:51,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:55:51,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:55:51,263 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:55:51,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:55:51,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:55:51,265 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:55:51,266 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 11:55:51,267 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 11:55:51,267 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 11:55:51,268 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 11:55:51,269 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 11:55:51,269 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 11:55:51,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:55:51,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 11:55:51,271 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:55:51,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:55:51,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:55:51,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:55:51,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 11:55:51,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 11:55:51,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 11:55:51,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:55:51,276 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:55:51,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:55:51,277 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 11:55:51,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:55:51,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:55:51,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:55:51,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:55:51,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:55:51,281 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 11:55:51,282 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2023-11-26 11:55:51,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:55:51,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:55:51,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:55:51,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:55:51,635 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:55:51,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2023-11-26 11:55:54,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:55:55,117 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:55:55,118 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2023-11-26 11:55:55,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/data/bcdadeec9/4a74a0dd55c84ee38796e1b8873b8982/FLAG213a4addb [2023-11-26 11:55:55,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/data/bcdadeec9/4a74a0dd55c84ee38796e1b8873b8982 [2023-11-26 11:55:55,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:55:55,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:55:55,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:55:55,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:55:55,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:55:55,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c73a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55, skipping insertion in model container [2023-11-26 11:55:55,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:55:55,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:55:55,517 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:55:55,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:55:55,607 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:55:55,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55 WrapperNode [2023-11-26 11:55:55,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:55:55,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:55:55,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:55:55,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:55:55,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,681 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 417 [2023-11-26 11:55:55,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:55:55,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:55:55,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:55:55,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:55:55,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,728 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]. [2023-11-26 11:55:55,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:55:55,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:55:55,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:55:55,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:55:55,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (1/1) ... [2023-11-26 11:55:55,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:55:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:55:55,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:55:55,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 11:55:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:55:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:55:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:55:55,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:55:56,066 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:55:56,069 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:55:56,704 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:55:56,719 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:55:56,719 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:55:56,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:55:56 BoogieIcfgContainer [2023-11-26 11:55:56,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:55:56,726 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 11:55:56,726 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 11:55:56,730 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 11:55:56,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:55:56,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 11:55:55" (1/3) ... [2023-11-26 11:55:56,733 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d4cba17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:55:56, skipping insertion in model container [2023-11-26 11:55:56,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:55:56,734 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:55" (2/3) ... [2023-11-26 11:55:56,734 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d4cba17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:55:56, skipping insertion in model container [2023-11-26 11:55:56,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:55:56,735 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:55:56" (3/3) ... [2023-11-26 11:55:56,736 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2023-11-26 11:55:56,799 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 11:55:56,800 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 11:55:56,800 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 11:55:56,800 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 11:55:56,801 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 11:55:56,801 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 11:55:56,801 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 11:55:56,801 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 11:55:56,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 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) [2023-11-26 11:55:56,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2023-11-26 11:55:56,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:56,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:56,845 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] [2023-11-26 11:55:56,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:56,845 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 11:55:56,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 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) [2023-11-26 11:55:56,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2023-11-26 11:55:56,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:56,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:56,857 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] [2023-11-26 11:55:56,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:56,867 INFO L748 eck$LassoCheckResult]: Stem: 31#$Ultimate##0true 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 29#L241true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 25#L244-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 48#L254true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 51#L257-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 23#L267true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 11#L270-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 90#L280true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 70#L283-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 106#L293true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 69#L296-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 114#L306true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 16#L309-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 120#L319true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 96#L319-1true init_#res#1 := init_~tmp___5~0#1; 86#init_returnLabel#1true main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 39#L22true assume !(0 == assume_abort_if_not_~cond#1); 92#L21true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 18#L512-2true [2023-11-26 11:55:56,869 INFO L750 eck$LassoCheckResult]: Loop: 18#L512-2true assume !false;assume { :begin_inline_node1 } true; 49#L79true assume !(0 != ~mode1~0 % 256); 113#L107true assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 107#L107-1true ~mode1~0 := 1; 37#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 84#L125true assume !(0 != ~mode2~0 % 256); 7#L153true assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 81#L153-1true ~mode2~0 := 1; 73#L125-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 99#L171true assume !(0 != ~mode3~0 % 256); 44#L199true assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 119#L199-1true ~mode3~0 := 1; 77#L171-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 53#L412true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 87#L412-1true check_#res#1 := check_~tmp~1#1; 14#check_returnLabel#1true main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 76#L541true assume !(0 == assert_~arg#1 % 256); 64#L536true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 18#L512-2true [2023-11-26 11:55:56,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2023-11-26 11:55:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186226115] [2023-11-26 11:55:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:55:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:57,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186226115] [2023-11-26 11:55:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186226115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:55:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069763449] [2023-11-26 11:55:57,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:57,276 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:55:57,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -409676988, now seen corresponding path program 1 times [2023-11-26 11:55:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:57,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224037000] [2023-11-26 11:55:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:55:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224037000] [2023-11-26 11:55:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224037000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:55:57,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257466184] [2023-11-26 11:55:57,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:57,499 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:55:57,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:55:57,548 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-26 11:55:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:57,638 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2023-11-26 11:55:57,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 201 transitions. [2023-11-26 11:55:57,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-26 11:55:57,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 189 transitions. [2023-11-26 11:55:57,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2023-11-26 11:55:57,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2023-11-26 11:55:57,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 189 transitions. [2023-11-26 11:55:57,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:57,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 189 transitions. [2023-11-26 11:55:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 189 transitions. [2023-11-26 11:55:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-26 11:55:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6725663716814159) internal successors, (189), 112 states have internal predecessors, (189), 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) [2023-11-26 11:55:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 189 transitions. [2023-11-26 11:55:57,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 189 transitions. [2023-11-26 11:55:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:55:57,727 INFO L428 stractBuchiCegarLoop]: Abstraction has 113 states and 189 transitions. [2023-11-26 11:55:57,727 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 11:55:57,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 189 transitions. [2023-11-26 11:55:57,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-26 11:55:57,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:57,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:57,735 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] [2023-11-26 11:55:57,736 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] [2023-11-26 11:55:57,736 INFO L748 eck$LassoCheckResult]: Stem: 306#$Ultimate##0 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 303#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 263#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 300#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 309#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 296#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 269#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 275#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 344#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 353#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 311#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 352#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 282#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 283#L319 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 257#L319-1 init_#res#1 := init_~tmp___5~0#1; 360#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 317#L22 assume !(0 == assume_abort_if_not_~cond#1); 318#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 285#L512-2 [2023-11-26 11:55:57,737 INFO L750 eck$LassoCheckResult]: Loop: 285#L512-2 assume !false;assume { :begin_inline_node1 } true; 286#L79 assume !(0 != ~mode1~0 % 256); 331#L107 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 362#L107-1 ~mode1~0 := 1; 315#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 316#L125 assume !(0 != ~mode2~0 % 256); 265#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 266#L153-1 ~mode2~0 := 1; 261#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 356#L171 assume !(0 != ~mode3~0 % 256); 323#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 325#L199-1 ~mode3~0 := 1; 342#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 336#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 337#L413 assume ~st1~0 + ~nl1~0 <= 1; 367#L414 assume ~st2~0 + ~nl2~0 <= 1; 365#L415 assume ~st3~0 + ~nl3~0 <= 1; 279#L416 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 259#$Ultimate##238 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 321#$Ultimate##242 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 347#$Ultimate##246 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 278#L412-1 check_#res#1 := check_~tmp~1#1; 280#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 281#L541 assume !(0 == assert_~arg#1 % 256); 349#L536 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 285#L512-2 [2023-11-26 11:55:57,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2023-11-26 11:55:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715989954] [2023-11-26 11:55:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:55:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715989954] [2023-11-26 11:55:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715989954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:55:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137167872] [2023-11-26 11:55:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:57,981 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-26 11:55:57,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2071533962, now seen corresponding path program 1 times [2023-11-26 11:55:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824426384] [2023-11-26 11:55:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:55:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824426384] [2023-11-26 11:55:58,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824426384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:58,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450380350] [2023-11-26 11:55:58,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:58,063 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:58,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:58,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:55:58,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:55:58,066 INFO L87 Difference]: Start difference. First operand 113 states and 189 transitions. cyclomatic complexity: 77 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2023-11-26 11:55:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:58,164 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2023-11-26 11:55:58,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 191 transitions. [2023-11-26 11:55:58,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-26 11:55:58,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 113 states and 168 transitions. [2023-11-26 11:55:58,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2023-11-26 11:55:58,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2023-11-26 11:55:58,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 168 transitions. [2023-11-26 11:55:58,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:58,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 168 transitions. [2023-11-26 11:55:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 168 transitions. [2023-11-26 11:55:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-26 11:55:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 112 states have internal predecessors, (168), 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) [2023-11-26 11:55:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2023-11-26 11:55:58,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 168 transitions. [2023-11-26 11:55:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:55:58,180 INFO L428 stractBuchiCegarLoop]: Abstraction has 113 states and 168 transitions. [2023-11-26 11:55:58,180 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 11:55:58,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 168 transitions. [2023-11-26 11:55:58,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2023-11-26 11:55:58,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:58,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:58,188 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] [2023-11-26 11:55:58,190 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] [2023-11-26 11:55:58,191 INFO L748 eck$LassoCheckResult]: Stem: 547#$Ultimate##0 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 544#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 504#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 541#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 550#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 537#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 510#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 516#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 585#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 594#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 552#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 593#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 523#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 524#L319 assume ~id1~0 != ~id2~0; 598#L320 assume ~id1~0 != ~id3~0; 586#L321 assume ~id2~0 != ~id3~0; 587#L322 assume ~id1~0 >= 0; 497#L323 assume ~id2~0 >= 0; 498#L324 assume ~id3~0 >= 0; 517#L325 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 543#L326 assume 0 == (if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296); 526#L327 assume 0 == (if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296); 527#L328 assume ~max1~0 == ~id1~0; 554#L329 assume ~max2~0 == ~id2~0; 555#L330 assume ~max3~0 == ~id3~0; 514#L331 assume 0 == ~st1~0; 515#L332 assume 0 == ~st2~0; 542#L333 assume 0 == ~st3~0; 553#L334 assume 0 == ~nl1~0; 532#L335 assume 0 == ~nl2~0; 533#L336 assume 0 == ~nl3~0; 596#L337 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 567#L338 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 568#L339 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 605#L319-1 init_#res#1 := init_~tmp___5~0#1; 601#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 558#L22 assume !(0 == assume_abort_if_not_~cond#1); 559#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 528#L512-2 [2023-11-26 11:55:58,199 INFO L750 eck$LassoCheckResult]: Loop: 528#L512-2 assume !false;assume { :begin_inline_node1 } true; 529#L79 assume !(0 != ~mode1~0 % 256); 572#L107 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 603#L107-1 ~mode1~0 := 1; 556#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 557#L125 assume !(0 != ~mode2~0 % 256); 506#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 507#L153-1 ~mode2~0 := 1; 502#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 597#L171 assume !(0 != ~mode3~0 % 256); 564#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 566#L199-1 ~mode3~0 := 1; 583#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 577#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 578#L413 assume ~st1~0 + ~nl1~0 <= 1; 609#L414 assume ~st2~0 + ~nl2~0 <= 1; 607#L415 assume ~st3~0 + ~nl3~0 <= 1; 520#L416 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 500#$Ultimate##238 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 562#$Ultimate##242 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 588#$Ultimate##246 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 519#L412-1 check_#res#1 := check_~tmp~1#1; 521#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 522#L541 assume !(0 == assert_~arg#1 % 256); 590#L536 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 528#L512-2 [2023-11-26 11:55:58,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2023-11-26 11:55:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198627667] [2023-11-26 11:55:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:58,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:58,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:58,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2071533962, now seen corresponding path program 2 times [2023-11-26 11:55:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132314624] [2023-11-26 11:55:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:58,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:55:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:58,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132314624] [2023-11-26 11:55:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132314624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:58,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:58,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836738685] [2023-11-26 11:55:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:58,404 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:55:58,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:55:58,406 INFO L87 Difference]: Start difference. First operand 113 states and 168 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2023-11-26 11:55:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:58,471 INFO L93 Difference]: Finished difference Result 163 states and 242 transitions. [2023-11-26 11:55:58,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 242 transitions. [2023-11-26 11:55:58,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2023-11-26 11:55:58,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 163 states and 242 transitions. [2023-11-26 11:55:58,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2023-11-26 11:55:58,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2023-11-26 11:55:58,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 242 transitions. [2023-11-26 11:55:58,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:58,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 242 transitions. [2023-11-26 11:55:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 242 transitions. [2023-11-26 11:55:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2023-11-26 11:55:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 1.484472049689441) internal successors, (239), 160 states have internal predecessors, (239), 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) [2023-11-26 11:55:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 239 transitions. [2023-11-26 11:55:58,508 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 239 transitions. [2023-11-26 11:55:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:55:58,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 161 states and 239 transitions. [2023-11-26 11:55:58,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 11:55:58,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 239 transitions. [2023-11-26 11:55:58,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2023-11-26 11:55:58,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:58,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:58,520 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] [2023-11-26 11:55:58,520 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] [2023-11-26 11:55:58,521 INFO L748 eck$LassoCheckResult]: Stem: 830#$Ultimate##0 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 827#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 786#L244-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 824#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 833#L257-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 820#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 792#L270-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 798#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 867#L283-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 876#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 835#L296-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 875#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 806#L309-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 807#L319 assume ~id1~0 != ~id2~0; 882#L320 assume ~id1~0 != ~id3~0; 868#L321 assume ~id2~0 != ~id3~0; 869#L322 assume ~id1~0 >= 0; 779#L323 assume ~id2~0 >= 0; 780#L324 assume ~id3~0 >= 0; 799#L325 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 826#L326 assume 0 == (if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296); 811#L327 assume 0 == (if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296); 812#L328 assume ~max1~0 == ~id1~0; 837#L329 assume ~max2~0 == ~id2~0; 838#L330 assume ~max3~0 == ~id3~0; 796#L331 assume 0 == ~st1~0; 797#L332 assume 0 == ~st2~0; 825#L333 assume 0 == ~st3~0; 836#L334 assume 0 == ~nl1~0; 815#L335 assume 0 == ~nl2~0; 816#L336 assume 0 == ~nl3~0; 878#L337 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 849#L338 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 850#L339 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 890#L319-1 init_#res#1 := init_~tmp___5~0#1; 886#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 841#L22 assume !(0 == assume_abort_if_not_~cond#1); 842#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 809#L512-2 [2023-11-26 11:55:58,521 INFO L750 eck$LassoCheckResult]: Loop: 809#L512-2 assume !false;assume { :begin_inline_node1 } true; 810#L79 assume !(0 != ~mode1~0 % 256); 853#L107 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 813#L108 assume 0 != ~ep12~0 % 256;~p12_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 - 256); 814#L108-2 assume 0 != ~ep13~0 % 256;~p13_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 - 256); 888#L107-1 ~mode1~0 := 1; 839#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 840#L125 assume !(0 != ~mode2~0 % 256); 788#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 789#L153-1 ~mode2~0 := 1; 784#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 879#L171 assume !(0 != ~mode3~0 % 256); 893#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 900#L199-1 ~mode3~0 := 1; 865#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 859#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 860#L413 assume ~st1~0 + ~nl1~0 <= 1; 896#L414 assume ~st2~0 + ~nl2~0 <= 1; 897#L415 assume ~st3~0 + ~nl3~0 <= 1; 901#L416 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2); 781#L419 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 782#$Ultimate##238 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 902#$Ultimate##242 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2); 880#L429 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 881#$Ultimate##246 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 885#L412-1 check_#res#1 := check_~tmp~1#1; 802#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 803#L541 assume !(0 == assert_~arg#1 % 256); 870#L536 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 809#L512-2 [2023-11-26 11:55:58,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2023-11-26 11:55:58,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:58,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556189693] [2023-11-26 11:55:58,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:58,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:58,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:58,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:58,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 170677582, now seen corresponding path program 1 times [2023-11-26 11:55:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267254385] [2023-11-26 11:55:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:58,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:58,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:58,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1879753607, now seen corresponding path program 1 times [2023-11-26 11:55:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515987077] [2023-11-26 11:55:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:55:58,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:58,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515987077] [2023-11-26 11:55:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515987077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633684775] [2023-11-26 11:55:58,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:01,208 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 11:56:01,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 11:56:01,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 11:56:01,209 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 11:56:01,210 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-26 11:56:01,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:56:01,210 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 11:56:01,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 11:56:01,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2023-11-26 11:56:01,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 11:56:01,211 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 11:56:01,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:01,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:02,982 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2023-11-26 11:56:03,191 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 5799 conjunctions. This might take some time... [2023-11-26 11:56:04,829 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions. [2023-11-26 11:56:40,810 WARN L293 SmtUtils]: Spent 35.86s on a formula simplification. DAG size of input: 825 DAG size of output: 136 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-11-26 11:56:40,893 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-26 11:56:40,894 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-26 11:56:40,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:56:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:40,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:56:40,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-26 11:56:40,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 11:56:40,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 11:56:40,939 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-26 11:56:40,940 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=229} Honda state: {~ep12~0=229} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-26 11:56:40,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:56:40,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:56:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:40,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:56:40,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-26 11:56:40,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-26 11:56:40,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 11:56:40,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:56:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:56:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:40,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:56:40,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-26 11:56:40,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-26 11:56:40,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-26 11:56:41,143 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-26 11:56:41,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b3620ba-6709-485d-affe-e8bb8fef6056/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:56:41,148 INFO L210 LassoAnalysis]: Preferences: [2023-11-26 11:56:41,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-26 11:56:41,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-26 11:56:41,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-26 11:56:41,148 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-26 11:56:41,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:56:41,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-26 11:56:41,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-26 11:56:41,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2023-11-26 11:56:41,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-26 11:56:41,149 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-26 11:56:41,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:41,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-26 11:56:42,852 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2023-11-26 11:56:43,066 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 6978 conjunctions. This might take some time... [2023-11-26 11:56:44,753 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions.