./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 803cd42f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-23 03:00:22,687 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-23 03:00:22,733 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-23 03:00:22,736 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-23 03:00:22,736 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-23 03:00:22,757 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-23 03:00:22,758 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-23 03:00:22,758 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-23 03:00:22,759 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-23 03:00:22,760 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-23 03:00:22,761 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-23 03:00:22,761 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-23 03:00:22,761 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-23 03:00:22,762 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-23 03:00:22,762 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-11-23 03:00:22,762 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-11-23 03:00:22,765 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-11-23 03:00:22,765 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-11-23 03:00:22,766 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-23 03:00:22,766 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-23 03:00:22,766 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-11-23 03:00:22,766 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-23 03:00:22,766 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-23 03:00:22,767 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-23 03:00:22,768 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-23 03:00:22,768 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-11-23 03:00:22,768 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-23 03:00:22,768 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-23 03:00:22,768 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-23 03:00:22,768 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-23 03:00:22,768 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-23 03:00:22,769 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-23 03:00:22,769 INFO  L153        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901
[2024-11-23 03:00:22,971 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-23 03:00:23,013 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-23 03:00:23,015 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-23 03:00:23,016 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-23 03:00:23,017 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-23 03:00:23,018 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c
[2024-11-23 03:00:24,177 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-23 03:00:24,385 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-23 03:00:24,386 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c
[2024-11-23 03:00:24,396 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1434332/676f7242dbbf42ccab9dbd8b0c1a78f6/FLAGd63e95169
[2024-11-23 03:00:24,768 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1434332/676f7242dbbf42ccab9dbd8b0c1a78f6
[2024-11-23 03:00:24,771 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-23 03:00:24,772 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-23 03:00:24,773 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-23 03:00:24,773 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-23 03:00:24,777 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-23 03:00:24,777 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:00:24" (1/1) ...
[2024-11-23 03:00:24,778 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@846f3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:24, skipping insertion in model container
[2024-11-23 03:00:24,778 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:00:24" (1/1) ...
[2024-11-23 03:00:24,800 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-23 03:00:24,993 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-23 03:00:25,001 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-23 03:00:25,025 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-23 03:00:25,046 INFO  L204         MainTranslator]: Completed translation
[2024-11-23 03:00:25,047 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25 WrapperNode
[2024-11-23 03:00:25,047 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-23 03:00:25,048 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-23 03:00:25,048 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-23 03:00:25,048 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-23 03:00:25,053 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,058 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,076 INFO  L138                Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 211
[2024-11-23 03:00:25,076 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-23 03:00:25,077 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-23 03:00:25,077 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-23 03:00:25,077 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-23 03:00:25,085 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,085 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,090 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,100 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-23 03:00:25,101 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,101 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,104 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,107 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,108 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,109 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,110 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-23 03:00:25,111 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-23 03:00:25,111 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-23 03:00:25,111 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-23 03:00:25,112 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (1/1) ...
[2024-11-23 03:00:25,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-23 03:00:25,128 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-23 03:00:25,142 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-23 03:00:25,144 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-23 03:00:25,176 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-23 03:00:25,176 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-23 03:00:25,177 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-23 03:00:25,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-23 03:00:25,238 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-23 03:00:25,239 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-23 03:00:25,456 INFO  L?                        ?]: Removed 28 outVars from TransFormulas that were not future-live.
[2024-11-23 03:00:25,456 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-23 03:00:25,465 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-23 03:00:25,466 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-23 03:00:25,466 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:00:25 BoogieIcfgContainer
[2024-11-23 03:00:25,466 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-23 03:00:25,467 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-23 03:00:25,467 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-11-23 03:00:25,470 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-11-23 03:00:25,470 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-23 03:00:25,470 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:00:24" (1/3) ...
[2024-11-23 03:00:25,471 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4547031c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:00:25, skipping insertion in model container
[2024-11-23 03:00:25,471 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-23 03:00:25,471 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:00:25" (2/3) ...
[2024-11-23 03:00:25,471 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4547031c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:00:25, skipping insertion in model container
[2024-11-23 03:00:25,471 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-23 03:00:25,472 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:00:25" (3/3) ...
[2024-11-23 03:00:25,472 INFO  L332   chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c
[2024-11-23 03:00:25,513 INFO  L300   stractBuchiCegarLoop]: Interprodecural is true
[2024-11-23 03:00:25,513 INFO  L301   stractBuchiCegarLoop]: Hoare is None
[2024-11-23 03:00:25,514 INFO  L302   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-23 03:00:25,514 INFO  L303   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-23 03:00:25,514 INFO  L304   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-23 03:00:25,514 INFO  L305   stractBuchiCegarLoop]: Difference is false
[2024-11-23 03:00:25,514 INFO  L306   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-23 03:00:25,515 INFO  L310   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-23 03:00:25,518 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:25,530 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 30
[2024-11-23 03:00:25,531 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-23 03:00:25,531 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-23 03:00:25,535 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:25,535 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:25,536 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-23 03:00:25,536 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:25,539 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 30
[2024-11-23 03:00:25,539 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-23 03:00:25,539 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-23 03:00:25,539 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:25,539 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:25,546 INFO  L745   eck$LassoCheckResult]: Stem: 24#$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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 33#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 39#L129true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 35#L129-1true init_#res#1 := init_~tmp~0#1; 17#init_returnLabel#1true main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 54#L246true assume !(0 == main_~i2~0#1); 9#L246-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 22#L254-2true 
[2024-11-23 03:00:25,550 INFO  L747   eck$LassoCheckResult]: Loop: 22#L254-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 3#L54true assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 7#L54-2true havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 5#L80true assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 15#L80-2true havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 13#L105true assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 34#L105-2true havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 14#L202true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 27#L202-1true check_#res#1 := check_~tmp~1#1; 12#check_returnLabel#1true main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 56#L278true assume !(0 == assert_~arg#1 % 256); 50#L273true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 22#L254-2true 
[2024-11-23 03:00:25,556 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:25,556 INFO  L85        PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times
[2024-11-23 03:00:25,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:25,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924408887]
[2024-11-23 03:00:25,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 03:00:25,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:25,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 03:00:25,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 03:00:25,888 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 03:00:25,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924408887]
[2024-11-23 03:00:25,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924408887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 03:00:25,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 03:00:25,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 03:00:25,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469137915]
[2024-11-23 03:00:25,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 03:00:25,894 INFO  L750   eck$LassoCheckResult]: stem already infeasible
[2024-11-23 03:00:25,894 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:25,894 INFO  L85        PathProgramCache]: Analyzing trace with hash 317704966, now seen corresponding path program 1 times
[2024-11-23 03:00:25,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:25,895 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450006777]
[2024-11-23 03:00:25,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 03:00:25,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:25,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 03:00:26,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 03:00:26,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 03:00:26,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450006777]
[2024-11-23 03:00:26,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450006777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 03:00:26,100 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 03:00:26,100 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 03:00:26,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524431392]
[2024-11-23 03:00:26,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 03:00:26,104 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-23 03:00:26,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 03:00:26,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 03:00:26,131 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 03:00:26,133 INFO  L87              Difference]: Start difference. First operand  has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:26,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 03:00:26,197 INFO  L93              Difference]: Finished difference Result 87 states and 136 transitions.
[2024-11-23 03:00:26,198 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 136 transitions.
[2024-11-23 03:00:26,201 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2024-11-23 03:00:26,204 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 78 states and 112 transitions.
[2024-11-23 03:00:26,206 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 78
[2024-11-23 03:00:26,207 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 78
[2024-11-23 03:00:26,207 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 78 states and 112 transitions.
[2024-11-23 03:00:26,209 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-23 03:00:26,209 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 78 states and 112 transitions.
[2024-11-23 03:00:26,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states and 112 transitions.
[2024-11-23 03:00:26,229 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50.
[2024-11-23 03:00:26,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 50 states have (on average 1.34) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:26,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions.
[2024-11-23 03:00:26,232 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions.
[2024-11-23 03:00:26,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-23 03:00:26,235 INFO  L425   stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions.
[2024-11-23 03:00:26,235 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-23 03:00:26,235 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions.
[2024-11-23 03:00:26,236 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2024-11-23 03:00:26,236 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-23 03:00:26,236 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-23 03:00:26,238 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]
[2024-11-23 03:00:26,238 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:26,239 INFO  L745   eck$LassoCheckResult]: Stem: 189#$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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 190#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 196#L129 assume 0 == ~r1~0; 202#L130 assume ~id1~0 >= 0; 200#L131 assume 0 == ~st1~0; 201#L132 assume ~send1~0 == ~id1~0; 197#L133 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 198#L134 assume ~id2~0 >= 0; 195#L135 assume 0 == ~st2~0; 173#L136 assume ~send2~0 == ~id2~0; 174#L137 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 206#L138 assume ~id3~0 >= 0; 187#L139 assume 0 == ~st3~0; 188#L140 assume ~send3~0 == ~id3~0; 203#L141 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 192#L142 assume ~id1~0 != ~id2~0; 191#L143 assume ~id1~0 != ~id3~0; 160#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 161#L129-1 init_#res#1 := init_~tmp~0#1; 182#init_returnLabel#1 main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 183#L246 assume !(0 == main_~i2~0#1); 169#L246-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 170#L254-2 
[2024-11-23 03:00:26,239 INFO  L747   eck$LassoCheckResult]: Loop: 170#L254-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 157#L54 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 159#L54-2 havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 162#L80 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 164#L80-2 havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 177#L105 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 172#L105-2 havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 179#L202 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 167#L202-1 check_#res#1 := check_~tmp~1#1; 175#check_returnLabel#1 main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 176#L278 assume !(0 == assert_~arg#1 % 256); 205#L273 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 170#L254-2 
[2024-11-23 03:00:26,239 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,239 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times
[2024-11-23 03:00:26,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294542980]
[2024-11-23 03:00:26,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 03:00:26,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,269 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 03:00:26,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,312 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 03:00:26,313 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,313 INFO  L85        PathProgramCache]: Analyzing trace with hash 317704966, now seen corresponding path program 2 times
[2024-11-23 03:00:26,313 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282211325]
[2024-11-23 03:00:26,314 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 03:00:26,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,329 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 03:00:26,329 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-23 03:00:26,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 03:00:26,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 03:00:26,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282211325]
[2024-11-23 03:00:26,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282211325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 03:00:26,432 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 03:00:26,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-23 03:00:26,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196401354]
[2024-11-23 03:00:26,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 03:00:26,432 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-23 03:00:26,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 03:00:26,433 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-23 03:00:26,433 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-23 03:00:26,433 INFO  L87              Difference]: Start difference. First operand 50 states and 67 transitions. cyclomatic complexity: 18 Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:26,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 03:00:26,455 INFO  L93              Difference]: Finished difference Result 53 states and 69 transitions.
[2024-11-23 03:00:26,455 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions.
[2024-11-23 03:00:26,457 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2024-11-23 03:00:26,457 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions.
[2024-11-23 03:00:26,457 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 50
[2024-11-23 03:00:26,457 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 50
[2024-11-23 03:00:26,458 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions.
[2024-11-23 03:00:26,458 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-23 03:00:26,458 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions.
[2024-11-23 03:00:26,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions.
[2024-11-23 03:00:26,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2024-11-23 03:00:26,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:26,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions.
[2024-11-23 03:00:26,465 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions.
[2024-11-23 03:00:26,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-23 03:00:26,466 INFO  L425   stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions.
[2024-11-23 03:00:26,466 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-23 03:00:26,466 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions.
[2024-11-23 03:00:26,467 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2024-11-23 03:00:26,467 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-23 03:00:26,467 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-23 03:00:26,468 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]
[2024-11-23 03:00:26,468 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:26,468 INFO  L745   eck$LassoCheckResult]: Stem: 300#$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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 301#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 307#L129 assume 0 == ~r1~0; 313#L130 assume ~id1~0 >= 0; 311#L131 assume 0 == ~st1~0; 312#L132 assume ~send1~0 == ~id1~0; 308#L133 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 309#L134 assume ~id2~0 >= 0; 306#L135 assume 0 == ~st2~0; 284#L136 assume ~send2~0 == ~id2~0; 285#L137 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 317#L138 assume ~id3~0 >= 0; 298#L139 assume 0 == ~st3~0; 299#L140 assume ~send3~0 == ~id3~0; 314#L141 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 303#L142 assume ~id1~0 != ~id2~0; 302#L143 assume ~id1~0 != ~id3~0; 271#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 272#L129-1 init_#res#1 := init_~tmp~0#1; 293#init_returnLabel#1 main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 294#L246 assume !(0 == main_~i2~0#1); 280#L246-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 281#L254-2 
[2024-11-23 03:00:26,468 INFO  L747   eck$LassoCheckResult]: Loop: 281#L254-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 268#L54 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 270#L54-2 havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 273#L80 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 275#L80-2 havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 288#L105 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 283#L105-2 havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 290#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 291#L203 assume ~r1~0 >= 3; 277#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 278#L202-1 check_#res#1 := check_~tmp~1#1; 286#check_returnLabel#1 main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 287#L278 assume !(0 == assert_~arg#1 % 256); 316#L273 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 281#L254-2 
[2024-11-23 03:00:26,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times
[2024-11-23 03:00:26,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015152978]
[2024-11-23 03:00:26,469 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-23 03:00:26,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,492 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-23 03:00:26,493 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-23 03:00:26,493 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 03:00:26,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,509 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 03:00:26,509 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,510 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044091434, now seen corresponding path program 1 times
[2024-11-23 03:00:26,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171468704]
[2024-11-23 03:00:26,510 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 03:00:26,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-23 03:00:26,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-23 03:00:26,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-23 03:00:26,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171468704]
[2024-11-23 03:00:26,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171468704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-23 03:00:26,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-23 03:00:26,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-23 03:00:26,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275597693]
[2024-11-23 03:00:26,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-23 03:00:26,540 INFO  L762   eck$LassoCheckResult]: loop already infeasible
[2024-11-23 03:00:26,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-23 03:00:26,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-23 03:00:26,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-23 03:00:26,540 INFO  L87              Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 15 Second operand  has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:26,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-23 03:00:26,561 INFO  L93              Difference]: Finished difference Result 72 states and 95 transitions.
[2024-11-23 03:00:26,561 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions.
[2024-11-23 03:00:26,562 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 50
[2024-11-23 03:00:26,563 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions.
[2024-11-23 03:00:26,566 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 72
[2024-11-23 03:00:26,566 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 72
[2024-11-23 03:00:26,566 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions.
[2024-11-23 03:00:26,567 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-23 03:00:26,567 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions.
[2024-11-23 03:00:26,567 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions.
[2024-11-23 03:00:26,569 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2024-11-23 03:00:26,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 71 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-23 03:00:26,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions.
[2024-11-23 03:00:26,570 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions.
[2024-11-23 03:00:26,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-23 03:00:26,574 INFO  L425   stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions.
[2024-11-23 03:00:26,574 INFO  L332   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-23 03:00:26,574 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions.
[2024-11-23 03:00:26,575 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 50
[2024-11-23 03:00:26,575 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-23 03:00:26,575 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2024-11-23 03:00:26,576 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]
[2024-11-23 03:00:26,578 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-23 03:00:26,594 INFO  L745   eck$LassoCheckResult]: Stem: 428#$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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 429#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~ret17#1, main_#t~ret18#1, main_#t~post19#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 439#L129 assume 0 == ~r1~0; 445#L130 assume ~id1~0 >= 0; 443#L131 assume 0 == ~st1~0; 444#L132 assume ~send1~0 == ~id1~0; 440#L133 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 441#L134 assume ~id2~0 >= 0; 438#L135 assume 0 == ~st2~0; 412#L136 assume ~send2~0 == ~id2~0; 413#L137 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 449#L138 assume ~id3~0 >= 0; 426#L139 assume 0 == ~st3~0; 427#L140 assume ~send3~0 == ~id3~0; 446#L141 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 431#L142 assume ~id1~0 != ~id2~0; 430#L143 assume ~id1~0 != ~id3~0; 399#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 400#L129-1 init_#res#1 := init_~tmp~0#1; 421#init_returnLabel#1 main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 422#L246 assume !(0 == main_~i2~0#1); 408#L246-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 409#L254-2 
[2024-11-23 03:00:26,594 INFO  L747   eck$LassoCheckResult]: Loop: 409#L254-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 425#L54 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 405#L54-2 havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 460#L80 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 458#L80-2 havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 453#L105 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 452#L105-2 havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 451#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 450#L203 assume !(~r1~0 >= 3); 432#L206 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 433#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 434#L202-1 check_#res#1 := check_~tmp~1#1; 414#check_returnLabel#1 main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 415#L278 assume !(0 == assert_~arg#1 % 256); 448#L273 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 409#L254-2 
[2024-11-23 03:00:26,594 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times
[2024-11-23 03:00:26,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123118066]
[2024-11-23 03:00:26,595 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-23 03:00:26,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,621 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-23 03:00:26,623 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-23 03:00:26,623 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 03:00:26,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,662 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 03:00:26,666 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -655493494, now seen corresponding path program 1 times
[2024-11-23 03:00:26,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,667 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897151012]
[2024-11-23 03:00:26,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 03:00:26,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,688 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 03:00:26,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,707 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 03:00:26,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-23 03:00:26,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 214545484, now seen corresponding path program 1 times
[2024-11-23 03:00:26,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-23 03:00:26,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120126787]
[2024-11-23 03:00:26,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-23 03:00:26,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-23 03:00:26,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,739 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-23 03:00:26,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-23 03:00:26,763 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-23 03:00:27,745 INFO  L204          LassoAnalysis]: Preferences:
[2024-11-23 03:00:27,746 INFO  L125   ssoRankerPreferences]: Compute integeral hull: false
[2024-11-23 03:00:27,746 INFO  L126   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-23 03:00:27,746 INFO  L127   ssoRankerPreferences]: Term annotations enabled: false
[2024-11-23 03:00:27,746 INFO  L128   ssoRankerPreferences]: Use exernal solver: true
[2024-11-23 03:00:27,746 INFO  L129   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-23 03:00:27,746 INFO  L130   ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-23 03:00:27,747 INFO  L131   ssoRankerPreferences]: Path of dumped script: 
[2024-11-23 03:00:27,747 INFO  L132   ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop
[2024-11-23 03:00:27,747 INFO  L133   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-23 03:00:27,747 INFO  L241          LassoAnalysis]: Starting lasso preprocessing...
[2024-11-23 03:00:27,775 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,784 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,789 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,791 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,793 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,796 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,798 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,801 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,803 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,805 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,806 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,811 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,818 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:27,820 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:28,465 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:28,470 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-23 03:00:29,053 WARN  L137   XnfTransformerHelper]: expecting exponential blowup for input size 16
[2024-11-23 03:00:48,605 WARN  L176   XnfTransformerHelper]: Simplifying disjunction of 967680 conjunctions. This might take some time...