./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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 18:18:44,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:18:44,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:18:44,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:18:44,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:18:44,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:18:44,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:18:44,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:18:44,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:18:44,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:18:44,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:18:44,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:18:44,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:18:44,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:18:44,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:18:44,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:18:44,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:18:44,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:18:44,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:18:44,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:18:44,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:18:44,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:18:44,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:18:44,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:18:44,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:18:44,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:18:44,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:18:44,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:18:44,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:18:44,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:18:44,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:18:44,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:18:44,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:18:44,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:18:44,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:18:44,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:18:44,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:18:44,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:18:44,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:18:44,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:18:44,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:18:44,625 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:18:44,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:18:44,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:18:44,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:18:44,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:18:44,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:18:44,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:18:44,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:18:44,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:18:44,677 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:18:44,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:18:44,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:18:44,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:18:44,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:18:44,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:18:44,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:18:44,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:18:44,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:18:44,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:18:44,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:18:44,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:18:44,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:18:44,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:18:44,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:18:44,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:18:44,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:18:44,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:18:44,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:18:44,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:18:44,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:18:44,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:18:44,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:18:44,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:18:44,686 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:18:44,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:18:44,686 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/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(G ! call(reach_error())) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-25 18:18:45,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:18:45,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:18:45,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:18:45,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:18:45,043 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:18:45,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-25 18:18:48,337 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:18:48,685 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:18:48,688 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/sv-benchmarks/c/pthread/queue_ok.i [2022-11-25 18:18:48,712 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/data/691af560a/6eaefdc4b4524067acb12538f2c37289/FLAG79f918d0a [2022-11-25 18:18:48,741 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/data/691af560a/6eaefdc4b4524067acb12538f2c37289 [2022-11-25 18:18:48,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:18:48,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:18:48,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:18:48,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:18:48,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:18:48,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:18:48" (1/1) ... [2022-11-25 18:18:48,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca32bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:48, skipping insertion in model container [2022-11-25 18:18:48,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:18:48" (1/1) ... [2022-11-25 18:18:48,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:18:48,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:18:49,306 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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-25 18:18:49,313 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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-25 18:18:49,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:18:49,330 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:18:49,380 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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-25 18:18:49,383 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_11b8932b-436c-4f50-afe7-5cf9f0c06d02/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-25 18:18:49,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:18:49,484 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:18:49,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49 WrapperNode [2022-11-25 18:18:49,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:18:49,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:18:49,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:18:49,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:18:49,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,592 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-25 18:18:49,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:18:49,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:18:49,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:18:49,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:18:49,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,651 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:18:49,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:18:49,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:18:49,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:18:49,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (1/1) ... [2022-11-25 18:18:49,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:18:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:49,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:18:49,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:18:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 18:18:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 18:18:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 18:18:49,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 18:18:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:18:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:18:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:18:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:18:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 18:18:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:18:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:18:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:18:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:18:49,776 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:18:49,983 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:18:49,986 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:18:50,368 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:18:50,378 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:18:50,379 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:18:50,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:18:50 BoogieIcfgContainer [2022-11-25 18:18:50,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:18:50,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:18:50,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:18:50,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:18:50,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:18:48" (1/3) ... [2022-11-25 18:18:50,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395d6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:18:50, skipping insertion in model container [2022-11-25 18:18:50,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:49" (2/3) ... [2022-11-25 18:18:50,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395d6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:18:50, skipping insertion in model container [2022-11-25 18:18:50,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:18:50" (3/3) ... [2022-11-25 18:18:50,391 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-25 18:18:50,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:18:50,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:18:50,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:18:50,431 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:18:50,601 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:18:50,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-25 18:18:50,756 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-25 18:18:50,757 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 18:18:50,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 13/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-25 18:18:50,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 229 transitions, 474 flow [2022-11-25 18:18:50,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 217 transitions, 443 flow [2022-11-25 18:18:50,779 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:18:50,807 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 217 transitions, 443 flow [2022-11-25 18:18:50,810 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 217 transitions, 443 flow [2022-11-25 18:18:50,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 217 transitions, 443 flow [2022-11-25 18:18:50,933 INFO L130 PetriNetUnfolder]: 13/217 cut-off events. [2022-11-25 18:18:50,933 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-25 18:18:50,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 217 events. 13/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 297 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-25 18:18:50,943 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-11-25 18:19:03,178 INFO L134 LiptonReduction]: Checked pairs total: 21255 [2022-11-25 18:19:03,179 INFO L136 LiptonReduction]: Total number of compositions: 209 [2022-11-25 18:19:03,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:19:03,204 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@165b6cd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:19:03,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 18:19:03,206 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 18:19:03,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:19:03,207 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:03,208 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 18:19:03,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 893, now seen corresponding path program 1 times [2022-11-25 18:19:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:03,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168974247] [2022-11-25 18:19:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:03,335 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 18:19:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:03,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168974247] [2022-11-25 18:19:03,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168974247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:03,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:03,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 18:19:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199264247] [2022-11-25 18:19:03,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:03,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:19:03,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:19:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:19:03,395 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 438 [2022-11-25 18:19:03,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 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 18:19:03,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:03,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 438 [2022-11-25 18:19:03,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:03,724 INFO L130 PetriNetUnfolder]: 892/1443 cut-off events. [2022-11-25 18:19:03,724 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-25 18:19:03,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 1443 events. 892/1443 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6169 event pairs, 711 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 2735. Up to 1413 conditions per place. [2022-11-25 18:19:03,736 INFO L137 encePairwiseOnDemand]: 437/438 looper letters, 41 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2022-11-25 18:19:03,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 183 flow [2022-11-25 18:19:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:19:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:19:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 478 transitions. [2022-11-25 18:19:03,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.545662100456621 [2022-11-25 18:19:03,765 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 478 transitions. [2022-11-25 18:19:03,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 478 transitions. [2022-11-25 18:19:03,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:03,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 478 transitions. [2022-11-25 18:19:03,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 239.0) internal successors, (478), 2 states have internal predecessors, (478), 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 18:19:03,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 438.0) internal successors, (1314), 3 states have internal predecessors, (1314), 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 18:19:03,799 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 438.0) internal successors, (1314), 3 states have internal predecessors, (1314), 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 18:19:03,801 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 478 transitions. [2022-11-25 18:19:03,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 183 flow [2022-11-25 18:19:03,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:19:03,822 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 96 flow [2022-11-25 18:19:03,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2022-11-25 18:19:03,829 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-11-25 18:19:03,829 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 96 flow [2022-11-25 18:19:03,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 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 18:19:03,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:03,832 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:03,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:19:03,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 144959475, now seen corresponding path program 1 times [2022-11-25 18:19:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:03,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995827599] [2022-11-25 18:19:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:04,219 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 18:19:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995827599] [2022-11-25 18:19:04,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995827599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:04,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:04,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:19:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937753487] [2022-11-25 18:19:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:04,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:19:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:19:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:19:04,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 438 [2022-11-25 18:19:04,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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 18:19:04,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:04,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 438 [2022-11-25 18:19:04,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:04,440 INFO L130 PetriNetUnfolder]: 313/590 cut-off events. [2022-11-25 18:19:04,440 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-25 18:19:04,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 590 events. 313/590 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2562 event pairs, 215 based on Foata normal form. 30/518 useless extension candidates. Maximal degree in co-relation 1189. Up to 346 conditions per place. [2022-11-25 18:19:04,444 INFO L137 encePairwiseOnDemand]: 434/438 looper letters, 40 selfloop transitions, 2 changer transitions 11/55 dead transitions. [2022-11-25 18:19:04,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 219 flow [2022-11-25 18:19:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:19:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:19:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2022-11-25 18:19:04,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.525875190258752 [2022-11-25 18:19:04,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2022-11-25 18:19:04,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2022-11-25 18:19:04,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:04,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2022-11-25 18:19:04,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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 18:19:04,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 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 18:19:04,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 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 18:19:04,458 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 96 flow. Second operand 3 states and 691 transitions. [2022-11-25 18:19:04,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 219 flow [2022-11-25 18:19:04,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:19:04,460 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 92 flow [2022-11-25 18:19:04,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-11-25 18:19:04,462 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2022-11-25 18:19:04,462 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 92 flow [2022-11-25 18:19:04,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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 18:19:04,463 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:04,463 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:04,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:19:04,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1395804036, now seen corresponding path program 1 times [2022-11-25 18:19:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:04,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860683905] [2022-11-25 18:19:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:04,628 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 18:19:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:04,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860683905] [2022-11-25 18:19:04,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860683905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:04,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:04,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:19:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711432729] [2022-11-25 18:19:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:04,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:19:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:04,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:19:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:19:04,643 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 438 [2022-11-25 18:19:04,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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 18:19:04,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:04,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 438 [2022-11-25 18:19:04,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:04,810 INFO L130 PetriNetUnfolder]: 237/470 cut-off events. [2022-11-25 18:19:04,811 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-25 18:19:04,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 470 events. 237/470 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1638 event pairs, 147 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 980. Up to 339 conditions per place. [2022-11-25 18:19:04,813 INFO L137 encePairwiseOnDemand]: 434/438 looper letters, 48 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-11-25 18:19:04,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 224 flow [2022-11-25 18:19:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:19:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:19:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2022-11-25 18:19:04,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.528158295281583 [2022-11-25 18:19:04,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 694 transitions. [2022-11-25 18:19:04,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 694 transitions. [2022-11-25 18:19:04,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:04,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 694 transitions. [2022-11-25 18:19:04,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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 18:19:04,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 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 18:19:04,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 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 18:19:04,824 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 92 flow. Second operand 3 states and 694 transitions. [2022-11-25 18:19:04,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 224 flow [2022-11-25 18:19:04,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:19:04,827 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 107 flow [2022-11-25 18:19:04,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2022-11-25 18:19:04,828 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-11-25 18:19:04,828 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 107 flow [2022-11-25 18:19:04,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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 18:19:04,829 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:04,829 INFO L209 CegarLoopForPetriNet]: trace 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] [2022-11-25 18:19:04,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:19:04,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:04,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1733500058, now seen corresponding path program 1 times [2022-11-25 18:19:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:04,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771792392] [2022-11-25 18:19:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:04,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771792392] [2022-11-25 18:19:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771792392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:04,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:04,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:19:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954413032] [2022-11-25 18:19:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:19:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:19:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:19:05,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 438 [2022-11-25 18:19:05,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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 18:19:05,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:05,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 438 [2022-11-25 18:19:05,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:05,139 INFO L130 PetriNetUnfolder]: 175/362 cut-off events. [2022-11-25 18:19:05,143 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-25 18:19:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 362 events. 175/362 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1094 event pairs, 6 based on Foata normal form. 42/378 useless extension candidates. Maximal degree in co-relation 801. Up to 329 conditions per place. [2022-11-25 18:19:05,146 INFO L137 encePairwiseOnDemand]: 435/438 looper letters, 43 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-11-25 18:19:05,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 214 flow [2022-11-25 18:19:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:19:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:19:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2022-11-25 18:19:05,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5190258751902588 [2022-11-25 18:19:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2022-11-25 18:19:05,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2022-11-25 18:19:05,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:05,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2022-11-25 18:19:05,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 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 18:19:05,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 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 18:19:05,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 438.0) internal successors, (1752), 4 states have internal predecessors, (1752), 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 18:19:05,166 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 107 flow. Second operand 3 states and 682 transitions. [2022-11-25 18:19:05,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 214 flow [2022-11-25 18:19:05,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:19:05,169 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 110 flow [2022-11-25 18:19:05,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2022-11-25 18:19:05,172 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2022-11-25 18:19:05,172 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 110 flow [2022-11-25 18:19:05,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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 18:19:05,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:05,174 INFO L209 CegarLoopForPetriNet]: trace 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] [2022-11-25 18:19:05,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:19:05,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1047028430, now seen corresponding path program 1 times [2022-11-25 18:19:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:05,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900431342] [2022-11-25 18:19:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:05,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900431342] [2022-11-25 18:19:05,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900431342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:05,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032522291] [2022-11-25 18:19:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:05,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:05,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:05,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:19:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:05,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:19:05,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:05,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:19:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:05,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032522291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:19:05,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:19:05,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-25 18:19:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525063153] [2022-11-25 18:19:05,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:19:05,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:19:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:05,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:19:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:19:05,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 438 [2022-11-25 18:19:05,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 110 flow. Second operand has 7 states, 7 states have (on average 218.57142857142858) internal successors, (1530), 7 states have internal predecessors, (1530), 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 18:19:05,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:05,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 438 [2022-11-25 18:19:05,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:05,911 INFO L130 PetriNetUnfolder]: 237/508 cut-off events. [2022-11-25 18:19:05,911 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-11-25 18:19:05,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 508 events. 237/508 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1363 event pairs, 91 based on Foata normal form. 12/486 useless extension candidates. Maximal degree in co-relation 1141. Up to 217 conditions per place. [2022-11-25 18:19:05,914 INFO L137 encePairwiseOnDemand]: 433/438 looper letters, 70 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2022-11-25 18:19:05,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 368 flow [2022-11-25 18:19:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions. [2022-11-25 18:19:05,919 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5178843226788432 [2022-11-25 18:19:05,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1361 transitions. [2022-11-25 18:19:05,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1361 transitions. [2022-11-25 18:19:05,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:05,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1361 transitions. [2022-11-25 18:19:05,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 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 18:19:05,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:05,932 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:05,932 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 110 flow. Second operand 6 states and 1361 transitions. [2022-11-25 18:19:05,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 368 flow [2022-11-25 18:19:05,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:19:05,935 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 170 flow [2022-11-25 18:19:05,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-11-25 18:19:05,936 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-11-25 18:19:05,936 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 170 flow [2022-11-25 18:19:05,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 218.57142857142858) internal successors, (1530), 7 states have internal predecessors, (1530), 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 18:19:05,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:05,938 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:05,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:06,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:06,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1401161494, now seen corresponding path program 2 times [2022-11-25 18:19:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:06,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848928046] [2022-11-25 18:19:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848928046] [2022-11-25 18:19:06,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848928046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:06,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955968338] [2022-11-25 18:19:06,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:19:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:06,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:06,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:19:06,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:19:06,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:19:06,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:19:06,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:06,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:19:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:06,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955968338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:19:06,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:19:06,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-25 18:19:06,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269245900] [2022-11-25 18:19:06,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:19:06,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:19:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:19:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:19:06,993 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 438 [2022-11-25 18:19:06,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 170 flow. Second operand has 13 states, 13 states have (on average 218.84615384615384) internal successors, (2845), 13 states have internal predecessors, (2845), 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 18:19:06,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:06,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 438 [2022-11-25 18:19:06,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:07,515 INFO L130 PetriNetUnfolder]: 423/934 cut-off events. [2022-11-25 18:19:07,515 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2022-11-25 18:19:07,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 934 events. 423/934 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2561 event pairs, 91 based on Foata normal form. 24/900 useless extension candidates. Maximal degree in co-relation 2357. Up to 217 conditions per place. [2022-11-25 18:19:07,521 INFO L137 encePairwiseOnDemand]: 433/438 looper letters, 136 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2022-11-25 18:19:07,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 161 transitions, 836 flow [2022-11-25 18:19:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:19:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 18:19:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2720 transitions. [2022-11-25 18:19:07,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.517503805175038 [2022-11-25 18:19:07,530 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2720 transitions. [2022-11-25 18:19:07,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2720 transitions. [2022-11-25 18:19:07,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:07,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2720 transitions. [2022-11-25 18:19:07,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 226.66666666666666) internal successors, (2720), 12 states have internal predecessors, (2720), 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 18:19:07,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 438.0) internal successors, (5694), 13 states have internal predecessors, (5694), 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 18:19:07,550 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 438.0) internal successors, (5694), 13 states have internal predecessors, (5694), 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 18:19:07,551 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 170 flow. Second operand 12 states and 2720 transitions. [2022-11-25 18:19:07,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 161 transitions, 836 flow [2022-11-25 18:19:07,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 161 transitions, 797 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-11-25 18:19:07,557 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 320 flow [2022-11-25 18:19:07,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=320, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2022-11-25 18:19:07,558 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2022-11-25 18:19:07,559 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 320 flow [2022-11-25 18:19:07,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 218.84615384615384) internal successors, (2845), 13 states have internal predecessors, (2845), 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 18:19:07,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:07,561 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:07,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:07,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:19:07,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash 551793046, now seen corresponding path program 3 times [2022-11-25 18:19:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:07,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314524477] [2022-11-25 18:19:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:07,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:08,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314524477] [2022-11-25 18:19:08,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314524477] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:08,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567907886] [2022-11-25 18:19:08,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:19:08,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:08,350 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:08,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:19:09,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:19:09,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:19:09,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 18:19:09,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:09,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:19:09,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:09,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:19:09,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:09,783 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 18:19:09,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:19:09,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:09,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:19:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-11-25 18:19:09,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:19:09,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567907886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:09,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:19:09,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2022-11-25 18:19:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164936513] [2022-11-25 18:19:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:09,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:19:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:19:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:19:10,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 438 [2022-11-25 18:19:10,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 207.57142857142858) internal successors, (1453), 7 states have internal predecessors, (1453), 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 18:19:10,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:10,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 438 [2022-11-25 18:19:10,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:10,714 INFO L130 PetriNetUnfolder]: 725/1582 cut-off events. [2022-11-25 18:19:10,715 INFO L131 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2022-11-25 18:19:10,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 1582 events. 725/1582 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5517 event pairs, 159 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 4235. Up to 992 conditions per place. [2022-11-25 18:19:10,726 INFO L137 encePairwiseOnDemand]: 430/438 looper letters, 89 selfloop transitions, 11 changer transitions 1/103 dead transitions. [2022-11-25 18:19:10,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 730 flow [2022-11-25 18:19:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1283 transitions. [2022-11-25 18:19:10,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4882039573820396 [2022-11-25 18:19:10,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1283 transitions. [2022-11-25 18:19:10,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1283 transitions. [2022-11-25 18:19:10,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:10,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1283 transitions. [2022-11-25 18:19:10,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.83333333333334) internal successors, (1283), 6 states have internal predecessors, (1283), 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 18:19:10,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:10,741 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:10,741 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 320 flow. Second operand 6 states and 1283 transitions. [2022-11-25 18:19:10,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 730 flow [2022-11-25 18:19:10,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 714 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:19:10,751 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 398 flow [2022-11-25 18:19:10,751 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2022-11-25 18:19:10,752 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2022-11-25 18:19:10,752 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 398 flow [2022-11-25 18:19:10,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 207.57142857142858) internal successors, (1453), 7 states have internal predecessors, (1453), 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 18:19:10,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:10,753 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:10,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:10,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:10,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash -974370010, now seen corresponding path program 1 times [2022-11-25 18:19:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:10,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040126827] [2022-11-25 18:19:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040126827] [2022-11-25 18:19:11,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040126827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448988705] [2022-11-25 18:19:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:11,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:11,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:19:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:11,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:19:11,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:12,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:19:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:12,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448988705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:19:12,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:19:12,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-11-25 18:19:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114762627] [2022-11-25 18:19:12,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:19:12,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:19:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:19:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:19:12,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 438 [2022-11-25 18:19:12,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 398 flow. Second operand has 23 states, 23 states have (on average 219.56521739130434) internal successors, (5050), 23 states have internal predecessors, (5050), 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 18:19:12,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:12,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 438 [2022-11-25 18:19:12,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:13,764 INFO L130 PetriNetUnfolder]: 1178/2745 cut-off events. [2022-11-25 18:19:13,765 INFO L131 PetriNetUnfolder]: For 4998/4998 co-relation queries the response was YES. [2022-11-25 18:19:13,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8932 conditions, 2745 events. 1178/2745 cut-off events. For 4998/4998 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 9889 event pairs, 137 based on Foata normal form. 80/2801 useless extension candidates. Maximal degree in co-relation 8912. Up to 680 conditions per place. [2022-11-25 18:19:13,786 INFO L137 encePairwiseOnDemand]: 433/438 looper letters, 344 selfloop transitions, 43 changer transitions 0/390 dead transitions. [2022-11-25 18:19:13,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 390 transitions, 2835 flow [2022-11-25 18:19:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:19:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-11-25 18:19:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4984 transitions. [2022-11-25 18:19:13,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5172270651722707 [2022-11-25 18:19:13,799 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4984 transitions. [2022-11-25 18:19:13,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4984 transitions. [2022-11-25 18:19:13,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:13,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4984 transitions. [2022-11-25 18:19:13,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 226.54545454545453) internal successors, (4984), 22 states have internal predecessors, (4984), 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 18:19:13,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 438.0) internal successors, (10074), 23 states have internal predecessors, (10074), 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 18:19:13,834 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 438.0) internal successors, (10074), 23 states have internal predecessors, (10074), 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 18:19:13,834 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 398 flow. Second operand 22 states and 4984 transitions. [2022-11-25 18:19:13,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 390 transitions, 2835 flow [2022-11-25 18:19:13,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 390 transitions, 2834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:19:13,849 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 780 flow [2022-11-25 18:19:13,850 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=780, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2022-11-25 18:19:13,850 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2022-11-25 18:19:13,851 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 780 flow [2022-11-25 18:19:13,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 219.56521739130434) internal successors, (5050), 23 states have internal predecessors, (5050), 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 18:19:13,853 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:13,854 INFO L209 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:13,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:14,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:14,061 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -952551061, now seen corresponding path program 2 times [2022-11-25 18:19:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:14,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138040073] [2022-11-25 18:19:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2022-11-25 18:19:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:17,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138040073] [2022-11-25 18:19:17,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138040073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:17,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618506054] [2022-11-25 18:19:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:17,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:19:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:19:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:19:17,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 438 [2022-11-25 18:19:17,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 780 flow. Second operand has 5 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 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 18:19:17,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:17,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 438 [2022-11-25 18:19:17,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:18,712 INFO L130 PetriNetUnfolder]: 1283/2838 cut-off events. [2022-11-25 18:19:18,713 INFO L131 PetriNetUnfolder]: For 4916/4916 co-relation queries the response was YES. [2022-11-25 18:19:18,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 2838 events. 1283/2838 cut-off events. For 4916/4916 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 9969 event pairs, 797 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 9883. Up to 2813 conditions per place. [2022-11-25 18:19:18,743 INFO L137 encePairwiseOnDemand]: 431/438 looper letters, 93 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2022-11-25 18:19:18,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 1044 flow [2022-11-25 18:19:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1270 transitions. [2022-11-25 18:19:18,749 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4832572298325723 [2022-11-25 18:19:18,749 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1270 transitions. [2022-11-25 18:19:18,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1270 transitions. [2022-11-25 18:19:18,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:18,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1270 transitions. [2022-11-25 18:19:18,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 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 18:19:18,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:18,762 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:18,763 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 780 flow. Second operand 6 states and 1270 transitions. [2022-11-25 18:19:18,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 1044 flow [2022-11-25 18:19:18,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 1008 flow, removed 0 selfloop flow, removed 9 redundant places. [2022-11-25 18:19:18,800 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 827 flow [2022-11-25 18:19:18,801 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2022-11-25 18:19:18,803 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2022-11-25 18:19:18,803 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 827 flow [2022-11-25 18:19:18,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 209.8) internal successors, (1049), 5 states have internal predecessors, (1049), 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 18:19:18,804 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:18,804 INFO L209 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:18,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:19:18,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -868651728, now seen corresponding path program 3 times [2022-11-25 18:19:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:18,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833575362] [2022-11-25 18:19:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 698 proven. 62 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-11-25 18:19:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:22,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833575362] [2022-11-25 18:19:22,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833575362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:22,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167961030] [2022-11-25 18:19:22,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:19:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:22,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:22,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:19:24,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:19:24,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:19:24,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-25 18:19:24,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:24,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:24,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:24,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-25 18:19:24,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:24,674 INFO L321 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2022-11-25 18:19:24,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 62 [2022-11-25 18:19:24,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:19:24,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 18:19:25,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 18:19:25,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-25 18:19:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2022-11-25 18:19:25,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:19:25,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167961030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:25,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:19:25,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2022-11-25 18:19:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936110228] [2022-11-25 18:19:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:25,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:19:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:25,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:19:25,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:19:25,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 438 [2022-11-25 18:19:25,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 827 flow. Second operand has 7 states, 7 states have (on average 206.85714285714286) internal successors, (1448), 7 states have internal predecessors, (1448), 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 18:19:25,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:25,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 438 [2022-11-25 18:19:25,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:27,068 INFO L130 PetriNetUnfolder]: 1293/2863 cut-off events. [2022-11-25 18:19:27,069 INFO L131 PetriNetUnfolder]: For 5294/5294 co-relation queries the response was YES. [2022-11-25 18:19:27,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10498 conditions, 2863 events. 1293/2863 cut-off events. For 5294/5294 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 10143 event pairs, 439 based on Foata normal form. 3/2842 useless extension candidates. Maximal degree in co-relation 10463. Up to 2789 conditions per place. [2022-11-25 18:19:27,100 INFO L137 encePairwiseOnDemand]: 431/438 looper letters, 101 selfloop transitions, 11 changer transitions 1/115 dead transitions. [2022-11-25 18:19:27,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 115 transitions, 1111 flow [2022-11-25 18:19:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2022-11-25 18:19:27,105 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4836377473363775 [2022-11-25 18:19:27,105 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions. [2022-11-25 18:19:27,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions. [2022-11-25 18:19:27,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:27,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions. [2022-11-25 18:19:27,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 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 18:19:27,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:27,115 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 438.0) internal successors, (3066), 7 states have internal predecessors, (3066), 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 18:19:27,115 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 827 flow. Second operand 6 states and 1271 transitions. [2022-11-25 18:19:27,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 115 transitions, 1111 flow [2022-11-25 18:19:27,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 1087 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-11-25 18:19:27,151 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 867 flow [2022-11-25 18:19:27,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2022-11-25 18:19:27,153 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 66 predicate places. [2022-11-25 18:19:27,153 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 867 flow [2022-11-25 18:19:27,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 206.85714285714286) internal successors, (1448), 7 states have internal predecessors, (1448), 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 18:19:27,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:27,154 INFO L209 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:27,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:27,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:19:27,367 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1883548662, now seen corresponding path program 4 times [2022-11-25 18:19:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276467003] [2022-11-25 18:19:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:27,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 407 proven. 15 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2022-11-25 18:19:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:31,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276467003] [2022-11-25 18:19:31,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276467003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:31,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854225942] [2022-11-25 18:19:31,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:19:31,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:31,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:31,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:19:31,877 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:19:31,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:19:31,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 18:19:31,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:32,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:19:32,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:32,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:19:32,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:32,986 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 18:19:32,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:19:33,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:33,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:19:33,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 18:19:33,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:33,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:19:33,284 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:19:33,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:19:33,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:19:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 239 proven. 95 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2022-11-25 18:19:33,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:19:33,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1847 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1847) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1849) .cse1)))))) is different from false [2022-11-25 18:19:33,482 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1847 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1847) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1849) .cse1) 20))))) is different from false [2022-11-25 18:19:33,502 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1847 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1847) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1849) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-11-25 18:19:33,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1843 Int) (v_ArrVal_1847 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1843) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1847) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1849) .cse1) 20))))) is different from false [2022-11-25 18:19:33,574 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 Int) (v_ArrVal_1841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1843 Int) (v_ArrVal_1847 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1841)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1843) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1847) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1849) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-11-25 18:19:34,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:19:34,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 149 [2022-11-25 18:19:34,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:19:34,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-11-25 18:19:34,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 237 [2022-11-25 18:19:34,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 281 [2022-11-25 18:19:34,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:19:34,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:19:34,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 89 [2022-11-25 18:19:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 140 proven. 91 refuted. 0 times theorem prover too weak. 861 trivial. 103 not checked. [2022-11-25 18:19:34,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854225942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:19:34,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:19:34,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 34 [2022-11-25 18:19:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183386345] [2022-11-25 18:19:34,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:19:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 18:19:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 18:19:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=654, Unknown=11, NotChecked=300, Total=1190 [2022-11-25 18:19:34,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 438 [2022-11-25 18:19:34,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 867 flow. Second operand has 35 states, 35 states have (on average 171.74285714285713) internal successors, (6011), 35 states have internal predecessors, (6011), 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 18:19:34,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:34,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 438 [2022-11-25 18:19:34,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:38,818 INFO L130 PetriNetUnfolder]: 2719/6250 cut-off events. [2022-11-25 18:19:38,818 INFO L131 PetriNetUnfolder]: For 13464/13464 co-relation queries the response was YES. [2022-11-25 18:19:38,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23845 conditions, 6250 events. 2719/6250 cut-off events. For 13464/13464 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 31043 event pairs, 216 based on Foata normal form. 185/6393 useless extension candidates. Maximal degree in co-relation 23806. Up to 2042 conditions per place. [2022-11-25 18:19:38,887 INFO L137 encePairwiseOnDemand]: 426/438 looper letters, 241 selfloop transitions, 64 changer transitions 1/308 dead transitions. [2022-11-25 18:19:38,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 308 transitions, 3093 flow [2022-11-25 18:19:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 18:19:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-25 18:19:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3371 transitions. [2022-11-25 18:19:38,897 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40507089641913 [2022-11-25 18:19:38,897 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3371 transitions. [2022-11-25 18:19:38,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3371 transitions. [2022-11-25 18:19:38,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:38,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3371 transitions. [2022-11-25 18:19:38,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 177.42105263157896) internal successors, (3371), 19 states have internal predecessors, (3371), 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 18:19:38,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 438.0) internal successors, (8760), 20 states have internal predecessors, (8760), 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 18:19:38,921 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 438.0) internal successors, (8760), 20 states have internal predecessors, (8760), 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 18:19:38,921 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 867 flow. Second operand 19 states and 3371 transitions. [2022-11-25 18:19:38,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 308 transitions, 3093 flow [2022-11-25 18:19:38,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 308 transitions, 3069 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-25 18:19:39,003 INFO L231 Difference]: Finished difference. Result has 137 places, 146 transitions, 1426 flow [2022-11-25 18:19:39,004 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=438, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1426, PETRI_PLACES=137, PETRI_TRANSITIONS=146} [2022-11-25 18:19:39,004 INFO L288 CegarLoopForPetriNet]: 47 programPoint places, 90 predicate places. [2022-11-25 18:19:39,005 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 146 transitions, 1426 flow [2022-11-25 18:19:39,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 171.74285714285713) internal successors, (6011), 35 states have internal predecessors, (6011), 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 18:19:39,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:39,007 INFO L209 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:39,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:39,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:39,216 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-25 18:19:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash 940669116, now seen corresponding path program 5 times [2022-11-25 18:19:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:39,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085805021] [2022-11-25 18:19:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2022-11-25 18:19:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:44,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085805021] [2022-11-25 18:19:44,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085805021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:44,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424484235] [2022-11-25 18:19:44,230 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:19:44,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:44,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:44,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:44,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11b8932b-436c-4f50-afe7-5cf9f0c06d02/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:20:14,756 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-11-25 18:20:14,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:20:14,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 193 conjunts are in the unsatisfiable core [2022-11-25 18:20:14,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:14,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:20:14,947 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-25 18:20:14,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-25 18:20:15,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:15,131 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-25 18:20:15,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 62 [2022-11-25 18:20:15,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:15,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-25 18:20:15,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2022-11-25 18:20:15,554 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-25 18:20:15,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 67 [2022-11-25 18:20:15,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:15,779 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:20:15,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2022-11-25 18:20:15,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:15,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-25 18:20:16,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2022-11-25 18:20:16,202 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-25 18:20:16,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 67 [2022-11-25 18:20:16,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:16,450 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:20:16,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2022-11-25 18:20:16,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:16,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-25 18:20:16,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2022-11-25 18:20:16,907 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-25 18:20:16,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 67 [2022-11-25 18:20:17,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:17,153 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 18:20:17,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 58 [2022-11-25 18:20:17,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:17,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-11-25 18:20:17,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-25 18:20:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:17,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 18:20:17,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:17,648 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 18:20:17,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:20:17,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:17,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:20:17,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-25 18:20:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:17,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 18:20:18,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:18,136 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 18:20:18,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:20:18,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:18,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:20:18,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-25 18:20:18,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:18,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 18:20:18,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:18,663 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 18:20:18,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:20:18,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:18,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:20:18,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-25 18:20:19,010 INFO L321 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2022-11-25 18:20:19,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-11-25 18:20:19,125 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:20:19,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 18:20:19,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 18:20:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 934 proven. 119 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-11-25 18:20:19,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:57,965 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2294 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2296 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2299 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2286)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2289))))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse4 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2302) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse2 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2294) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2286) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse7 .cse1))))))))))))) is different from false [2022-11-25 18:25:01,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2294 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2296 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2299 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2284) .cse6 v_ArrVal_2286)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2289))))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse3 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2302) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse3 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2286) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2294))))))))))) is different from false [2022-11-25 18:25:05,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2294 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (v_ArrVal_2296 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2299 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2282)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2284) .cse5 v_ArrVal_2286)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2289))))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse10 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse2 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2294) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse2 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2302) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2286) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse6 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse7 .cse1))))))))))))) is different from false [2022-11-25 18:25:08,071 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2294 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (v_ArrVal_2296 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2299 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_2284) .cse1 v_ArrVal_2286)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2289))))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse9 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse4 (select (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2286) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse4 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2302) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2294) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse7 .cse1)))))))))))))) is different from false [2022-11-25 18:30:21,025 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272)))) (let ((.cse7 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2274))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2277) .cse1 v_ArrVal_2279)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse3 (select .cse15 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2284) .cse1 v_ArrVal_2286)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse5 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2302) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse3 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2294) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2286) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (not (= (select .cse7 .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse5 .cse1))) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse8 .cse1))))))))))))))))) is different from false [2022-11-25 18:30:31,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272))))) (let ((.cse7 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2274))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2277) .cse1 v_ArrVal_2279)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse6 (select .cse15 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2284) .cse1 v_ArrVal_2286)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse0 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse2 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2294) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2286) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse6 .cse1))) (not (= (select .cse7 .cse1) 20)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2302) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)))))))))))))))) is different from false [2022-11-25 18:30:42,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse20 .cse21 (+ (select .cse20 .cse21) 1)))))) (store .cse19 |c_~#stored_elements~0.base| (store (select .cse19 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272))))) (let ((.cse4 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* 4 (select .cse18 .cse1))) v_ArrVal_2274))) (.cse11 (+ 88 |c_~#queue~0.offset|))) (let ((.cse15 (let ((.cse16 (store .cse17 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2277) .cse1 v_ArrVal_2279)))) (store .cse16 |c_~#stored_elements~0.base| (store (select .cse16 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse5 (select .cse15 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse13 (let ((.cse14 (store .cse15 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_2284) .cse1 v_ArrVal_2286)))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse3 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse10 (let ((.cse12 (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse0 (select (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse3 .cse1))) (not (= (select .cse4 .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2294) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2286) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2302))))))))))))))) is different from false [2022-11-25 18:30:52,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse21 .cse22))) (or (= .cse0 20) (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse21 .cse22 (+ .cse0 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272))))) (let ((.cse5 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* 4 (select .cse19 .cse2))) v_ArrVal_2274))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2277) .cse2 v_ArrVal_2279)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse6 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2284) .cse2 v_ArrVal_2286)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse4 (select .cse14 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_2292) .cse2 v_ArrVal_2294)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse1 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_2300) .cse2 v_ArrVal_2302)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse2) 20) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse4 .cse2))) (not (= (select .cse5 .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse6 .cse2))) (< (+ (select .cse7 .cse2) 1) v_ArrVal_2294) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (< (+ (select .cse8 .cse2) 1) v_ArrVal_2286) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (+ (select .cse9 .cse2) 1) v_ArrVal_2302)))))))))))))))))) is different from false [2022-11-25 18:31:16,243 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse21 .cse22))) (or (= .cse0 20) (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2269 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2269) .cse22 (+ .cse0 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272))))) (let ((.cse1 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2274))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse1 .cse12 v_ArrVal_2277) .cse2 v_ArrVal_2279)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse4 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2284) .cse2 v_ArrVal_2286)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse3 (select .cse14 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_2292) .cse2 v_ArrVal_2294)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse5 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_2300) .cse2 v_ArrVal_2302)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (= (select .cse1 .cse2) 20)) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse4 .cse2))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse2) 20) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse6 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse5 .cse2))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (+ (select .cse7 .cse2) 1) v_ArrVal_2302) (< (+ (select .cse8 .cse2) 1) v_ArrVal_2286) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)) (< (+ (select .cse9 .cse2) 1) v_ArrVal_2294)))))))))))))))))) is different from false [2022-11-25 18:32:20,477 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2267 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2269 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse21 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2267)) (.cse22 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse21 .cse22))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse18 (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse21 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2269) .cse22 (+ .cse4 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272))))) (let ((.cse6 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2274))) (.cse12 (+ 88 |c_~#queue~0.offset|))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse6 .cse12 v_ArrVal_2277) .cse1 v_ArrVal_2279)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse8 (select .cse16 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_2284) .cse1 v_ArrVal_2286)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse0 (select .cse14 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse2 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse12 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse0 .cse1))) (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse3 .cse1))) (= .cse4 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2286) (not (= (select .cse6 .cse1) 20)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2294) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse8 .cse1))) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2302) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|)))))))))))))))))) is different from false [2022-11-25 18:33:19,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2290 Int) (v_ArrVal_2292 Int) (v_ArrVal_2272 Int) (v_ArrVal_2294 Int) (v_ArrVal_2274 Int) (v_ArrVal_2296 Int) (v_ArrVal_2277 Int) (v_ArrVal_2299 Int) (v_ArrVal_2279 Int) (|v_t1Thread1of1ForFork0_~i~0#1_237| Int) (|v_t1Thread1of1ForFork0_~i~0#1_236| Int) (|v_t1Thread1of1ForFork0_~i~0#1_235| Int) (|v_t1Thread1of1ForFork0_~i~0#1_234| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| Int) (v_ArrVal_2280 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| Int) (v_ArrVal_2282 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| Int) (v_ArrVal_2284 Int) (v_ArrVal_2286 Int) (v_ArrVal_2267 Int) (v_ArrVal_2289 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| Int) (v_ArrVal_2300 Int) (v_ArrVal_2269 Int) (v_ArrVal_2302 Int) (v_ArrVal_2304 Int) (v_ArrVal_2306 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2267)))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse21 .cse1))) (let ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse21 .cse12 v_ArrVal_2269) .cse1 (+ .cse5 1))))) (store .cse20 |c_~#stored_elements~0.base| (store (select .cse20 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) v_ArrVal_2272))))) (let ((.cse4 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) v_ArrVal_2274)))) (let ((.cse16 (let ((.cse17 (store .cse18 |c_~#queue~0.base| (store (store .cse4 .cse12 v_ArrVal_2277) .cse1 v_ArrVal_2279)))) (store .cse17 |c_~#stored_elements~0.base| (store (select .cse17 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_237| 4)) v_ArrVal_2280))))) (let ((.cse9 (select .cse16 |c_~#queue~0.base|))) (let ((.cse2 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| 4) |c_~#queue~0.offset|) v_ArrVal_2282))) (let ((.cse14 (let ((.cse15 (store .cse16 |c_~#queue~0.base| (store (store .cse2 .cse12 v_ArrVal_2284) .cse1 v_ArrVal_2286)))) (store .cse15 |c_~#stored_elements~0.base| (store (select .cse15 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_236| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2289))))) (let ((.cse3 (select .cse14 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| 4)) v_ArrVal_2290))) (let ((.cse11 (let ((.cse13 (store .cse14 |c_~#queue~0.base| (store (store .cse8 .cse12 v_ArrVal_2292) .cse1 v_ArrVal_2294)))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| (* |v_t1Thread1of1ForFork0_~i~0#1_235| 4)) v_ArrVal_2296))))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| 4) |c_~#queue~0.offset|) v_ArrVal_2299))) (let ((.cse6 (select (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse12 v_ArrVal_2300) .cse1 v_ArrVal_2302)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_234| 4) |c_~#stored_elements~0.offset|) v_ArrVal_2304))) |c_~#queue~0.base|))) (or (not (<= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) |v_t1Thread1of1ForFork0_~i~0#1_237|)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_187| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2286) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_189| (select .cse3 .cse1))) (not (= (select .cse4 .cse1) 20)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_237| 1) |v_t1Thread1of1ForFork0_~i~0#1_236|)) (= .cse5 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2302) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_235| 1) |v_t1Thread1of1ForFork0_~i~0#1_234|)) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_185| 4) |c_~#queue~0.offset|) v_ArrVal_2306) .cse1) 20) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2294) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_191| (select .cse9 .cse1))) (not (<= v_ArrVal_2279 1)) (not (<= (+ |v_t1Thread1of1ForFork0_~i~0#1_236| 1) |v_t1Thread1of1ForFork0_~i~0#1_235|))))))))))))))))))) is different from false