./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 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_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a --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 c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 --- 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-b5237d8 [2022-11-21 17:26:33,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:26:33,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:26:33,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:26:33,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:26:33,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:26:33,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:26:33,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:26:33,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:26:33,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:26:33,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:26:33,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:26:33,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:26:33,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:26:33,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:26:33,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:26:33,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:26:33,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:26:33,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:26:33,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:26:33,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:26:33,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:26:33,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:26:33,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:26:33,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:26:33,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:26:33,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:26:33,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:26:33,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:26:33,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:26:33,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:26:33,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:26:33,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:26:33,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:26:33,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:26:33,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:26:33,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:26:33,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:26:33,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:26:33,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:26:33,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:26:33,337 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-21 17:26:33,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:26:33,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:26:33,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:26:33,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:26:33,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:26:33,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:26:33,381 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:26:33,382 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 17:26:33,382 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 17:26:33,382 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 17:26:33,383 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 17:26:33,383 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 17:26:33,383 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 17:26:33,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:26:33,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:26:33,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:26:33,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:26:33,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:26:33,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:26:33,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 17:26:33,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 17:26:33,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 17:26:33,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:26:33,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:26:33,386 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 17:26:33,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:26:33,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 17:26:33,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:26:33,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:26:33,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:26:33,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:26:33,389 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 17:26:33,389 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_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/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_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a 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 -> c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 [2022-11-21 17:26:33,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:26:33,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:26:33,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:26:33,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:26:33,804 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:26:33,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-11-21 17:26:36,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:26:37,226 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:26:37,226 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-11-21 17:26:37,239 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/data/fc12d3b8c/7f77820b9ce54f0c8581d4a97c28a20d/FLAG647eda678 [2022-11-21 17:26:37,259 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/data/fc12d3b8c/7f77820b9ce54f0c8581d4a97c28a20d [2022-11-21 17:26:37,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:26:37,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:26:37,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:26:37,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:26:37,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:26:37,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d27d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37, skipping insertion in model container [2022-11-21 17:26:37,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:26:37,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:26:37,607 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_4f1faaab-631b-49fe-a782-841d64377ca8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-11-21 17:26:37,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:26:37,625 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:26:37,710 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_4f1faaab-631b-49fe-a782-841d64377ca8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-11-21 17:26:37,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:26:37,749 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:26:37,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37 WrapperNode [2022-11-21 17:26:37,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:26:37,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:26:37,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:26:37,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:26:37,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,827 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 270 [2022-11-21 17:26:37,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:26:37,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:26:37,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:26:37,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:26:37,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,891 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:26:37,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:26:37,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:26:37,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:26:37,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (1/1) ... [2022-11-21 17:26:37,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:26:37,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:37,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 17:26:37,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f1faaab-631b-49fe-a782-841d64377ca8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 17:26:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:26:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:26:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:26:38,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:26:38,125 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:26:38,127 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:26:38,643 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:26:38,651 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:26:38,651 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 17:26:38,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:26:38 BoogieIcfgContainer [2022-11-21 17:26:38,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:26:38,655 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 17:26:38,655 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 17:26:38,659 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 17:26:38,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:26:38,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 05:26:37" (1/3) ... [2022-11-21 17:26:38,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4d3a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 05:26:38, skipping insertion in model container [2022-11-21 17:26:38,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:26:38,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:26:37" (2/3) ... [2022-11-21 17:26:38,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4d3a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 05:26:38, skipping insertion in model container [2022-11-21 17:26:38,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 17:26:38,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:26:38" (3/3) ... [2022-11-21 17:26:38,664 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-11-21 17:26:38,741 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 17:26:38,741 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 17:26:38,741 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 17:26:38,741 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 17:26:38,741 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 17:26:38,742 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 17:26:38,742 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 17:26:38,742 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 17:26:38,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 82 states, 81 states have (on average 1.7160493827160495) internal successors, (139), 81 states have internal predecessors, (139), 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-21 17:26:38,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2022-11-21 17:26:38,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:26:38,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:26:38,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:38,799 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] [2022-11-21 17:26:38,800 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 17:26:38,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 82 states, 81 states have (on average 1.7160493827160495) internal successors, (139), 81 states have internal predecessors, (139), 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-21 17:26:38,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2022-11-21 17:26:38,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:26:38,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:26:38,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:38,819 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] [2022-11-21 17:26:38,828 INFO L748 eck$LassoCheckResult]: Stem: 60#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(49, 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; 48#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~ret25#1, main_#t~ret26#1, main_#t~post27#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 3#L198true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 30#L198-1true init_#res#1 := init_~tmp~0#1; 6#L295true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 57#L347true assume !(0 == main_~i2~0#1); 78#L347-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 47#L357-2true [2022-11-21 17:26:38,843 INFO L750 eck$LassoCheckResult]: Loop: 47#L357-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 81#L65true 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 18#L69true assume !(node1_~m1~0#1 != ~nomsg~0); 72#L69-1true ~mode1~0 := 0; 45#L65-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; 12#L97true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 67#L100true assume !(node2_~m2~0#1 != ~nomsg~0); 10#L100-1true ~mode2~0 := 0; 64#L97-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; 52#L131true assume !(0 != ~mode3~0 % 256); 33#L148true 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); 29#L151-2true ~mode3~0 := 1; 32#L131-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; 17#L165true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 5#L168true assume !(node4_~m4~0#1 != ~nomsg~0); 70#L168-1true ~mode4~0 := 0; 27#L165-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 65#L303true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 37#L303-1true check_#res#1 := check_~tmp~1#1; 53#L315true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 79#L384true assume !(0 == assert_~arg#1 % 256); 42#L379true assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 47#L357-2true [2022-11-21 17:26:38,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-11-21 17:26:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:38,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970717974] [2022-11-21 17:26:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:39,235 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-21 17:26:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:39,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970717974] [2022-11-21 17:26:39,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970717974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:39,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:39,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:26:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218974182] [2022-11-21 17:26:39,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:39,244 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 17:26:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash -426391414, now seen corresponding path program 1 times [2022-11-21 17:26:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949887949] [2022-11-21 17:26:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:39,640 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-21 17:26:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:39,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949887949] [2022-11-21 17:26:39,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949887949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:39,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:39,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:26:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12278333] [2022-11-21 17:26:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:39,643 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:26:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:26:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:26:39,699 INFO L87 Difference]: Start difference. First operand has 82 states, 81 states have (on average 1.7160493827160495) internal successors, (139), 81 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:39,857 INFO L93 Difference]: Finished difference Result 133 states and 216 transitions. [2022-11-21 17:26:39,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 216 transitions. [2022-11-21 17:26:39,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-11-21 17:26:39,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 124 states and 184 transitions. [2022-11-21 17:26:39,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-11-21 17:26:39,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-11-21 17:26:39,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 184 transitions. [2022-11-21 17:26:39,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:26:39,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 184 transitions. [2022-11-21 17:26:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 184 transitions. [2022-11-21 17:26:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2022-11-21 17:26:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 76 states have internal predecessors, (107), 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-21 17:26:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2022-11-21 17:26:39,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 107 transitions. [2022-11-21 17:26:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:26:39,907 INFO L428 stractBuchiCegarLoop]: Abstraction has 77 states and 107 transitions. [2022-11-21 17:26:39,907 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 17:26:39,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 107 transitions. [2022-11-21 17:26:39,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-11-21 17:26:39,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:26:39,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:26:39,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:39,911 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] [2022-11-21 17:26:39,911 INFO L748 eck$LassoCheckResult]: Stem: 303#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(49, 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; 296#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~ret25#1, main_#t~ret26#1, main_#t~post27#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 233#L198 assume 0 == ~r1~0; 234#L199 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 287#L200 assume ~id1~0 >= 0; 288#L201 assume 0 == ~st1~0; 272#L202 assume ~send1~0 == ~id1~0; 273#L203 assume 0 == ~mode1~0 % 256; 281#L204 assume ~id2~0 >= 0; 254#L205 assume 0 == ~st2~0; 255#L206 assume ~send2~0 == ~id2~0; 242#L207 assume 0 == ~mode2~0 % 256; 243#L208 assume ~id3~0 >= 0; 293#L209 assume 0 == ~st3~0; 256#L210 assume ~send3~0 == ~id3~0; 257#L211 assume 0 == ~mode3~0 % 256; 246#L212 assume ~id4~0 >= 0; 247#L213 assume 0 == ~st4~0; 306#L214 assume ~send4~0 == ~id4~0; 307#L215 assume 0 == ~mode4~0 % 256; 291#L216 assume ~id1~0 != ~id2~0; 274#L217 assume ~id1~0 != ~id3~0; 275#L218 assume ~id1~0 != ~id4~0; 297#L219 assume ~id2~0 != ~id3~0; 309#L220 assume ~id2~0 != ~id4~0; 269#L221 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 270#L198-1 init_#res#1 := init_~tmp~0#1; 240#L295 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 241#L347 assume !(0 == main_~i2~0#1); 302#L347-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 290#L357-2 [2022-11-21 17:26:39,911 INFO L750 eck$LassoCheckResult]: Loop: 290#L357-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 295#L65 assume !(0 != ~mode1~0 % 256); 278#L83 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); 279#L83-2 ~mode1~0 := 1; 294#L65-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; 251#L97 assume !(0 != ~mode2~0 % 256); 252#L114 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); 245#L117-2 ~mode2~0 := 1; 250#L97-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; 298#L131 assume !(0 != ~mode3~0 % 256); 282#L148 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); 265#L151-2 ~mode3~0 := 1; 280#L131-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; 260#L165 assume !(0 != ~mode4~0 % 256); 261#L182 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); 284#L185-2 ~mode4~0 := 1; 276#L165-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 277#L303 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 259#L303-1 check_#res#1 := check_~tmp~1#1; 285#L315 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 300#L384 assume !(0 == assert_~arg#1 % 256); 289#L379 assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 290#L357-2 [2022-11-21 17:26:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-11-21 17:26:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:39,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975933467] [2022-11-21 17:26:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:39,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:26:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:39,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:26:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash -814141816, now seen corresponding path program 1 times [2022-11-21 17:26:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:39,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872253644] [2022-11-21 17:26:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:40,223 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-21 17:26:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:40,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872253644] [2022-11-21 17:26:40,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872253644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:40,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:40,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:26:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353760493] [2022-11-21 17:26:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:40,226 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 17:26:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:26:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:26:40,227 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-21 17:26:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:40,292 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2022-11-21 17:26:40,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 109 transitions. [2022-11-21 17:26:40,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-11-21 17:26:40,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 77 states and 105 transitions. [2022-11-21 17:26:40,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-11-21 17:26:40,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-11-21 17:26:40,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 105 transitions. [2022-11-21 17:26:40,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:26:40,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 105 transitions. [2022-11-21 17:26:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 105 transitions. [2022-11-21 17:26:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-21 17:26:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 76 states have internal predecessors, (105), 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-21 17:26:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2022-11-21 17:26:40,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 105 transitions. [2022-11-21 17:26:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:26:40,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 77 states and 105 transitions. [2022-11-21 17:26:40,321 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 17:26:40,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 105 transitions. [2022-11-21 17:26:40,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-11-21 17:26:40,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 17:26:40,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 17:26:40,326 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] [2022-11-21 17:26:40,326 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] [2022-11-21 17:26:40,327 INFO L748 eck$LassoCheckResult]: Stem: 472#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(49, 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; 465#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~ret25#1, main_#t~ret26#1, main_#t~post27#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;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 402#L198 assume 0 == ~r1~0; 403#L199 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 458#L200 assume ~id1~0 >= 0; 459#L201 assume 0 == ~st1~0; 441#L202 assume ~send1~0 == ~id1~0; 442#L203 assume 0 == ~mode1~0 % 256; 450#L204 assume ~id2~0 >= 0; 423#L205 assume 0 == ~st2~0; 424#L206 assume ~send2~0 == ~id2~0; 411#L207 assume 0 == ~mode2~0 % 256; 412#L208 assume ~id3~0 >= 0; 462#L209 assume 0 == ~st3~0; 425#L210 assume ~send3~0 == ~id3~0; 426#L211 assume 0 == ~mode3~0 % 256; 415#L212 assume ~id4~0 >= 0; 416#L213 assume 0 == ~st4~0; 475#L214 assume ~send4~0 == ~id4~0; 476#L215 assume 0 == ~mode4~0 % 256; 460#L216 assume ~id1~0 != ~id2~0; 443#L217 assume ~id1~0 != ~id3~0; 444#L218 assume ~id1~0 != ~id4~0; 466#L219 assume ~id2~0 != ~id3~0; 478#L220 assume ~id2~0 != ~id4~0; 438#L221 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 439#L198-1 init_#res#1 := init_~tmp~0#1; 409#L295 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 410#L347 assume !(0 == main_~i2~0#1); 471#L347-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 457#L357-2 [2022-11-21 17:26:40,327 INFO L750 eck$LassoCheckResult]: Loop: 457#L357-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 464#L65 assume !(0 != ~mode1~0 % 256); 447#L83 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); 448#L83-2 ~mode1~0 := 1; 463#L65-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; 420#L97 assume !(0 != ~mode2~0 % 256); 421#L114 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); 414#L117-2 ~mode2~0 := 1; 419#L97-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; 467#L131 assume !(0 != ~mode3~0 % 256); 451#L148 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); 434#L151-2 ~mode3~0 := 1; 449#L131-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; 429#L165 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 406#L168 assume !(node4_~m4~0#1 != ~nomsg~0); 408#L168-1 ~mode4~0 := 0; 445#L165-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 446#L303 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 452#L304 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 428#L303-1 check_#res#1 := check_~tmp~1#1; 453#L315 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 469#L384 assume !(0 == assert_~arg#1 % 256); 456#L379 assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 457#L357-2 [2022-11-21 17:26:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-11-21 17:26:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155238568] [2022-11-21 17:26:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:40,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:26:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:40,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:26:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2100202532, now seen corresponding path program 1 times [2022-11-21 17:26:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:40,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102808325] [2022-11-21 17:26:40,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:40,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:26:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:26:40,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:26:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2052940582, now seen corresponding path program 1 times [2022-11-21 17:26:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:40,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677381257] [2022-11-21 17:26:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:40,504 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-21 17:26:40,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:40,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677381257] [2022-11-21 17:26:40,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677381257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:40,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:40,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:26:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790355841] [2022-11-21 17:26:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:42,496 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 17:26:42,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 17:26:42,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 17:26:42,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 17:26:42,497 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 17:26:42,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 17:26:42,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 17:26:42,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 17:26:42,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-11-21 17:26:42,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 17:26:42,498 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 17:26:42,525 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-21 17:26:42,534 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-21 17:26:42,541 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-21 17:26:42,546 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-21 17:26:42,552 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-21 17:26:42,555 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-21 17:26:42,561 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-21 17:26:43,188 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-21 17:26:43,196 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:26:43,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:26:43,204 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-21 17:26:43,208 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 17:26:43,214 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-21 17:26:43,217 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-21 17:26:43,223 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-21 17:26:44,398 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2022-11-21 17:26:50,137 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 157464 conjuctions. This might take some time... [2022-11-21 17:37:04,049 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 8000 conjuctions.