./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/queue_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/queue_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 13:50:55,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 13:50:55,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 13:50:55,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 13:50:55,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 13:50:55,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 13:50:55,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 13:50:55,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 13:50:55,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 13:50:55,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 13:50:55,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 13:50:55,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 13:50:55,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 13:50:55,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 13:50:55,499 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 13:50:55,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 13:50:55,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 13:50:55,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 13:50:55,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 13:50:55,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 13:50:55,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 13:50:55,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 13:50:55,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 13:50:55,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 13:50:55,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 13:50:55,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 13:50:55,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 13:50:55,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 13:50:55,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 13:50:55,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 13:50:55,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 13:50:55,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 13:50:55,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:50:55,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 13:50:55,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 13:50:55,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 13:50:55,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 13:50:55,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 13:50:55,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 13:50:55,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 13:50:55,506 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 13:50:55,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 13:50:55,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 13:50:55,506 INFO L153 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 13:50:55,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 13:50:55,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 13:50:55,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 13:50:55,767 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 13:50:55,767 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 13:50:55,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/queue_ok.yml/witness.yml [2024-06-14 13:50:55,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 13:50:55,860 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 13:50:55,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2024-06-14 13:50:56,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 13:50:57,249 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 13:50:57,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2024-06-14 13:50:57,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1524630/646d13e595964aacb4449aa3fe16431d/FLAG8bab4ee95 [2024-06-14 13:50:57,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1524630/646d13e595964aacb4449aa3fe16431d [2024-06-14 13:50:57,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 13:50:57,281 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 13:50:57,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 13:50:57,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 13:50:57,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 13:50:57,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:50:55" (1/2) ... [2024-06-14 13:50:57,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f7a0a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:50:57, skipping insertion in model container [2024-06-14 13:50:57,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:50:55" (1/2) ... [2024-06-14 13:50:57,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e5b1954 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 01:50:57, skipping insertion in model container [2024-06-14 13:50:57,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:50:57" (2/2) ... [2024-06-14 13:50:57,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f7a0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57, skipping insertion in model container [2024-06-14 13:50:57,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 01:50:57" (2/2) ... [2024-06-14 13:50:57,292 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 13:50:57,326 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 13:50:57,327 INFO L97 edCorrectnessWitness]: Location invariant before [L1053-L1053] ((! multithreaded || (m_locked || ((((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL) && (1LL + (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL) && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL))) && (! multithreaded || 0 <= queue.head)) && (! multithreaded || (m_locked || (-2147483645 <= queue.tail && 0 <= queue.head))) [2024-06-14 13:50:57,327 INFO L97 edCorrectnessWitness]: Location invariant before [L1054-L1054] ((! multithreaded || (m_locked || ((((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL) && (1LL + (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL) && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL))) && (! multithreaded || 0 <= queue.head)) && (! multithreaded || (m_locked || (-2147483645 <= queue.tail && 0 <= queue.head))) [2024-06-14 13:50:57,327 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 13:50:57,327 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-14 13:50:57,327 INFO L106 edCorrectnessWitness]: ghost_update [L1052-L1052] multithreaded = 1; [2024-06-14 13:50:57,327 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 0; [2024-06-14 13:50:57,328 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-14 13:50:57,328 INFO L106 edCorrectnessWitness]: ghost_update [L1026-L1026] m_locked = 1; [2024-06-14 13:50:57,328 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 0; [2024-06-14 13:50:57,373 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 13:50:57,748 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:50:57,766 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 13:50:57,919 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 13:50:57,980 INFO L206 MainTranslator]: Completed translation [2024-06-14 13:50:57,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57 WrapperNode [2024-06-14 13:50:57,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 13:50:57,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 13:50:57,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 13:50:57,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 13:50:57,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,090 INFO L138 Inliner]: procedures = 274, calls = 189, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 758 [2024-06-14 13:50:58,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 13:50:58,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 13:50:58,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 13:50:58,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 13:50:58,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,168 INFO L175 MemorySlicer]: Split 172 memory accesses to 4 slices as follows [2, 5, 162, 3]. 94 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 13 writes are split as follows [0, 0, 11, 2]. [2024-06-14 13:50:58,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 13:50:58,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 13:50:58,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 13:50:58,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 13:50:58,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (1/1) ... [2024-06-14 13:50:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 13:50:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:50:58,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 13:50:58,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 13:50:58,316 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-14 13:50:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-14 13:50:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-14 13:50:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-14 13:50:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-14 13:50:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 13:50:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 13:50:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-14 13:50:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-14 13:50:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 13:50:58,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 13:50:58,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-14 13:50:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-14 13:50:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-14 13:50:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 13:50:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 13:50:58,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 13:50:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 13:50:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-14 13:50:58,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 13:50:58,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 13:50:58,324 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 13:50:58,580 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 13:50:58,581 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 13:50:59,512 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 13:50:59,512 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 13:51:01,466 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 13:51:01,466 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-14 13:51:01,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:51:01 BoogieIcfgContainer [2024-06-14 13:51:01,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 13:51:01,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 13:51:01,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 13:51:01,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 13:51:01,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 01:50:55" (1/4) ... [2024-06-14 13:51:01,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d44c16 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 01:51:01, skipping insertion in model container [2024-06-14 13:51:01,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 01:50:57" (2/4) ... [2024-06-14 13:51:01,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d44c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:51:01, skipping insertion in model container [2024-06-14 13:51:01,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 01:50:57" (3/4) ... [2024-06-14 13:51:01,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d44c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 01:51:01, skipping insertion in model container [2024-06-14 13:51:01,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 01:51:01" (4/4) ... [2024-06-14 13:51:01,475 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-06-14 13:51:01,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 13:51:01,491 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 13:51:01,491 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 13:51:01,613 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 13:51:01,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 86 flow [2024-06-14 13:51:01,676 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-06-14 13:51:01,677 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 13:51:01,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 4/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-06-14 13:51:01,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 86 flow [2024-06-14 13:51:01,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 73 flow [2024-06-14 13:51:01,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 13:51:01,702 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@387c6f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 13:51:01,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 13:51:01,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 13:51:01,709 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 13:51:01,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 13:51:01,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:01,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 13:51:01,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:01,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1942963814, now seen corresponding path program 1 times [2024-06-14 13:51:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169080762] [2024-06-14 13:51:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169080762] [2024-06-14 13:51:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169080762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:02,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 13:51:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395265961] [2024-06-14 13:51:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 13:51:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:02,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 13:51:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 13:51:02,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2024-06-14 13:51:02,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-06-14 13:51:02,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:02,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2024-06-14 13:51:02,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:02,832 INFO L124 PetriNetUnfolderBase]: 372/623 cut-off events. [2024-06-14 13:51:02,832 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-14 13:51:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 623 events. 372/623 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2420 event pairs, 126 based on Foata normal form. 12/521 useless extension candidates. Maximal degree in co-relation 1168. Up to 433 conditions per place. [2024-06-14 13:51:02,837 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 33 selfloop transitions, 3 changer transitions 4/43 dead transitions. [2024-06-14 13:51:02,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 178 flow [2024-06-14 13:51:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 13:51:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 13:51:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-14 13:51:02,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-14 13:51:02,848 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 73 flow. Second operand 3 states and 59 transitions. [2024-06-14 13:51:02,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 178 flow [2024-06-14 13:51:02,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 13:51:02,853 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 82 flow [2024-06-14 13:51:02,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2024-06-14 13:51:02,856 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2024-06-14 13:51:02,857 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 82 flow [2024-06-14 13:51:02,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-06-14 13:51:02,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:02,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:02,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 13:51:02,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:02,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash -890743131, now seen corresponding path program 1 times [2024-06-14 13:51:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371235786] [2024-06-14 13:51:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371235786] [2024-06-14 13:51:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371235786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:02,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:51:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262741330] [2024-06-14 13:51:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 13:51:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 13:51:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 13:51:02,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:51:02,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-06-14 13:51:02,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:02,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:51:02,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:03,128 INFO L124 PetriNetUnfolderBase]: 231/412 cut-off events. [2024-06-14 13:51:03,129 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-06-14 13:51:03,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 412 events. 231/412 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1417 event pairs, 166 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 612. Up to 360 conditions per place. [2024-06-14 13:51:03,131 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 33 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2024-06-14 13:51:03,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 167 flow [2024-06-14 13:51:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 13:51:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 13:51:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-14 13:51:03,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 13:51:03,133 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 82 flow. Second operand 3 states and 54 transitions. [2024-06-14 13:51:03,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 167 flow [2024-06-14 13:51:03,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 13:51:03,134 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 79 flow [2024-06-14 13:51:03,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2024-06-14 13:51:03,135 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2024-06-14 13:51:03,135 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 79 flow [2024-06-14 13:51:03,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-06-14 13:51:03,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:03,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:03,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 13:51:03,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:03,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash -890743100, now seen corresponding path program 1 times [2024-06-14 13:51:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717599808] [2024-06-14 13:51:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:03,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717599808] [2024-06-14 13:51:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717599808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:51:03,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:51:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 13:51:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584032254] [2024-06-14 13:51:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:51:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 13:51:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 13:51:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 13:51:03,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:51:03,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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) [2024-06-14 13:51:03,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:03,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:51:03,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:03,968 INFO L124 PetriNetUnfolderBase]: 311/550 cut-off events. [2024-06-14 13:51:03,968 INFO L125 PetriNetUnfolderBase]: For 80/82 co-relation queries the response was YES. [2024-06-14 13:51:03,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 550 events. 311/550 cut-off events. For 80/82 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2174 event pairs, 42 based on Foata normal form. 18/506 useless extension candidates. Maximal degree in co-relation 968. Up to 315 conditions per place. [2024-06-14 13:51:03,973 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 51 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2024-06-14 13:51:03,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 65 transitions, 293 flow [2024-06-14 13:51:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:51:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:51:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-14 13:51:03,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-14 13:51:03,977 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 79 flow. Second operand 6 states and 100 transitions. [2024-06-14 13:51:03,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 65 transitions, 293 flow [2024-06-14 13:51:03,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 65 transitions, 282 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 13:51:03,981 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 139 flow [2024-06-14 13:51:03,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2024-06-14 13:51:03,983 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-14 13:51:03,983 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 139 flow [2024-06-14 13:51:03,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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) [2024-06-14 13:51:03,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:03,984 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:03,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 13:51:03,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:03,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1843229953, now seen corresponding path program 2 times [2024-06-14 13:51:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143719754] [2024-06-14 13:51:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143719754] [2024-06-14 13:51:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143719754] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 13:51:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737488491] [2024-06-14 13:51:04,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-14 13:51:04,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:51:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:51:04,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 13:51:04,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-14 13:51:04,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-14 13:51:04,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 13:51:04,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-14 13:51:05,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 13:51:05,048 INFO L378 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 22 treesize of output 21 [2024-06-14 13:51:05,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 194 [2024-06-14 13:51:05,213 INFO L378 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 43 treesize of output 32 [2024-06-14 13:51:05,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 144 [2024-06-14 13:51:05,289 INFO L378 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 8 treesize of output 1 [2024-06-14 13:51:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:05,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 13:51:05,431 INFO L378 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 9 treesize of output 5 [2024-06-14 13:51:09,737 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int#2| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (let ((.cse8 (not (= |c_#ghost~m_locked| 0))) (.cse11 (<= 0 (select .cse0 .cse5))) (.cse12 (select .cse0 .cse2))) (let ((.cse3 (or (and .cse8 .cse11) (not (= .cse12 22)))) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ (* .cse12 4) |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_390 Int)) (= (select (store .cse0 .cse1 v_ArrVal_390) .cse2) 20)) (let ((.cse7 (+ (select .cse0 .cse6) 1))) (and .cse3 (forall ((v_DerPreprocessor_28 Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_27 Int)) (let ((.cse4 (store .cse0 .cse1 v_DerPreprocessor_26))) (or (< 0 (+ (select .cse4 .cse5) 1)) (not (= v_DerPreprocessor_28 (+ 1 (select (store .cse0 .cse1 (select (store (store .cse4 .cse6 v_DerPreprocessor_27) .cse2 v_DerPreprocessor_28) .cse1)) .cse2)))) (not (= v_DerPreprocessor_27 .cse7)) (= v_DerPreprocessor_28 20)))) (or .cse8 (forall ((v_DerPreprocessor_28 Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_27 Int)) (or (not (= v_DerPreprocessor_28 (+ 1 (select (store .cse0 .cse1 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_26) .cse6 v_DerPreprocessor_27) .cse2 v_DerPreprocessor_28) .cse1)) .cse2)))) (not (= v_DerPreprocessor_27 .cse7))))) (forall ((v_DerPreprocessor_28 Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_27 Int)) (let ((.cse9 (store (store (store .cse0 .cse1 v_DerPreprocessor_26) .cse6 v_DerPreprocessor_27) .cse2 v_DerPreprocessor_28))) (let ((.cse10 (store .cse0 .cse1 (select .cse9 .cse1)))) (or (forall ((v_ArrVal_393 Int)) (not (= (select (store .cse9 (+ (* v_DerPreprocessor_28 4) |c_~#queue~0.offset|) v_ArrVal_393) .cse2) 20))) (not (= v_DerPreprocessor_28 (+ 1 (select .cse10 .cse2)))) (not (= v_DerPreprocessor_27 (+ (select .cse10 .cse6) 1))))))) (or (and .cse8 (forall ((v_DerPreprocessor_29 Int) (v_ArrVal_393 Int)) (not (= (select (store (store (store .cse0 .cse6 .cse7) .cse2 v_DerPreprocessor_29) (+ |c_~#queue~0.offset| (* v_DerPreprocessor_29 4)) v_ArrVal_393) .cse2) 20))) .cse11) (not (= .cse12 21)))))) (or (forall ((v_ArrVal_390 Int)) (not (= (select (store .cse0 .cse1 v_ArrVal_390) .cse2) 20))) (and .cse3 (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int)) (let ((.cse14 (store .cse0 .cse1 v_DerPreprocessor_22))) (let ((.cse13 (select (store (store .cse14 .cse6 v_DerPreprocessor_23) .cse2 1) .cse1))) (or (not (= v_DerPreprocessor_22 .cse13)) (< 0 (+ (select .cse14 .cse5) 1)) (not (= (+ 1 (select (store .cse0 .cse1 .cse13) .cse6)) v_DerPreprocessor_23)))))) (or .cse8 (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int)) (let ((.cse15 (select (store (store (store .cse0 .cse1 v_DerPreprocessor_22) .cse6 v_DerPreprocessor_23) .cse2 1) .cse1))) (or (not (= v_DerPreprocessor_22 .cse15)) (not (= (+ 1 (select (store .cse0 .cse1 .cse15) .cse6)) v_DerPreprocessor_23)))))))))))) is different from false [2024-06-14 13:51:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-06-14 13:51:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737488491] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 13:51:11,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 13:51:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 14 [2024-06-14 13:51:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028379503] [2024-06-14 13:51:11,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 13:51:11,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-14 13:51:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-14 13:51:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2024-06-14 13:51:11,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:51:11,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 139 flow. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 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) [2024-06-14 13:51:11,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:11,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:51:11,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:16,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:51:18,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:51:18,639 INFO L124 PetriNetUnfolderBase]: 775/1286 cut-off events. [2024-06-14 13:51:18,640 INFO L125 PetriNetUnfolderBase]: For 466/484 co-relation queries the response was YES. [2024-06-14 13:51:18,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 1286 events. 775/1286 cut-off events. For 466/484 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5999 event pairs, 49 based on Foata normal form. 86/1306 useless extension candidates. Maximal degree in co-relation 2962. Up to 383 conditions per place. [2024-06-14 13:51:18,647 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 120 selfloop transitions, 49 changer transitions 0/172 dead transitions. [2024-06-14 13:51:18,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 172 transitions, 913 flow [2024-06-14 13:51:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-14 13:51:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-14 13:51:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 267 transitions. [2024-06-14 13:51:18,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-06-14 13:51:18,649 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 139 flow. Second operand 15 states and 267 transitions. [2024-06-14 13:51:18,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 172 transitions, 913 flow [2024-06-14 13:51:18,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 172 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 13:51:18,652 INFO L231 Difference]: Finished difference. Result has 59 places, 82 transitions, 528 flow [2024-06-14 13:51:18,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=528, PETRI_PLACES=59, PETRI_TRANSITIONS=82} [2024-06-14 13:51:18,653 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2024-06-14 13:51:18,654 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 82 transitions, 528 flow [2024-06-14 13:51:18,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 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) [2024-06-14 13:51:18,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:18,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:18,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-14 13:51:18,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:51:18,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:18,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1305552347, now seen corresponding path program 1 times [2024-06-14 13:51:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106852083] [2024-06-14 13:51:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106852083] [2024-06-14 13:51:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106852083] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 13:51:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60417514] [2024-06-14 13:51:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:19,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:51:19,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:51:19,001 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 13:51:19,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-14 13:51:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:19,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-14 13:51:19,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 13:51:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:19,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 13:51:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60417514] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 13:51:19,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 13:51:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-06-14 13:51:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449998643] [2024-06-14 13:51:19,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 13:51:19,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 13:51:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:51:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 13:51:19,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-06-14 13:51:19,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:51:19,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 82 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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) [2024-06-14 13:51:19,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:51:19,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:51:19,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:51:19,567 INFO L124 PetriNetUnfolderBase]: 524/885 cut-off events. [2024-06-14 13:51:19,567 INFO L125 PetriNetUnfolderBase]: For 2451/2451 co-relation queries the response was YES. [2024-06-14 13:51:19,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 885 events. 524/885 cut-off events. For 2451/2451 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3729 event pairs, 161 based on Foata normal form. 110/994 useless extension candidates. Maximal degree in co-relation 2588. Up to 536 conditions per place. [2024-06-14 13:51:19,574 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 100 selfloop transitions, 18 changer transitions 0/121 dead transitions. [2024-06-14 13:51:19,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 931 flow [2024-06-14 13:51:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 13:51:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 13:51:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-14 13:51:19,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-06-14 13:51:19,576 INFO L175 Difference]: Start difference. First operand has 59 places, 82 transitions, 528 flow. Second operand 6 states and 116 transitions. [2024-06-14 13:51:19,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 931 flow [2024-06-14 13:51:19,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 828 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-14 13:51:19,588 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 478 flow [2024-06-14 13:51:19,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2024-06-14 13:51:19,589 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-06-14 13:51:19,589 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 478 flow [2024-06-14 13:51:19,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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) [2024-06-14 13:51:19,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:51:19,590 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:51:19,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-14 13:51:19,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:51:19,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:51:19,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:51:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -504296060, now seen corresponding path program 3 times [2024-06-14 13:51:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:51:19,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542746036] [2024-06-14 13:51:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:51:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:51:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:51:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:51:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542746036] [2024-06-14 13:51:20,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542746036] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 13:51:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509753251] [2024-06-14 13:51:20,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-14 13:51:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:51:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:51:20,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 13:51:20,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-14 13:51:21,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-14 13:51:21,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 13:51:21,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-14 13:51:21,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 13:51:21,303 INFO L378 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 16 treesize of output 15 [2024-06-14 13:51:21,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 138 [2024-06-14 13:51:21,434 INFO L378 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 68 treesize of output 48 [2024-06-14 13:51:21,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 119 [2024-06-14 13:51:21,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 124 [2024-06-14 13:51:21,603 INFO L378 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 8 treesize of output 1 [2024-06-14 13:51:21,618 INFO L378 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 8 treesize of output 1 [2024-06-14 13:51:21,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 153 [2024-06-14 13:51:21,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 123 [2024-06-14 13:51:21,741 INFO L378 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 8 treesize of output 1 [2024-06-14 13:51:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:51:21,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 13:51:21,958 INFO L378 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 7 treesize of output 3 [2024-06-14 13:51:31,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-06-14 13:51:32,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 80 [2024-06-14 13:51:32,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-06-14 13:51:32,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 75 [2024-06-14 13:51:32,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 81 [2024-06-14 13:51:32,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 62 [2024-06-14 13:51:32,424 INFO L378 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 63 treesize of output 43 [2024-06-14 13:51:32,438 INFO L378 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 27 treesize of output 23 [2024-06-14 13:51:45,290 INFO L378 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 27 treesize of output 23 [2024-06-14 13:51:45,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 13:51:45,315 INFO L378 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 90 treesize of output 82 [2024-06-14 13:51:45,394 INFO L378 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 87 treesize of output 67 [2024-06-14 13:51:45,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 13:51:45,533 INFO L378 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 32 treesize of output 24 [2024-06-14 13:51:45,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 13:51:45,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 187 [2024-06-14 13:51:45,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 80 [2024-06-14 13:51:45,777 INFO L378 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 [2024-06-14 13:51:45,789 INFO L378 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 [2024-06-14 13:51:45,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 75 [2024-06-14 13:51:45,902 INFO L378 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 30 treesize of output 18 [2024-06-14 13:51:45,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-06-14 13:51:45,999 INFO L378 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 30 treesize of output 18 [2024-06-14 13:51:46,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-06-14 13:53:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:53:35,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509753251] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 13:53:35,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 13:53:35,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-06-14 13:53:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387725625] [2024-06-14 13:53:35,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 13:53:35,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-06-14 13:53:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:53:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-06-14 13:53:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=358, Unknown=18, NotChecked=0, Total=506 [2024-06-14 13:53:35,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:53:35,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 478 flow. Second operand has 23 states, 23 states have (on average 7.826086956521739) internal successors, (180), 23 states have internal predecessors, (180), 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) [2024-06-14 13:53:35,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:53:35,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:53:35,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:53:44,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:54:10,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:54:14,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:54:19,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:54:23,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:54:26,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:19,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:23,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:27,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:31,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:35,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:39,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:44,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:48,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:52,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:55:56,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:00,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:04,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:08,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:12,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:16,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:20,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:24,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:28,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:53,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:56:57,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:01,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:05,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:09,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:13,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:17,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:21,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:25,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:29,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:33,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:37,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:41,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:45,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:49,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:53,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:57:57,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:01,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:05,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:09,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:13,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:17,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:22,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:26,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:30,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:34,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:38,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:43,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:49,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:53,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:58:57,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:01,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:05,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:09,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:13,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:17,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:21,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:25,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:29,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-14 13:59:29,815 INFO L124 PetriNetUnfolderBase]: 1293/2068 cut-off events. [2024-06-14 13:59:29,815 INFO L125 PetriNetUnfolderBase]: For 9232/9246 co-relation queries the response was YES. [2024-06-14 13:59:29,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8047 conditions, 2068 events. 1293/2068 cut-off events. For 9232/9246 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9573 event pairs, 52 based on Foata normal form. 134/2202 useless extension candidates. Maximal degree in co-relation 6966. Up to 715 conditions per place. [2024-06-14 13:59:29,826 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 200 selfloop transitions, 107 changer transitions 0/310 dead transitions. [2024-06-14 13:59:29,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 310 transitions, 2116 flow [2024-06-14 13:59:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-14 13:59:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-14 13:59:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 408 transitions. [2024-06-14 13:59:29,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-06-14 13:59:29,827 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 478 flow. Second operand 22 states and 408 transitions. [2024-06-14 13:59:29,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 310 transitions, 2116 flow [2024-06-14 13:59:29,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 310 transitions, 2102 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-14 13:59:29,844 INFO L231 Difference]: Finished difference. Result has 99 places, 152 transitions, 1366 flow [2024-06-14 13:59:29,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1366, PETRI_PLACES=99, PETRI_TRANSITIONS=152} [2024-06-14 13:59:29,848 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2024-06-14 13:59:29,848 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 152 transitions, 1366 flow [2024-06-14 13:59:29,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.826086956521739) internal successors, (180), 23 states have internal predecessors, (180), 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) [2024-06-14 13:59:29,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:29,848 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:59:29,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-14 13:59:30,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:59:30,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:59:30,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1546692672, now seen corresponding path program 2 times [2024-06-14 13:59:30,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:30,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726015608] [2024-06-14 13:59:30,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:30,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726015608] [2024-06-14 13:59:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726015608] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 13:59:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220527113] [2024-06-14 13:59:30,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-14 13:59:30,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:59:30,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:59:30,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 13:59:30,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-14 13:59:30,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-14 13:59:30,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 13:59:30,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-14 13:59:30,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 13:59:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:30,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 13:59:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:30,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220527113] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 13:59:30,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-14 13:59:30,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-06-14 13:59:30,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506441560] [2024-06-14 13:59:30,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-14 13:59:30,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 13:59:30,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:30,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 13:59:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-06-14 13:59:30,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:59:30,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 152 transitions, 1366 flow. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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) [2024-06-14 13:59:30,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:30,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:59:30,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:31,260 INFO L124 PetriNetUnfolderBase]: 1060/1733 cut-off events. [2024-06-14 13:59:31,260 INFO L125 PetriNetUnfolderBase]: For 18896/18896 co-relation queries the response was YES. [2024-06-14 13:59:31,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9140 conditions, 1733 events. 1060/1733 cut-off events. For 18896/18896 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7700 event pairs, 167 based on Foata normal form. 298/2030 useless extension candidates. Maximal degree in co-relation 7789. Up to 697 conditions per place. [2024-06-14 13:59:31,274 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 246 selfloop transitions, 64 changer transitions 0/313 dead transitions. [2024-06-14 13:59:31,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 313 transitions, 3180 flow [2024-06-14 13:59:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 13:59:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 13:59:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2024-06-14 13:59:31,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5532407407407407 [2024-06-14 13:59:31,276 INFO L175 Difference]: Start difference. First operand has 99 places, 152 transitions, 1366 flow. Second operand 12 states and 239 transitions. [2024-06-14 13:59:31,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 313 transitions, 3180 flow [2024-06-14 13:59:31,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 313 transitions, 2840 flow, removed 152 selfloop flow, removed 5 redundant places. [2024-06-14 13:59:31,313 INFO L231 Difference]: Finished difference. Result has 110 places, 155 transitions, 1475 flow [2024-06-14 13:59:31,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1475, PETRI_PLACES=110, PETRI_TRANSITIONS=155} [2024-06-14 13:59:31,313 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2024-06-14 13:59:31,313 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 155 transitions, 1475 flow [2024-06-14 13:59:31,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 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) [2024-06-14 13:59:31,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:31,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:59:31,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-14 13:59:31,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:59:31,526 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:59:31,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash -166403684, now seen corresponding path program 1 times [2024-06-14 13:59:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441806511] [2024-06-14 13:59:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:31,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441806511] [2024-06-14 13:59:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441806511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 13:59:31,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 13:59:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 13:59:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303178482] [2024-06-14 13:59:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 13:59:31,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 13:59:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 13:59:31,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 13:59:31,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 13:59:31,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-14 13:59:31,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 155 transitions, 1475 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2024-06-14 13:59:31,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 13:59:31,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-14 13:59:31,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 13:59:31,836 INFO L124 PetriNetUnfolderBase]: 310/607 cut-off events. [2024-06-14 13:59:31,836 INFO L125 PetriNetUnfolderBase]: For 5925/5925 co-relation queries the response was YES. [2024-06-14 13:59:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 607 events. 310/607 cut-off events. For 5925/5925 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2194 event pairs, 57 based on Foata normal form. 34/639 useless extension candidates. Maximal degree in co-relation 3055. Up to 443 conditions per place. [2024-06-14 13:59:31,841 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 43 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2024-06-14 13:59:31,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 53 transitions, 542 flow [2024-06-14 13:59:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 13:59:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 13:59:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-06-14 13:59:31,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-14 13:59:31,842 INFO L175 Difference]: Start difference. First operand has 110 places, 155 transitions, 1475 flow. Second operand 3 states and 56 transitions. [2024-06-14 13:59:31,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 53 transitions, 542 flow [2024-06-14 13:59:31,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 53 transitions, 400 flow, removed 48 selfloop flow, removed 32 redundant places. [2024-06-14 13:59:31,853 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 246 flow [2024-06-14 13:59:31,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2024-06-14 13:59:31,855 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2024-06-14 13:59:31,855 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 246 flow [2024-06-14 13:59:31,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2024-06-14 13:59:31,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 13:59:31,855 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 13:59:31,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 13:59:31,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 13:59:31,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 13:59:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 901352356, now seen corresponding path program 4 times [2024-06-14 13:59:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 13:59:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472993585] [2024-06-14 13:59:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 13:59:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 13:59:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 13:59:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:35,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 13:59:35,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472993585] [2024-06-14 13:59:35,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472993585] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-14 13:59:35,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651715042] [2024-06-14 13:59:35,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-14 13:59:35,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 13:59:35,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 13:59:35,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 13:59:35,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-14 13:59:35,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-14 13:59:35,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 13:59:35,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 60 conjunts are in the unsatisfiable core [2024-06-14 13:59:35,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 13:59:35,365 INFO L378 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 22 treesize of output 21 [2024-06-14 13:59:35,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 183 [2024-06-14 13:59:35,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 150 [2024-06-14 13:59:35,521 INFO L378 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 8 treesize of output 1 [2024-06-14 13:59:35,529 INFO L378 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 8 treesize of output 1 [2024-06-14 13:59:35,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 159 [2024-06-14 13:59:35,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 168 [2024-06-14 13:59:35,693 INFO L378 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 8 treesize of output 1 [2024-06-14 13:59:35,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 177 [2024-06-14 13:59:36,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 186 [2024-06-14 13:59:36,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 195 [2024-06-14 13:59:36,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 242 [2024-06-14 13:59:37,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 251 [2024-06-14 13:59:37,155 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 13:59:37,170 INFO L378 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 241 treesize of output 219 [2024-06-14 13:59:37,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 222 [2024-06-14 13:59:38,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 214 [2024-06-14 13:59:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 13:59:40,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 13:59:40,450 INFO L378 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 9 treesize of output 5 [2024-06-14 13:59:40,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 13:59:40,896 INFO L378 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 37 treesize of output 21 [2024-06-14 14:00:24,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:00:24,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 361 treesize of output 241 [2024-06-14 14:01:14,237 INFO L378 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 58 treesize of output 34 [2024-06-14 14:01:14,243 INFO L378 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 [2024-06-14 14:01:14,276 INFO L378 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 94 treesize of output 58 [2024-06-14 14:01:14,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:01:14,359 INFO L378 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 21 treesize of output 13 [2024-06-14 14:01:14,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 98 [2024-06-14 14:01:14,461 INFO L378 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 [2024-06-14 14:01:14,492 INFO L378 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 63 treesize of output 43 [2024-06-14 14:01:14,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2024-06-14 14:01:14,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 83 [2024-06-14 14:01:14,786 INFO L378 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 30 treesize of output 18 [2024-06-14 14:01:38,865 INFO L378 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 [2024-06-14 14:01:38,876 INFO L378 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 101 treesize of output 61 [2024-06-14 14:01:38,930 INFO L378 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 [2024-06-14 14:01:38,982 INFO L378 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 63 treesize of output 43 [2024-06-14 14:01:38,990 INFO L378 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 30 treesize of output 18 [2024-06-14 14:01:39,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 158 [2024-06-14 14:01:39,124 INFO L378 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 58 treesize of output 34 [2024-06-14 14:01:39,174 INFO L378 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 [2024-06-14 14:01:39,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-06-14 14:01:39,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 101 [2024-06-14 14:01:39,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 87 [2024-06-14 14:02:05,747 INFO L378 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 30 treesize of output 18 [2024-06-14 14:02:40,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 14:02:40,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95525 treesize of output 61949 [2024-06-14 14:03:22,734 INFO L378 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 30 treesize of output 18 Killed by 15