./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 6b4ec56b
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_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-6b4ec56
[2022-11-20 09:30:23,104 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-11-20 09:30:23,106 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-20 09:30:23,129 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-20 09:30:23,130 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-20 09:30:23,131 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-20 09:30:23,133 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-20 09:30:23,135 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-20 09:30:23,137 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-20 09:30:23,138 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-20 09:30:23,139 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-11-20 09:30:23,141 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-20 09:30:23,141 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-20 09:30:23,142 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-20 09:30:23,144 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-20 09:30:23,145 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-20 09:30:23,147 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-20 09:30:23,148 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-20 09:30:23,150 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-20 09:30:23,153 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-20 09:30:23,154 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-20 09:30:23,156 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-20 09:30:23,157 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-11-20 09:30:23,159 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-20 09:30:23,163 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-20 09:30:23,164 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-20 09:30:23,164 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-20 09:30:23,165 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-20 09:30:23,166 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-20 09:30:23,167 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-20 09:30:23,168 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-20 09:30:23,169 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-20 09:30:23,170 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-20 09:30:23,171 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-20 09:30:23,172 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-20 09:30:23,172 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-20 09:30:23,173 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-20 09:30:23,174 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-20 09:30:23,174 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-20 09:30:23,175 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-20 09:30:23,176 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-11-20 09:30:23,185 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf
[2022-11-20 09:30:23,225 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-11-20 09:30:23,232 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-20 09:30:23,233 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-20 09:30:23,233 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-20 09:30:23,235 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-20 09:30:23,235 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-11-20 09:30:23,235 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-11-20 09:30:23,236 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2022-11-20 09:30:23,236 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2022-11-20 09:30:23,236 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2022-11-20 09:30:23,237 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2022-11-20 09:30:23,238 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2022-11-20 09:30:23,238 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2022-11-20 09:30:23,238 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-20 09:30:23,238 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-11-20 09:30:23,239 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2022-11-20 09:30:23,239 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-11-20 09:30:23,239 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-11-20 09:30:23,239 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-11-20 09:30:23,240 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2022-11-20 09:30:23,240 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2022-11-20 09:30:23,240 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2022-11-20 09:30:23,240 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-11-20 09:30:23,241 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-11-20 09:30:23,241 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2022-11-20 09:30:23,241 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-11-20 09:30:23,242 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2022-11-20 09:30:23,242 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-20 09:30:23,242 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-11-20 09:30:23,243 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-20 09:30:23,244 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-11-20 09:30:23,248 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-11-20 09:30:23,248 INFO  L138        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_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/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_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901
[2022-11-20 09:30:23,579 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-20 09:30:23,603 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-20 09:30:23,605 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-20 09:30:23,607 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-11-20 09:30:23,607 INFO  L275        PluginConnector]: CDTParser initialized
[2022-11-20 09:30:23,609 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c
[2022-11-20 09:30:27,491 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2022-11-20 09:30:27,871 INFO  L351              CDTParser]: Found 1 translation units.
[2022-11-20 09:30:27,872 INFO  L172              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c
[2022-11-20 09:30:27,883 INFO  L394              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/data/2ce64fcf7/d78ada1502d94204aaa6c71190afe4d6/FLAGb1837f946
[2022-11-20 09:30:27,914 INFO  L402              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/data/2ce64fcf7/d78ada1502d94204aaa6c71190afe4d6
[2022-11-20 09:30:27,923 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-20 09:30:27,926 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-20 09:30:27,931 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-20 09:30:27,932 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-20 09:30:27,937 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-20 09:30:27,938 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:27" (1/1) ...
[2022-11-20 09:30:27,940 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c10f017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:27, skipping insertion in model container
[2022-11-20 09:30:27,940 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:27" (1/1) ...
[2022-11-20 09:30:27,951 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-11-20 09:30:28,012 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-11-20 09:30:28,314 WARN  L237   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c[5947,5960]
[2022-11-20 09:30:28,315 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-11-20 09:30:28,333 INFO  L203         MainTranslator]: Completed pre-run
[2022-11-20 09:30:28,409 WARN  L237   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c[5947,5960]
[2022-11-20 09:30:28,417 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-11-20 09:30:28,438 INFO  L208         MainTranslator]: Completed translation
[2022-11-20 09:30:28,439 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28 WrapperNode
[2022-11-20 09:30:28,440 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-20 09:30:28,441 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-20 09:30:28,442 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-20 09:30:28,442 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-20 09:30:28,452 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,479 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,528 INFO  L138                Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195
[2022-11-20 09:30:28,532 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-20 09:30:28,533 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-20 09:30:28,534 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-20 09:30:28,534 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-11-20 09:30:28,546 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,547 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,549 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,549 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,555 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,561 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,563 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,565 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,568 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-20 09:30:28,569 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-20 09:30:28,569 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-11-20 09:30:28,570 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-11-20 09:30:28,571 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (1/1) ...
[2022-11-20 09:30:28,591 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-11-20 09:30:28,614 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/z3
[2022-11-20 09:30:28,635 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2022-11-20 09:30:28,638 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de71195e-b446-4be7-b8fb-424bf7e022ff/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2022-11-20 09:30:28,692 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-20 09:30:28,693 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-20 09:30:28,693 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-20 09:30:28,693 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-20 09:30:28,844 INFO  L235             CfgBuilder]: Building ICFG
[2022-11-20 09:30:28,847 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-20 09:30:29,259 INFO  L276             CfgBuilder]: Performing block encoding
[2022-11-20 09:30:29,267 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-20 09:30:29,268 INFO  L300             CfgBuilder]: Removed 1 assume(true) statements.
[2022-11-20 09:30:29,270 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:29 BoogieIcfgContainer
[2022-11-20 09:30:29,271 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-20 09:30:29,272 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2022-11-20 09:30:29,272 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2022-11-20 09:30:29,298 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2022-11-20 09:30:29,299 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-11-20 09:30:29,300 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 09:30:27" (1/3) ...
[2022-11-20 09:30:29,301 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31e772c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:30:29, skipping insertion in model container
[2022-11-20 09:30:29,301 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-11-20 09:30:29,302 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28" (2/3) ...
[2022-11-20 09:30:29,302 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31e772c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:30:29, skipping insertion in model container
[2022-11-20 09:30:29,304 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-11-20 09:30:29,305 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:29" (3/3) ...
[2022-11-20 09:30:29,309 INFO  L332   chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c
[2022-11-20 09:30:29,392 INFO  L303   stractBuchiCegarLoop]: Interprodecural is true
[2022-11-20 09:30:29,393 INFO  L304   stractBuchiCegarLoop]: Hoare is false
[2022-11-20 09:30:29,393 INFO  L305   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2022-11-20 09:30:29,393 INFO  L306   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2022-11-20 09:30:29,393 INFO  L307   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2022-11-20 09:30:29,393 INFO  L308   stractBuchiCegarLoop]: Difference is false
[2022-11-20 09:30:29,394 INFO  L309   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2022-11-20 09:30:29,394 INFO  L313   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2022-11-20 09:30:29,398 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 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)
[2022-11-20 09:30:29,420 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 29
[2022-11-20 09:30:29,421 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-11-20 09:30:29,421 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-11-20 09:30:29,428 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:29,429 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:29,429 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2022-11-20 09:30:29,429 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 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)
[2022-11-20 09:30:29,433 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 29
[2022-11-20 09:30:29,433 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-11-20 09:30:29,433 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-11-20 09:30:29,434 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:29,435 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:29,443 INFO  L748   eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#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; 22#L194true main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 53#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; 21#L254-2true 
[2022-11-20 09:30:29,444 INFO  L750   eck$LassoCheckResult]: Loop: 21#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; 8#L54-2true 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; 6#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 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 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#L222true main_#t~ret18#1 := check_#res#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; 55#L278true assume !(0 == assert_~arg#1 % 256); 49#L273true 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; 21#L254-2true 
[2022-11-20 09:30:29,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:29,451 INFO  L85        PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times
[2022-11-20 09:30:29,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:29,462 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217593414]
[2022-11-20 09:30:29,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:29,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:29,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-20 09:30:29,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-20 09:30:29,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-20 09:30:29,777 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217593414]
[2022-11-20 09:30:29,778 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217593414] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-20 09:30:29,778 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-20 09:30:29,779 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-20 09:30:29,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836942781]
[2022-11-20 09:30:29,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-20 09:30:29,786 INFO  L753   eck$LassoCheckResult]: stem already infeasible
[2022-11-20 09:30:29,787 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:29,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 1 times
[2022-11-20 09:30:29,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:29,788 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556013448]
[2022-11-20 09:30:29,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:29,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:29,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-20 09:30:30,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-20 09:30:30,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-20 09:30:30,149 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556013448]
[2022-11-20 09:30:30,149 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556013448] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-20 09:30:30,149 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-20 09:30:30,150 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-20 09:30:30,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447902782]
[2022-11-20 09:30:30,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-20 09:30:30,151 INFO  L765   eck$LassoCheckResult]: loop already infeasible
[2022-11-20 09:30:30,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-20 09:30:30,186 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-20 09:30:30,186 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-11-20 09:30:30,189 INFO  L87              Difference]: Start difference. First operand  has 55 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 54 states have internal predecessors, (91), 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)
[2022-11-20 09:30:30,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-20 09:30:30,361 INFO  L93              Difference]: Finished difference Result 87 states and 136 transitions.
[2022-11-20 09:30:30,363 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 136 transitions.
[2022-11-20 09:30:30,367 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2022-11-20 09:30:30,372 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 78 states and 112 transitions.
[2022-11-20 09:30:30,373 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 78
[2022-11-20 09:30:30,373 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 78
[2022-11-20 09:30:30,374 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 78 states and 112 transitions.
[2022-11-20 09:30:30,375 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-20 09:30:30,375 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 78 states and 112 transitions.
[2022-11-20 09:30:30,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states and 112 transitions.
[2022-11-20 09:30:30,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50.
[2022-11-20 09:30:30,404 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)
[2022-11-20 09:30:30,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions.
[2022-11-20 09:30:30,407 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions.
[2022-11-20 09:30:30,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2022-11-20 09:30:30,412 INFO  L428   stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions.
[2022-11-20 09:30:30,412 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2022-11-20 09:30:30,412 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions.
[2022-11-20 09:30:30,414 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2022-11-20 09:30:30,414 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-11-20 09:30:30,414 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-11-20 09:30:30,415 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]
[2022-11-20 09:30:30,415 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:30,416 INFO  L748   eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(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; 197#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#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; 198#L129 assume 0 == ~r1~0; 204#L130 assume ~id1~0 >= 0; 202#L131 assume 0 == ~st1~0; 203#L132 assume ~send1~0 == ~id1~0; 199#L133 assume 0 == ~mode1~0 % 256; 200#L134 assume ~id2~0 >= 0; 196#L135 assume 0 == ~st2~0; 176#L136 assume ~send2~0 == ~id2~0; 177#L137 assume 0 == ~mode2~0 % 256; 209#L138 assume ~id3~0 >= 0; 190#L139 assume 0 == ~st3~0; 191#L140 assume ~send3~0 == ~id3~0; 205#L141 assume 0 == ~mode3~0 % 256; 193#L142 assume ~id1~0 != ~id2~0; 192#L143 assume ~id1~0 != ~id3~0; 166#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 167#L129-1 init_#res#1 := init_~tmp~0#1; 188#L194 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 189#L246 assume !(0 == main_~i2~0#1); 172#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; 173#L254-2 
[2022-11-20 09:30:30,416 INFO  L750   eck$LassoCheckResult]: Loop: 173#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; 160#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; 162#L54-2 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; 168#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; 170#L80-2 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; 180#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; 175#L105-2 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; 182#L202 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 164#L202-1 check_#res#1 := check_~tmp~1#1; 178#L222 main_#t~ret18#1 := check_#res#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; 179#L278 assume !(0 == assert_~arg#1 % 256); 208#L273 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; 173#L254-2 
[2022-11-20 09:30:30,417 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:30,417 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times
[2022-11-20 09:30:30,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:30,418 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55995125]
[2022-11-20 09:30:30,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:30,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:30,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:30,435 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-20 09:30:30,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:30,483 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-20 09:30:30,485 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:30,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 317704902, now seen corresponding path program 2 times
[2022-11-20 09:30:30,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:30,488 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430562900]
[2022-11-20 09:30:30,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:30,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:30,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-20 09:30:30,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-20 09:30:30,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-20 09:30:30,810 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430562900]
[2022-11-20 09:30:30,810 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430562900] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-20 09:30:30,811 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-20 09:30:30,811 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-11-20 09:30:30,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089926900]
[2022-11-20 09:30:30,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-20 09:30:30,813 INFO  L765   eck$LassoCheckResult]: loop already infeasible
[2022-11-20 09:30:30,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-20 09:30:30,814 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-11-20 09:30:30,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-11-20 09:30:30,815 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)
[2022-11-20 09:30:30,887 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-20 09:30:30,887 INFO  L93              Difference]: Finished difference Result 53 states and 69 transitions.
[2022-11-20 09:30:30,888 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions.
[2022-11-20 09:30:30,890 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2022-11-20 09:30:30,897 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions.
[2022-11-20 09:30:30,897 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 50
[2022-11-20 09:30:30,897 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 50
[2022-11-20 09:30:30,899 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions.
[2022-11-20 09:30:30,899 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-20 09:30:30,899 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions.
[2022-11-20 09:30:30,900 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions.
[2022-11-20 09:30:30,902 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2022-11-20 09:30:30,902 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)
[2022-11-20 09:30:30,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions.
[2022-11-20 09:30:30,903 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions.
[2022-11-20 09:30:30,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-11-20 09:30:30,908 INFO  L428   stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions.
[2022-11-20 09:30:30,908 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2022-11-20 09:30:30,908 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions.
[2022-11-20 09:30:30,909 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 28
[2022-11-20 09:30:30,910 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-11-20 09:30:30,910 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-11-20 09:30:30,910 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]
[2022-11-20 09:30:30,911 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:30,911 INFO  L748   eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(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; 312#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#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; 313#L129 assume 0 == ~r1~0; 319#L130 assume ~id1~0 >= 0; 317#L131 assume 0 == ~st1~0; 318#L132 assume ~send1~0 == ~id1~0; 314#L133 assume 0 == ~mode1~0 % 256; 315#L134 assume ~id2~0 >= 0; 311#L135 assume 0 == ~st2~0; 291#L136 assume ~send2~0 == ~id2~0; 292#L137 assume 0 == ~mode2~0 % 256; 324#L138 assume ~id3~0 >= 0; 305#L139 assume 0 == ~st3~0; 306#L140 assume ~send3~0 == ~id3~0; 320#L141 assume 0 == ~mode3~0 % 256; 308#L142 assume ~id1~0 != ~id2~0; 307#L143 assume ~id1~0 != ~id3~0; 281#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 282#L129-1 init_#res#1 := init_~tmp~0#1; 303#L194 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 304#L246 assume !(0 == main_~i2~0#1); 287#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; 288#L254-2 
[2022-11-20 09:30:30,911 INFO  L750   eck$LassoCheckResult]: Loop: 288#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; 275#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; 277#L54-2 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; 283#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; 285#L80-2 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; 295#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; 290#L105-2 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; 297#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 298#L203 assume ~r1~0 >= 3; 278#L207 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 279#L202-1 check_#res#1 := check_~tmp~1#1; 293#L222 main_#t~ret18#1 := check_#res#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; 294#L278 assume !(0 == assert_~arg#1 % 256); 323#L273 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; 288#L254-2 
[2022-11-20 09:30:30,912 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:30,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times
[2022-11-20 09:30:30,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:30,913 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111142280]
[2022-11-20 09:30:30,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:30,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:30,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:30,925 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-20 09:30:30,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:30,938 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-20 09:30:30,939 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:30,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044091498, now seen corresponding path program 1 times
[2022-11-20 09:30:30,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:30,940 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555748865]
[2022-11-20 09:30:30,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:30,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:30,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-20 09:30:30,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-20 09:30:30,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-20 09:30:30,965 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555748865]
[2022-11-20 09:30:30,965 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555748865] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-20 09:30:30,965 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-20 09:30:30,965 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-20 09:30:30,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755789917]
[2022-11-20 09:30:30,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-20 09:30:30,966 INFO  L765   eck$LassoCheckResult]: loop already infeasible
[2022-11-20 09:30:30,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-20 09:30:30,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-20 09:30:30,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-20 09:30:30,967 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)
[2022-11-20 09:30:30,989 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-11-20 09:30:30,989 INFO  L93              Difference]: Finished difference Result 72 states and 95 transitions.
[2022-11-20 09:30:30,989 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions.
[2022-11-20 09:30:30,991 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 50
[2022-11-20 09:30:30,991 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions.
[2022-11-20 09:30:30,992 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 72
[2022-11-20 09:30:30,992 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 72
[2022-11-20 09:30:30,992 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions.
[2022-11-20 09:30:30,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-20 09:30:30,993 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions.
[2022-11-20 09:30:30,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions.
[2022-11-20 09:30:30,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2022-11-20 09:30:30,997 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)
[2022-11-20 09:30:30,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions.
[2022-11-20 09:30:30,998 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions.
[2022-11-20 09:30:30,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-11-20 09:30:30,999 INFO  L428   stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions.
[2022-11-20 09:30:31,000 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2022-11-20 09:30:31,000 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions.
[2022-11-20 09:30:31,001 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 50
[2022-11-20 09:30:31,001 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-11-20 09:30:31,001 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-11-20 09:30:31,002 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]
[2022-11-20 09:30:31,002 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-20 09:30:31,002 INFO  L748   eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(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; 445#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#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; 446#L129 assume 0 == ~r1~0; 452#L130 assume ~id1~0 >= 0; 450#L131 assume 0 == ~st1~0; 451#L132 assume ~send1~0 == ~id1~0; 447#L133 assume 0 == ~mode1~0 % 256; 448#L134 assume ~id2~0 >= 0; 444#L135 assume 0 == ~st2~0; 419#L136 assume ~send2~0 == ~id2~0; 420#L137 assume 0 == ~mode2~0 % 256; 457#L138 assume ~id3~0 >= 0; 435#L139 assume 0 == ~st3~0; 436#L140 assume ~send3~0 == ~id3~0; 453#L141 assume 0 == ~mode3~0 % 256; 438#L142 assume ~id1~0 != ~id2~0; 437#L143 assume ~id1~0 != ~id3~0; 408#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 409#L129-1 init_#res#1 := init_~tmp~0#1; 433#L194 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; 434#L246 assume !(0 == main_~i2~0#1); 415#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; 416#L254-2 
[2022-11-20 09:30:31,003 INFO  L750   eck$LassoCheckResult]: Loop: 416#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; 470#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; 414#L54-2 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; 466#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; 427#L80-2 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; 423#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; 418#L105-2 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; 425#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 426#L203 assume !(~r1~0 >= 3); 439#L206 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 440#L207 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 474#L202-1 check_#res#1 := check_~tmp~1#1; 473#L222 main_#t~ret18#1 := check_#res#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; 472#L278 assume !(0 == assert_~arg#1 % 256); 471#L273 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; 416#L254-2 
[2022-11-20 09:30:31,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:31,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times
[2022-11-20 09:30:31,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:31,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61263217]
[2022-11-20 09:30:31,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:31,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:31,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:31,015 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-20 09:30:31,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:31,028 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-20 09:30:31,029 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:31,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -655493558, now seen corresponding path program 1 times
[2022-11-20 09:30:31,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:31,029 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962158236]
[2022-11-20 09:30:31,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:31,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:31,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:31,047 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-20 09:30:31,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:31,065 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-20 09:30:31,066 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-11-20 09:30:31,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 214545420, now seen corresponding path program 1 times
[2022-11-20 09:30:31,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-20 09:30:31,067 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867908044]
[2022-11-20 09:30:31,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-20 09:30:31,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-20 09:30:31,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:31,087 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-20 09:30:31,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-20 09:30:31,108 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-20 09:30:33,128 INFO  L210          LassoAnalysis]: Preferences:
[2022-11-20 09:30:33,129 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-11-20 09:30:33,129 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-11-20 09:30:33,129 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-11-20 09:30:33,130 INFO  L129   ssoRankerPreferences]: Use exernal solver: true
[2022-11-20 09:30:33,130 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-11-20 09:30:33,130 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-11-20 09:30:33,130 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-11-20 09:30:33,130 INFO  L133   ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop
[2022-11-20 09:30:33,131 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-11-20 09:30:33,131 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-11-20 09:30:33,164 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,177 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,182 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,185 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,189 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,194 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,200 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,202 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:33,208 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:34,151 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:34,159 INFO  L117          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-11-20 09:30:35,311 WARN  L137   XnfTransformerHelper]: expecting exponential blowup for input size 18
[2022-11-20 09:31:11,246 WARN  L176   XnfTransformerHelper]: Simplifying disjunction of 818154 conjuctions. This might take some time...