./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a 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_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R --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 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100 --- 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-38b53e6 [2022-11-25 17:48:02,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:48:02,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:48:02,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:48:02,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:48:02,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:48:02,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:48:02,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:48:02,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:48:02,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:48:02,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:48:02,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:48:02,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:48:02,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:48:02,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:48:02,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:48:02,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:48:02,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:48:02,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:48:02,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:48:02,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:48:02,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:48:02,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:48:02,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:48:02,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:48:02,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:48:02,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:48:02,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:48:02,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:48:02,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:48:02,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:48:02,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:48:02,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:48:02,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:48:02,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:48:02,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:48:02,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:48:02,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:48:02,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:48:02,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:48:02,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:48:02,461 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-25 17:48:02,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:48:02,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:48:02,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:48:02,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:48:02,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:48:02,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:48:02,512 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:48:02,513 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 17:48:02,513 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 17:48:02,513 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 17:48:02,514 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 17:48:02,514 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 17:48:02,515 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 17:48:02,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:48:02,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:48:02,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:48:02,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:48:02,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:48:02,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:48:02,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 17:48:02,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 17:48:02,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 17:48:02,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:48:02,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:48:02,517 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 17:48:02,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:48:02,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 17:48:02,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:48:02,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:48:02,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:48:02,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:48:02,520 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 17:48:02,521 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_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/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_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R 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 -> 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100 [2022-11-25 17:48:02,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:48:02,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:48:02,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:48:02,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:48:02,871 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:48:02,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2022-11-25 17:48:06,120 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:48:06,424 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:48:06,427 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2022-11-25 17:48:06,443 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/data/db50d8bdb/de81d537b93c49a888167932401b8c49/FLAGcf9aa057b [2022-11-25 17:48:06,466 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/data/db50d8bdb/de81d537b93c49a888167932401b8c49 [2022-11-25 17:48:06,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:48:06,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:48:06,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:48:06,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:48:06,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:48:06,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:48:06" (1/1) ... [2022-11-25 17:48:06,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d20e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:06, skipping insertion in model container [2022-11-25 17:48:06,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:48:06" (1/1) ... [2022-11-25 17:48:06,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:48:06,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:48:06,896 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_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2022-11-25 17:48:06,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:48:06,920 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:48:07,038 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_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2022-11-25 17:48:07,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:48:07,073 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:48:07,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07 WrapperNode [2022-11-25 17:48:07,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:48:07,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:48:07,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:48:07,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:48:07,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,153 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 391 [2022-11-25 17:48:07,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:48:07,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:48:07,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:48:07,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:48:07,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:48:07,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:48:07,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:48:07,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:48:07,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (1/1) ... [2022-11-25 17:48:07,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:48:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:48:07,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 17:48:07,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea4be960-1a09-4c4d-805b-8e3bdc832d6b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 17:48:07,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:48:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:48:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:48:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:48:07,506 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:48:07,508 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:48:08,203 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:48:08,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:48:08,215 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:48:08,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:48:08 BoogieIcfgContainer [2022-11-25 17:48:08,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:48:08,219 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 17:48:08,219 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 17:48:08,224 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 17:48:08,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:48:08,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 05:48:06" (1/3) ... [2022-11-25 17:48:08,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e6ac83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:48:08, skipping insertion in model container [2022-11-25 17:48:08,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:48:08,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:07" (2/3) ... [2022-11-25 17:48:08,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e6ac83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 05:48:08, skipping insertion in model container [2022-11-25 17:48:08,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 17:48:08,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:48:08" (3/3) ... [2022-11-25 17:48:08,229 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2022-11-25 17:48:08,290 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 17:48:08,291 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 17:48:08,291 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 17:48:08,291 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 17:48:08,291 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 17:48:08,291 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 17:48:08,292 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 17:48:08,292 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 17:48:08,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 121 states have internal predecessors, (212), 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-25 17:48:08,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-11-25 17:48:08,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:48:08,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:48:08,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:08,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:08,335 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 17:48:08,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 121 states have internal predecessors, (212), 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-25 17:48:08,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-11-25 17:48:08,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:48:08,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:48:08,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:08,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:08,354 INFO L748 eck$LassoCheckResult]: Stem: 106#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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 69#L291true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 48#L291-1true init_#res#1 := init_~tmp~0#1; 94#L456true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 40#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 85#L21true assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 18#L532-2true [2022-11-25 17:48:08,356 INFO L750 eck$LassoCheckResult]: Loop: 18#L532-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 104#L84true assume !(0 != ~mode1~0 % 256); 16#L105true assume 0 != ~alive1~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); 81#L108-2true ~mode1~0 := 1; 24#L84-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; 45#L122true assume !(0 != ~mode2~0 % 256); 27#L139true assume 0 != ~alive2~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); 82#L142-2true ~mode2~0 := 1; 93#L122-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; 112#L156true assume !(0 != ~mode3~0 % 256); 50#L173true assume 0 != ~alive3~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); 114#L176-2true ~mode3~0 := 1; 38#L156-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 54#L190true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 51#L193true assume !(node4_~m4~0#1 != ~nomsg~0); 89#L193-1true ~mode4~0 := 0; 97#L190-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 70#L224true assume !(0 != ~mode5~0 % 256); 26#L241true assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 32#L244-2true ~mode5~0 := 1; 87#L224-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 29#L258true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 122#L261true assume !(node6_~m6~0#1 != ~nomsg~0); 68#L261-1true ~mode6~0 := 0; 65#L258-2true assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 95#L464true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 30#L464-1true check_#res#1 := check_~tmp~1#1; 41#L476true main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 14#L564true assume !(0 == assert_~arg#1 % 256); 44#L559true assume { :end_inline_assert } true; 18#L532-2true [2022-11-25 17:48:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:08,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2022-11-25 17:48:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:08,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070956579] [2022-11-25 17:48:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:08,641 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-25 17:48:08,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070956579] [2022-11-25 17:48:08,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070956579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:08,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:08,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:48:08,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629828269] [2022-11-25 17:48:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:08,654 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:48:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -887605058, now seen corresponding path program 1 times [2022-11-25 17:48:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334668600] [2022-11-25 17:48:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:09,162 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-25 17:48:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:09,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334668600] [2022-11-25 17:48:09,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334668600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:09,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:09,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:48:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880781608] [2022-11-25 17:48:09,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:09,166 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:48:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:48:09,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:48:09,231 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 121 states have internal predecessors, (212), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-25 17:48:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:09,261 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2022-11-25 17:48:09,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 205 transitions. [2022-11-25 17:48:09,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2022-11-25 17:48:09,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 117 states and 204 transitions. [2022-11-25 17:48:09,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-11-25 17:48:09,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-11-25 17:48:09,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 204 transitions. [2022-11-25 17:48:09,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:48:09,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 204 transitions. [2022-11-25 17:48:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 204 transitions. [2022-11-25 17:48:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-25 17:48:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 116 states have internal predecessors, (204), 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-25 17:48:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 204 transitions. [2022-11-25 17:48:09,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 204 transitions. [2022-11-25 17:48:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:48:09,348 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 204 transitions. [2022-11-25 17:48:09,349 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 17:48:09,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 204 transitions. [2022-11-25 17:48:09,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2022-11-25 17:48:09,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:48:09,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:48:09,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:09,368 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:09,368 INFO L748 eck$LassoCheckResult]: Stem: 364#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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 316#L291 assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 257#L291-1 init_#res#1 := init_~tmp~0#1; 326#L456 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 317#L22 assume !(0 == assume_abort_if_not_~cond#1); 318#L21 assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 282#L532-2 [2022-11-25 17:48:09,370 INFO L750 eck$LassoCheckResult]: Loop: 282#L532-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 283#L84 assume !(0 != ~mode1~0 % 256); 277#L105 assume 0 != ~alive1~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); 278#L108-2 ~mode1~0 := 1; 292#L84-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; 293#L122 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 323#L125 assume !(node2_~m2~0#1 != ~nomsg~0); 286#L125-1 ~mode2~0 := 0; 287#L122-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; 360#L156 assume !(0 != ~mode3~0 % 256); 327#L173 assume 0 != ~alive3~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); 320#L176-2 ~mode3~0 := 1; 313#L156-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 314#L190 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 328#L193 assume !(node4_~m4~0#1 != ~nomsg~0); 330#L193-1 ~mode4~0 := 0; 359#L190-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 349#L224 assume !(0 != ~mode5~0 % 256); 295#L241 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 263#L244-2 ~mode5~0 := 1; 281#L224-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 301#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 302#L261 assume !(node6_~m6~0#1 != ~nomsg~0); 270#L261-1 ~mode6~0 := 0; 252#L258-2 assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 344#L464 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 304#L464-1 check_#res#1 := check_~tmp~1#1; 305#L476 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 274#L564 assume !(0 == assert_~arg#1 % 256); 275#L559 assume { :end_inline_assert } true; 282#L532-2 [2022-11-25 17:48:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2022-11-25 17:48:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:09,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195927860] [2022-11-25 17:48:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:09,485 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-25 17:48:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195927860] [2022-11-25 17:48:09,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195927860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:09,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:09,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:48:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855000635] [2022-11-25 17:48:09,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:09,494 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 17:48:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1802444029, now seen corresponding path program 1 times [2022-11-25 17:48:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:09,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249218130] [2022-11-25 17:48:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:09,807 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-25 17:48:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:09,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249218130] [2022-11-25 17:48:09,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249218130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:09,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:09,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:48:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582639528] [2022-11-25 17:48:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:09,810 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:48:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:48:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:48:09,812 INFO L87 Difference]: Start difference. First operand 117 states and 204 transitions. cyclomatic complexity: 88 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-25 17:48:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:10,013 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2022-11-25 17:48:10,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 206 transitions. [2022-11-25 17:48:10,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2022-11-25 17:48:10,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 163 transitions. [2022-11-25 17:48:10,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-11-25 17:48:10,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-11-25 17:48:10,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 163 transitions. [2022-11-25 17:48:10,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:48:10,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 163 transitions. [2022-11-25 17:48:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 163 transitions. [2022-11-25 17:48:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-25 17:48:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.393162393162393) internal successors, (163), 116 states have internal predecessors, (163), 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-25 17:48:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2022-11-25 17:48:10,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 163 transitions. [2022-11-25 17:48:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:48:10,043 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 163 transitions. [2022-11-25 17:48:10,043 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 17:48:10,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 163 transitions. [2022-11-25 17:48:10,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2022-11-25 17:48:10,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:48:10,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:48:10,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:10,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:10,047 INFO L748 eck$LassoCheckResult]: Stem: 616#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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 568#L291 assume 0 == ~r1~0 % 256; 600#L292 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 608#L293 assume ~id1~0 >= 0; 615#L294 assume 0 == ~st1~0; 511#L295 assume ~send1~0 == ~id1~0; 512#L296 assume 0 == ~mode1~0 % 256; 558#L297 assume ~id2~0 >= 0; 551#L298 assume 0 == ~st2~0; 552#L299 assume ~send2~0 == ~id2~0; 564#L300 assume 0 == ~mode2~0 % 256; 591#L301 assume ~id3~0 >= 0; 604#L302 assume 0 == ~st3~0; 605#L303 assume ~send3~0 == ~id3~0; 610#L304 assume 0 == ~mode3~0 % 256; 587#L305 assume ~id4~0 >= 0; 588#L306 assume 0 == ~st4~0; 599#L307 assume ~send4~0 == ~id4~0; 519#L308 assume 0 == ~mode4~0 % 256; 520#L309 assume ~id5~0 >= 0; 595#L310 assume 0 == ~st5~0; 575#L311 assume ~send5~0 == ~id5~0; 576#L312 assume 0 == ~mode5~0 % 256; 542#L313 assume ~id6~0 >= 0; 543#L314 assume 0 == ~st6~0; 571#L315 assume ~send6~0 == ~id6~0; 572#L316 assume 0 == ~mode6~0 % 256; 509#L317 assume ~id1~0 != ~id2~0; 510#L318 assume ~id1~0 != ~id3~0; 618#L319 assume ~id1~0 != ~id4~0; 603#L320 assume ~id1~0 != ~id5~0; 589#L321 assume ~id1~0 != ~id6~0; 590#L322 assume ~id2~0 != ~id3~0; 505#L323 assume ~id2~0 != ~id4~0; 506#L324 assume ~id2~0 != ~id5~0; 528#L325 assume ~id2~0 != ~id6~0; 546#L326 assume ~id3~0 != ~id4~0; 534#L327 assume ~id3~0 != ~id5~0; 535#L328 assume ~id3~0 != ~id6~0; 559#L329 assume ~id4~0 != ~id5~0; 560#L330 assume ~id4~0 != ~id6~0; 517#L331 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 518#L291-1 init_#res#1 := init_~tmp~0#1; 578#L456 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 569#L22 assume !(0 == assume_abort_if_not_~cond#1); 570#L21 assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 536#L532-2 [2022-11-25 17:48:10,047 INFO L750 eck$LassoCheckResult]: Loop: 536#L532-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 537#L84 assume !(0 != ~mode1~0 % 256); 529#L105 assume 0 != ~alive1~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); 530#L108-2 ~mode1~0 := 1; 544#L84-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; 545#L122 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 577#L125 assume !(node2_~m2~0#1 != ~nomsg~0); 538#L125-1 ~mode2~0 := 0; 539#L122-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; 612#L156 assume !(0 != ~mode3~0 % 256); 579#L173 assume 0 != ~alive3~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); 574#L176-2 ~mode3~0 := 1; 565#L156-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 566#L190 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 580#L193 assume !(node4_~m4~0#1 != ~nomsg~0); 582#L193-1 ~mode4~0 := 0; 611#L190-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 601#L224 assume !(0 != ~mode5~0 % 256); 547#L241 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 514#L244-2 ~mode5~0 := 1; 533#L224-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 553#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 554#L261 assume !(node6_~m6~0#1 != ~nomsg~0); 522#L261-1 ~mode6~0 := 0; 504#L258-2 assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 596#L464 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 556#L464-1 check_#res#1 := check_~tmp~1#1; 557#L476 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 526#L564 assume !(0 == assert_~arg#1 % 256); 527#L559 assume { :end_inline_assert } true; 536#L532-2 [2022-11-25 17:48:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2022-11-25 17:48:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:10,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867909315] [2022-11-25 17:48:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:48:10,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:48:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:48:10,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:48:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1802444029, now seen corresponding path program 2 times [2022-11-25 17:48:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:10,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902362452] [2022-11-25 17:48:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:10,551 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-25 17:48:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:10,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902362452] [2022-11-25 17:48:10,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902362452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:10,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:10,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:48:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440921551] [2022-11-25 17:48:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:10,554 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 17:48:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:48:10,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:48:10,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:48:10,555 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. cyclomatic complexity: 47 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-25 17:48:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:48:10,615 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2022-11-25 17:48:10,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 165 transitions. [2022-11-25 17:48:10,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2022-11-25 17:48:10,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 161 transitions. [2022-11-25 17:48:10,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-11-25 17:48:10,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-11-25 17:48:10,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 161 transitions. [2022-11-25 17:48:10,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:48:10,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 161 transitions. [2022-11-25 17:48:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 161 transitions. [2022-11-25 17:48:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-25 17:48:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.376068376068376) internal successors, (161), 116 states have internal predecessors, (161), 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-25 17:48:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions. [2022-11-25 17:48:10,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 161 transitions. [2022-11-25 17:48:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:48:10,630 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 161 transitions. [2022-11-25 17:48:10,630 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 17:48:10,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 161 transitions. [2022-11-25 17:48:10,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2022-11-25 17:48:10,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 17:48:10,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 17:48:10,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:10,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:48:10,634 INFO L748 eck$LassoCheckResult]: Stem: 865#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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 816#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 817#L291 assume 0 == ~r1~0 % 256; 849#L292 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 857#L293 assume ~id1~0 >= 0; 864#L294 assume 0 == ~st1~0; 760#L295 assume ~send1~0 == ~id1~0; 761#L296 assume 0 == ~mode1~0 % 256; 807#L297 assume ~id2~0 >= 0; 800#L298 assume 0 == ~st2~0; 801#L299 assume ~send2~0 == ~id2~0; 813#L300 assume 0 == ~mode2~0 % 256; 840#L301 assume ~id3~0 >= 0; 853#L302 assume 0 == ~st3~0; 854#L303 assume ~send3~0 == ~id3~0; 859#L304 assume 0 == ~mode3~0 % 256; 836#L305 assume ~id4~0 >= 0; 837#L306 assume 0 == ~st4~0; 848#L307 assume ~send4~0 == ~id4~0; 768#L308 assume 0 == ~mode4~0 % 256; 769#L309 assume ~id5~0 >= 0; 844#L310 assume 0 == ~st5~0; 824#L311 assume ~send5~0 == ~id5~0; 825#L312 assume 0 == ~mode5~0 % 256; 791#L313 assume ~id6~0 >= 0; 792#L314 assume 0 == ~st6~0; 820#L315 assume ~send6~0 == ~id6~0; 821#L316 assume 0 == ~mode6~0 % 256; 758#L317 assume ~id1~0 != ~id2~0; 759#L318 assume ~id1~0 != ~id3~0; 867#L319 assume ~id1~0 != ~id4~0; 852#L320 assume ~id1~0 != ~id5~0; 838#L321 assume ~id1~0 != ~id6~0; 839#L322 assume ~id2~0 != ~id3~0; 754#L323 assume ~id2~0 != ~id4~0; 755#L324 assume ~id2~0 != ~id5~0; 777#L325 assume ~id2~0 != ~id6~0; 795#L326 assume ~id3~0 != ~id4~0; 783#L327 assume ~id3~0 != ~id5~0; 784#L328 assume ~id3~0 != ~id6~0; 808#L329 assume ~id4~0 != ~id5~0; 809#L330 assume ~id4~0 != ~id6~0; 766#L331 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 767#L291-1 init_#res#1 := init_~tmp~0#1; 827#L456 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 818#L22 assume !(0 == assume_abort_if_not_~cond#1); 819#L21 assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 785#L532-2 [2022-11-25 17:48:10,635 INFO L750 eck$LassoCheckResult]: Loop: 785#L532-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 786#L84 assume !(0 != ~mode1~0 % 256); 778#L105 assume 0 != ~alive1~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); 779#L108-2 ~mode1~0 := 1; 793#L84-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; 794#L122 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 826#L125 assume !(node2_~m2~0#1 != ~nomsg~0); 787#L125-1 ~mode2~0 := 0; 788#L122-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; 861#L156 assume !(0 != ~mode3~0 % 256); 828#L173 assume 0 != ~alive3~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); 823#L176-2 ~mode3~0 := 1; 814#L156-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 815#L190 assume !(0 != ~mode4~0 % 256); 835#L207 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 765#L210-2 ~mode4~0 := 1; 860#L190-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 850#L224 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 851#L227 assume !(node5_~m5~0#1 != ~nomsg~0); 781#L227-1 ~mode5~0 := 0; 782#L224-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 802#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 803#L261 assume !(node6_~m6~0#1 != ~nomsg~0); 771#L261-1 ~mode6~0 := 0; 753#L258-2 assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 845#L464 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 862#L465 assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; 805#L464-1 check_#res#1 := check_~tmp~1#1; 806#L476 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 775#L564 assume !(0 == assert_~arg#1 % 256); 776#L559 assume { :end_inline_assert } true; 785#L532-2 [2022-11-25 17:48:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2022-11-25 17:48:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:10,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143798482] [2022-11-25 17:48:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:48:10,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:48:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:48:10,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:48:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1959206920, now seen corresponding path program 1 times [2022-11-25 17:48:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:10,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214978782] [2022-11-25 17:48:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:10,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:48:10,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:48:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:48:10,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:48:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:48:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1084176041, now seen corresponding path program 1 times [2022-11-25 17:48:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:48:10,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729489942] [2022-11-25 17:48:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:48:10,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:48:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:48:10,958 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-25 17:48:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:48:10,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729489942] [2022-11-25 17:48:10,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729489942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:48:10,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:48:10,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:48:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637187556] [2022-11-25 17:48:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:48:13,938 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 17:48:13,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 17:48:13,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 17:48:13,940 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 17:48:13,940 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 17:48:13,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 17:48:13,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 17:48:13,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 17:48:13,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-25 17:48:13,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 17:48:13,942 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 17:48:13,983 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-25 17:48:13,998 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-25 17:48:14,030 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-25 17:48:14,034 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-25 17:48:14,050 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-25 17:48:14,054 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-25 17:48:14,060 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-25 17:48:14,068 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-25 17:48:15,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-25 17:48:15,196 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-25 17:48:15,199 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-25 17:48:15,206 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-25 17:48:15,218 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-25 17:48:15,222 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-25 17:48:15,227 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-25 17:48:17,518 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 20