./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/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_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/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_b87d7146-776f-4e13-b070-ba4c07edc92a/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 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f --- 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 16:41:31,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:41:31,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:41:31,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:41:31,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:41:31,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:41:31,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:41:31,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:41:31,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:41:31,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:41:31,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:41:31,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:41:31,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:41:31,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:41:31,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:41:31,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:41:31,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:41:31,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:41:31,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:41:31,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:41:31,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:41:31,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:41:31,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:41:31,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:41:31,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:41:31,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:41:31,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:41:31,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:41:31,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:41:31,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:41:31,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:41:31,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:41:31,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:41:31,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:41:31,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:41:31,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:41:31,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:41:31,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:41:31,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:41:31,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:41:31,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:41:31,807 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-25 16:41:31,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:41:31,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:41:31,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:41:31,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:41:31,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:41:31,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:41:31,856 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:41:31,857 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 16:41:31,857 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 16:41:31,857 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 16:41:31,858 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 16:41:31,859 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 16:41:31,859 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 16:41:31,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:41:31,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:41:31,860 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:41:31,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:41:31,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:41:31,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:41:31,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 16:41:31,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 16:41:31,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 16:41:31,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:41:31,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:41:31,862 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 16:41:31,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:41:31,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 16:41:31,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:41:31,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:41:31,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:41:31,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:41:31,866 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 16:41:31,866 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_b87d7146-776f-4e13-b070-ba4c07edc92a/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_b87d7146-776f-4e13-b070-ba4c07edc92a/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 -> 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f [2022-11-25 16:41:32,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:41:32,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:41:32,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:41:32,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:41:32,189 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:41:32,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-11-25 16:41:35,448 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:41:35,718 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:41:35,719 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-11-25 16:41:35,730 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/data/be0b5ed3a/9a8ed4ac8bc14111984748c48c33a024/FLAGa38578869 [2022-11-25 16:41:35,747 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/data/be0b5ed3a/9a8ed4ac8bc14111984748c48c33a024 [2022-11-25 16:41:35,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:41:35,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:41:35,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:35,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:41:35,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:41:35,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:35" (1/1) ... [2022-11-25 16:41:35,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6526df6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:35, skipping insertion in model container [2022-11-25 16:41:35,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:41:35" (1/1) ... [2022-11-25 16:41:35,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:41:35,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:41:36,075 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_b87d7146-776f-4e13-b070-ba4c07edc92a/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2022-11-25 16:41:36,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:36,092 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:41:36,164 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_b87d7146-776f-4e13-b070-ba4c07edc92a/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2022-11-25 16:41:36,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:41:36,183 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:41:36,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36 WrapperNode [2022-11-25 16:41:36,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:41:36,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:36,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:41:36,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:41:36,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,251 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 393 [2022-11-25 16:41:36,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:41:36,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:41:36,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:41:36,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:41:36,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,319 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:41:36,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:41:36,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:41:36,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:41:36,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (1/1) ... [2022-11-25 16:41:36,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:41:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:41:36,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:41:36,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b87d7146-776f-4e13-b070-ba4c07edc92a/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 16:41:36,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:41:36,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:41:36,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:41:36,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:41:36,591 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:41:36,594 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:41:37,319 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:41:37,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:41:37,330 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:41:37,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:37 BoogieIcfgContainer [2022-11-25 16:41:37,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:41:37,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 16:41:37,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 16:41:37,345 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 16:41:37,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:41:37,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 04:41:35" (1/3) ... [2022-11-25 16:41:37,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314f990c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:41:37, skipping insertion in model container [2022-11-25 16:41:37,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:41:37,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:41:36" (2/3) ... [2022-11-25 16:41:37,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314f990c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:41:37, skipping insertion in model container [2022-11-25 16:41:37,351 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:41:37,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:41:37" (3/3) ... [2022-11-25 16:41:37,361 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2022-11-25 16:41:37,439 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 16:41:37,440 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 16:41:37,440 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 16:41:37,440 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 16:41:37,440 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 16:41:37,440 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 16:41:37,440 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 16:41:37,441 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 16:41:37,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 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 16:41:37,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-11-25 16:41:37,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:41:37,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:41:37,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:37,483 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 16:41:37,483 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 16:41:37,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 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 16:41:37,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-11-25 16:41:37,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:41:37,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:41:37,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:37,532 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 16:41:37,541 INFO L748 eck$LassoCheckResult]: Stem: 104#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(50, 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; 28#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_#t~post37#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; 111#L290true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 101#L290-1true init_#res#1 := init_~tmp~0#1; 3#L455true 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; 32#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; 96#L531-2true [2022-11-25 16:41:37,556 INFO L750 eck$LassoCheckResult]: Loop: 96#L531-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 102#L84true assume !(0 != ~mode1~0 % 256); 14#L104true 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); 48#L107-2true ~mode1~0 := 1; 18#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; 19#L121true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 67#L124true assume !(node2_~m2~0#1 != ~nomsg~0); 27#L124-1true ~mode2~0 := 0; 8#L121-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; 36#L155true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 12#L158true assume !(node3_~m3~0#1 != ~nomsg~0); 80#L158-1true ~mode3~0 := 0; 86#L155-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; 74#L189true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 82#L192true assume !(node4_~m4~0#1 != ~nomsg~0); 116#L192-1true ~mode4~0 := 0; 37#L189-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; 49#L223true assume !(0 != ~mode5~0 % 256); 17#L240true 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); 119#L243-2true ~mode5~0 := 1; 42#L223-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; 107#L257true assume !(0 != ~mode6~0 % 256); 76#L274true assume 0 != ~alive6~0 % 256;~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256); 110#L277-2true ~mode6~0 := 1; 30#L257-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; 29#L463true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 115#L463-1true check_#res#1 := check_~tmp~1#1; 57#L475true 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; 11#L564true assume !(0 == assert_~arg#1 % 256); 34#L559true assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 96#L531-2true [2022-11-25 16:41:37,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2022-11-25 16:41:37,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:37,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104452288] [2022-11-25 16:41:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:37,824 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 16:41:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:37,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104452288] [2022-11-25 16:41:37,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104452288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:37,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:37,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:41:37,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193736441] [2022-11-25 16:41:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:37,833 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:41:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:37,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1075368630, now seen corresponding path program 1 times [2022-11-25 16:41:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:37,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008912656] [2022-11-25 16:41:37,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:38,471 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 16:41:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:38,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008912656] [2022-11-25 16:41:38,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008912656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:38,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:38,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771336793] [2022-11-25 16:41:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:38,474 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:41:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:41:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:41:38,522 INFO L87 Difference]: Start difference. First operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 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 16:41:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:41:38,545 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2022-11-25 16:41:38,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 206 transitions. [2022-11-25 16:41:38,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-25 16:41:38,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 201 transitions. [2022-11-25 16:41:38,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-25 16:41:38,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-25 16:41:38,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 201 transitions. [2022-11-25 16:41:38,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:38,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 201 transitions. [2022-11-25 16:41:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 201 transitions. [2022-11-25 16:41:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-25 16:41:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.7478260869565216) internal successors, (201), 114 states have internal predecessors, (201), 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 16:41:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 201 transitions. [2022-11-25 16:41:38,600 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 201 transitions. [2022-11-25 16:41:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:41:38,605 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 201 transitions. [2022-11-25 16:41:38,605 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 16:41:38,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 201 transitions. [2022-11-25 16:41:38,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-25 16:41:38,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:41:38,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:41:38,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:41:38,610 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 16:41:38,610 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(50, 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; 302#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_#t~post37#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; 303#L290 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 256#L290-1 init_#res#1 := init_~tmp~0#1; 251#L455 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; 252#L22 assume !(0 == assume_abort_if_not_~cond#1); 309#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; 312#L531-2 [2022-11-25 16:41:38,610 INFO L750 eck$LassoCheckResult]: Loop: 312#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 363#L84 assume !(0 != ~mode1~0 % 256); 275#L104 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); 276#L107-2 ~mode1~0 := 1; 285#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; 286#L121 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 288#L124 assume !(node2_~m2~0#1 != ~nomsg~0); 301#L124-1 ~mode2~0 := 0; 262#L121-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; 263#L155 assume !(0 != ~mode3~0 % 256); 315#L172 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); 254#L175-2 ~mode3~0 := 1; 341#L155-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; 353#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 354#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 323#L192-1 ~mode4~0 := 0; 316#L189-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; 317#L223 assume !(0 != ~mode5~0 % 256); 282#L240 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); 283#L243-2 ~mode5~0 := 1; 308#L223-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; 321#L257 assume !(0 != ~mode6~0 % 256); 355#L274 assume 0 != ~alive6~0 % 256;~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256); 356#L277-2 ~mode6~0 := 1; 307#L257-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; 304#L463 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 305#L463-1 check_#res#1 := check_~tmp~1#1; 339#L475 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; 269#L564 assume !(0 == assert_~arg#1 % 256); 270#L559 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 312#L531-2 [2022-11-25 16:41:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2022-11-25 16:41:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:38,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329374857] [2022-11-25 16:41:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:38,668 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 16:41:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:38,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329374857] [2022-11-25 16:41:38,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329374857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:38,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:38,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815800543] [2022-11-25 16:41:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:38,670 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:41:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 476051191, now seen corresponding path program 1 times [2022-11-25 16:41:38,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374939565] [2022-11-25 16:41:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:38,933 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 16:41:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374939565] [2022-11-25 16:41:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374939565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:38,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:38,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070736309] [2022-11-25 16:41:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:38,935 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:41:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:38,937 INFO L87 Difference]: Start difference. First operand 115 states and 201 transitions. cyclomatic complexity: 87 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 16:41:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:41:39,105 INFO L93 Difference]: Finished difference Result 118 states and 203 transitions. [2022-11-25 16:41:39,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 203 transitions. [2022-11-25 16:41:39,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-25 16:41:39,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 115 states and 160 transitions. [2022-11-25 16:41:39,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-25 16:41:39,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-25 16:41:39,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 160 transitions. [2022-11-25 16:41:39,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:39,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 160 transitions. [2022-11-25 16:41:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 160 transitions. [2022-11-25 16:41:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-25 16:41:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.391304347826087) internal successors, (160), 114 states have internal predecessors, (160), 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 16:41:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2022-11-25 16:41:39,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 160 transitions. [2022-11-25 16:41:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:41:39,118 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 160 transitions. [2022-11-25 16:41:39,118 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 16:41:39,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 160 transitions. [2022-11-25 16:41:39,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-25 16:41:39,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:41:39,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:41:39,122 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 16:41:39,122 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 16:41:39,122 INFO L748 eck$LassoCheckResult]: Stem: 612#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(50, 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; 549#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_#t~post37#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; 550#L290 assume 0 == ~r1~0; 593#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 594#L292 assume ~id1~0 >= 0; 606#L293 assume 0 == ~st1~0; 610#L294 assume ~send1~0 == ~id1~0; 507#L295 assume 0 == ~mode1~0 % 256; 508#L296 assume ~id2~0 >= 0; 539#L297 assume 0 == ~st2~0; 537#L298 assume ~send2~0 == ~id2~0; 538#L299 assume 0 == ~mode2~0 % 256; 547#L300 assume ~id3~0 >= 0; 582#L301 assume 0 == ~st3~0; 598#L302 assume ~send3~0 == ~id3~0; 599#L303 assume 0 == ~mode3~0 % 256; 608#L304 assume ~id4~0 >= 0; 576#L305 assume 0 == ~st4~0; 577#L306 assume ~send4~0 == ~id4~0; 592#L307 assume 0 == ~mode4~0 % 256; 511#L308 assume ~id5~0 >= 0; 512#L309 assume 0 == ~st5~0; 588#L310 assume ~send5~0 == ~id5~0; 565#L311 assume 0 == ~mode5~0 % 256; 566#L312 assume ~id6~0 >= 0; 527#L313 assume 0 == ~st6~0; 528#L314 assume ~send6~0 == ~id6~0; 557#L315 assume 0 == ~mode6~0 % 256; 558#L316 assume ~id1~0 != ~id2~0; 505#L317 assume ~id1~0 != ~id3~0; 506#L318 assume ~id1~0 != ~id4~0; 613#L319 assume ~id1~0 != ~id5~0; 597#L320 assume ~id1~0 != ~id6~0; 578#L321 assume ~id2~0 != ~id3~0; 579#L322 assume ~id2~0 != ~id4~0; 499#L323 assume ~id2~0 != ~id5~0; 500#L324 assume ~id2~0 != ~id6~0; 521#L325 assume ~id3~0 != ~id4~0; 536#L326 assume ~id3~0 != ~id5~0; 525#L327 assume ~id3~0 != ~id6~0; 526#L328 assume ~id4~0 != ~id5~0; 543#L329 assume ~id4~0 != ~id6~0; 544#L330 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 567#L290-1 init_#res#1 := init_~tmp~0#1; 501#L455 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; 502#L22 assume !(0 == assume_abort_if_not_~cond#1); 556#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; 559#L531-2 [2022-11-25 16:41:39,123 INFO L750 eck$LassoCheckResult]: Loop: 559#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 611#L84 assume !(0 != ~mode1~0 % 256); 522#L104 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); 523#L107-2 ~mode1~0 := 1; 532#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; 533#L121 assume !(0 != ~mode2~0 % 256); 534#L138 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); 561#L141-2 ~mode2~0 := 1; 509#L121-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; 510#L155 assume !(0 != ~mode3~0 % 256); 562#L172 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); 504#L175-2 ~mode3~0 := 1; 589#L155-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; 601#L189 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 602#L192 assume !(node4_~m4~0#1 != ~nomsg~0); 571#L192-1 ~mode4~0 := 0; 563#L189-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; 564#L223 assume !(0 != ~mode5~0 % 256); 529#L240 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); 530#L243-2 ~mode5~0 := 1; 555#L223-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; 569#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 580#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 574#L260-1 ~mode6~0 := 0; 554#L257-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; 551#L463 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 552#L463-1 check_#res#1 := check_~tmp~1#1; 587#L475 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; 516#L564 assume !(0 == assert_~arg#1 % 256); 517#L559 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 559#L531-2 [2022-11-25 16:41:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2022-11-25 16:41:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102047923] [2022-11-25 16:41:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:39,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:41:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:39,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:41:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1319742217, now seen corresponding path program 1 times [2022-11-25 16:41:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:39,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47523543] [2022-11-25 16:41:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:39,481 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 16:41:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:39,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47523543] [2022-11-25 16:41:39,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47523543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:39,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:39,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:41:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509020082] [2022-11-25 16:41:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:39,484 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:41:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:41:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:41:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:41:39,485 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. cyclomatic complexity: 46 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 16:41:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:41:39,540 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2022-11-25 16:41:39,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2022-11-25 16:41:39,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-25 16:41:39,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 115 states and 158 transitions. [2022-11-25 16:41:39,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-25 16:41:39,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-25 16:41:39,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 158 transitions. [2022-11-25 16:41:39,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:41:39,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 158 transitions. [2022-11-25 16:41:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 158 transitions. [2022-11-25 16:41:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-25 16:41:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.373913043478261) internal successors, (158), 114 states have internal predecessors, (158), 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 16:41:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2022-11-25 16:41:39,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 158 transitions. [2022-11-25 16:41:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:41:39,554 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 158 transitions. [2022-11-25 16:41:39,554 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 16:41:39,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 158 transitions. [2022-11-25 16:41:39,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-25 16:41:39,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:41:39,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:41:39,558 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 16:41:39,558 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 16:41:39,559 INFO L748 eck$LassoCheckResult]: Stem: 857#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(50, 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; 794#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_#t~post37#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; 795#L290 assume 0 == ~r1~0; 837#L291 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 838#L292 assume ~id1~0 >= 0; 850#L293 assume 0 == ~st1~0; 855#L294 assume ~send1~0 == ~id1~0; 752#L295 assume 0 == ~mode1~0 % 256; 753#L296 assume ~id2~0 >= 0; 784#L297 assume 0 == ~st2~0; 782#L298 assume ~send2~0 == ~id2~0; 783#L299 assume 0 == ~mode2~0 % 256; 792#L300 assume ~id3~0 >= 0; 826#L301 assume 0 == ~st3~0; 842#L302 assume ~send3~0 == ~id3~0; 843#L303 assume 0 == ~mode3~0 % 256; 852#L304 assume ~id4~0 >= 0; 820#L305 assume 0 == ~st4~0; 821#L306 assume ~send4~0 == ~id4~0; 836#L307 assume 0 == ~mode4~0 % 256; 756#L308 assume ~id5~0 >= 0; 757#L309 assume 0 == ~st5~0; 832#L310 assume ~send5~0 == ~id5~0; 809#L311 assume 0 == ~mode5~0 % 256; 810#L312 assume ~id6~0 >= 0; 772#L313 assume 0 == ~st6~0; 773#L314 assume ~send6~0 == ~id6~0; 801#L315 assume 0 == ~mode6~0 % 256; 802#L316 assume ~id1~0 != ~id2~0; 750#L317 assume ~id1~0 != ~id3~0; 751#L318 assume ~id1~0 != ~id4~0; 858#L319 assume ~id1~0 != ~id5~0; 841#L320 assume ~id1~0 != ~id6~0; 822#L321 assume ~id2~0 != ~id3~0; 823#L322 assume ~id2~0 != ~id4~0; 744#L323 assume ~id2~0 != ~id5~0; 745#L324 assume ~id2~0 != ~id6~0; 766#L325 assume ~id3~0 != ~id4~0; 781#L326 assume ~id3~0 != ~id5~0; 770#L327 assume ~id3~0 != ~id6~0; 771#L328 assume ~id4~0 != ~id5~0; 788#L329 assume ~id4~0 != ~id6~0; 789#L330 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 811#L290-1 init_#res#1 := init_~tmp~0#1; 746#L455 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; 747#L22 assume !(0 == assume_abort_if_not_~cond#1); 800#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; 803#L531-2 [2022-11-25 16:41:39,559 INFO L750 eck$LassoCheckResult]: Loop: 803#L531-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 856#L84 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 851#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 791#L88-1 ~mode1~0 := 0; 777#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; 778#L121 assume !(0 != ~mode2~0 % 256); 779#L138 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); 805#L141-2 ~mode2~0 := 1; 754#L121-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; 755#L155 assume !(0 != ~mode3~0 % 256); 806#L172 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); 749#L175-2 ~mode3~0 := 1; 833#L155-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; 845#L189 assume !(0 != ~mode4~0 % 256); 785#L206 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); 787#L209-2 ~mode4~0 := 1; 807#L189-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; 808#L223 assume !(0 != ~mode5~0 % 256); 774#L240 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); 775#L243-2 ~mode5~0 := 1; 799#L223-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; 813#L257 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 824#L260 assume !(node6_~m6~0#1 != ~nomsg~0); 818#L260-1 ~mode6~0 := 0; 798#L257-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; 796#L463 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 797#L464 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 853#L463-1 check_#res#1 := check_~tmp~1#1; 831#L475 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; 761#L564 assume !(0 == assert_~arg#1 % 256); 762#L559 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 803#L531-2 [2022-11-25 16:41:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2022-11-25 16:41:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:39,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357978899] [2022-11-25 16:41:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:39,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:41:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:39,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:41:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2048637641, now seen corresponding path program 1 times [2022-11-25 16:41:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:39,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496693942] [2022-11-25 16:41:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:39,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:41:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:41:39,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:41:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:41:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1173606762, now seen corresponding path program 1 times [2022-11-25 16:41:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:41:39,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107460676] [2022-11-25 16:41:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:41:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:41:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:41:39,753 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 16:41:39,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:41:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107460676] [2022-11-25 16:41:39,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107460676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:41:39,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:41:39,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:41:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892573407] [2022-11-25 16:41:39,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:41:43,645 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:41:43,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:41:43,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:41:43,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:41:43,646 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:41:43,647 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:41:43,647 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:41:43,647 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:41:43,647 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-11-25 16:41:43,647 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:41:43,648 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:41:43,693 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 16:41:43,706 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 16:41:43,712 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 16:41:43,716 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 16:41:43,722 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 16:41:43,727 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 16:41:43,733 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 16:41:43,740 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 16:41:45,067 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 16:41:45,084 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 16:41:45,089 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 16:41:45,093 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 16:41:45,096 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 16:41:45,102 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 16:41:45,108 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 16:41:45,112 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 16:41:45,117 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 16:41:45,122 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 16:41:47,525 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 26