./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 21:59:04,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 21:59:04,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 21:59:04,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 21:59:04,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 21:59:04,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 21:59:04,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 21:59:04,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 21:59:04,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 21:59:04,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 21:59:04,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 21:59:04,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 21:59:04,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 21:59:04,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 21:59:04,930 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 21:59:04,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 21:59:04,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 21:59:04,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 21:59:04,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 21:59:04,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 21:59:04,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 21:59:04,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 21:59:04,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 21:59:04,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 21:59:04,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 21:59:04,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 21:59:04,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 21:59:04,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 21:59:04,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 21:59:04,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 21:59:04,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 21:59:04,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 21:59:04,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:04,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 21:59:04,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 21:59:04,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 21:59:04,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 21:59:04,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 21:59:04,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 21:59:04,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 21:59:04,937 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 21:59:04,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 21:59:04,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 21:59:04,938 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 [2024-06-27 21:59:05,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 21:59:05,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 21:59:05,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 21:59:05,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 21:59:05,184 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 21:59:05,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-06-27 21:59:06,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 21:59:06,455 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 21:59:06,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-06-27 21:59:06,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d687666/44ba015f09d944568847e3b7fa18e7cc/FLAGbbafa82d0 [2024-06-27 21:59:06,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25d687666/44ba015f09d944568847e3b7fa18e7cc [2024-06-27 21:59:06,496 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 21:59:06,496 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 21:59:06,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue.yml/witness.yml [2024-06-27 21:59:06,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 21:59:06,573 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 21:59:06,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:06,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 21:59:06,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 21:59:06,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:06" (1/2) ... [2024-06-27 21:59:06,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3d4ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:06, skipping insertion in model container [2024-06-27 21:59:06,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:06" (1/2) ... [2024-06-27 21:59:06,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e509378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:06, skipping insertion in model container [2024-06-27 21:59:06,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:06" (2/2) ... [2024-06-27 21:59:06,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3d4ffe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:06, skipping insertion in model container [2024-06-27 21:59:06,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:06" (2/2) ... [2024-06-27 21:59:06,592 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 21:59:06,623 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 21:59:06,624 INFO L97 edCorrectnessWitness]: Location invariant before [L1065-L1065] ! multithreaded || (m_locked || ((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL)) [2024-06-27 21:59:06,624 INFO L97 edCorrectnessWitness]: Location invariant before [L1064-L1064] ! multithreaded || (m_locked || ((-1LL + (long long )dequeue_flag) + (long long )enqueue_flag >= 0LL && (1LL - (long long )dequeue_flag) - (long long )enqueue_flag >= 0LL)) [2024-06-27 21:59:06,624 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-27 21:59:06,625 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 21:59:06,625 INFO L106 edCorrectnessWitness]: ghost_update [L1017-L1017] m_locked = 0; [2024-06-27 21:59:06,625 INFO L106 edCorrectnessWitness]: ghost_update [L1029-L1029] m_locked = 0; [2024-06-27 21:59:06,625 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-27 21:59:06,625 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 1; [2024-06-27 21:59:06,625 INFO L106 edCorrectnessWitness]: ghost_update [L1048-L1048] m_locked = 0; [2024-06-27 21:59:06,625 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 1; [2024-06-27 21:59:06,626 INFO L106 edCorrectnessWitness]: ghost_update [L1063-L1063] multithreaded = 1; [2024-06-27 21:59:06,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 21:59:07,031 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-06-27 21:59:07,039 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-06-27 21:59:07,044 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-06-27 21:59:07,048 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:07,058 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:07,141 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] Start Parsing Local [2024-06-27 21:59:07,145 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] Start Parsing Local [2024-06-27 21:59:07,148 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:07,159 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:07,218 INFO L206 MainTranslator]: Completed translation [2024-06-27 21:59:07,220 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07 WrapperNode [2024-06-27 21:59:07,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:07,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:07,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 21:59:07,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 21:59:07,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,267 INFO L138 Inliner]: procedures = 274, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-06-27 21:59:07,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:07,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 21:59:07,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 21:59:07,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 21:59:07,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,310 INFO L175 MemorySlicer]: Split 51 memory accesses to 5 slices as follows [2, 8, 5, 4, 32]. 63 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 8, 5, 0, 0]. The 18 writes are split as follows [0, 0, 0, 3, 15]. [2024-06-27 21:59:07,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 21:59:07,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 21:59:07,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 21:59:07,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 21:59:07,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (1/1) ... [2024-06-27 21:59:07,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:07,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:07,397 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-27 21:59:07,439 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-27 21:59:07,450 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 21:59:07,450 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 21:59:07,451 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 21:59:07,451 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 21:59:07,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 21:59:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 21:59:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-06-27 21:59:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 21:59:07,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 21:59:07,456 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 21:59:07,590 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 21:59:07,591 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 21:59:07,897 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 21:59:07,899 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 21:59:08,181 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 21:59:08,181 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 21:59:08,182 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:08 BoogieIcfgContainer [2024-06-27 21:59:08,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 21:59:08,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 21:59:08,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 21:59:08,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 21:59:08,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 09:59:06" (1/4) ... [2024-06-27 21:59:08,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a30bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:06" (2/4) ... [2024-06-27 21:59:08,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a30bf7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:07" (3/4) ... [2024-06-27 21:59:08,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a30bf7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:08" (4/4) ... [2024-06-27 21:59:08,190 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-06-27 21:59:08,205 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 21:59:08,205 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 21:59:08,205 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 21:59:08,260 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 21:59:08,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 51 transitions, 116 flow [2024-06-27 21:59:08,313 INFO L124 PetriNetUnfolderBase]: 7/49 cut-off events. [2024-06-27 21:59:08,315 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 21:59:08,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 49 events. 7/49 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-06-27 21:59:08,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 51 transitions, 116 flow [2024-06-27 21:59:08,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 47 transitions, 103 flow [2024-06-27 21:59:08,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 21:59:08,378 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;@11aeac01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 21:59:08,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 21:59:08,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 21:59:08,381 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 21:59:08,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:08,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:08,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 21:59:08,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:08,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 660850, now seen corresponding path program 1 times [2024-06-27 21:59:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590582722] [2024-06-27 21:59:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:08,643 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-27 21:59:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590582722] [2024-06-27 21:59:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590582722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:08,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:08,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679893345] [2024-06-27 21:59:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:08,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 21:59:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 21:59:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 21:59:08,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-06-27 21:59:08,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 103 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:08,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:08,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-06-27 21:59:08,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:08,869 INFO L124 PetriNetUnfolderBase]: 439/839 cut-off events. [2024-06-27 21:59:08,869 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 21:59:08,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 839 events. 439/839 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4084 event pairs, 343 based on Foata normal form. 48/776 useless extension candidates. Maximal degree in co-relation 1538. Up to 720 conditions per place. [2024-06-27 21:59:08,876 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 31 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2024-06-27 21:59:08,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 155 flow [2024-06-27 21:59:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 21:59:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 21:59:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2024-06-27 21:59:08,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-06-27 21:59:08,886 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 103 flow. Second operand 2 states and 62 transitions. [2024-06-27 21:59:08,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 155 flow [2024-06-27 21:59:08,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:08,890 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 88 flow [2024-06-27 21:59:08,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2024-06-27 21:59:08,894 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2024-06-27 21:59:08,894 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 88 flow [2024-06-27 21:59:08,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:08,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:08,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-27 21:59:08,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 21:59:08,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:08,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1785321384, now seen corresponding path program 1 times [2024-06-27 21:59:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102540646] [2024-06-27 21:59:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:09,136 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-27 21:59:09,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102540646] [2024-06-27 21:59:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102540646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 21:59:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280423576] [2024-06-27 21:59:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:09,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:09,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-06-27 21:59:09,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-27 21:59:09,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:09,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-06-27 21:59:09,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:09,332 INFO L124 PetriNetUnfolderBase]: 552/1055 cut-off events. [2024-06-27 21:59:09,332 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 21:59:09,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 1055 events. 552/1055 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4912 event pairs, 272 based on Foata normal form. 94/1087 useless extension candidates. Maximal degree in co-relation 1997. Up to 471 conditions per place. [2024-06-27 21:59:09,339 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 44 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2024-06-27 21:59:09,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 217 flow [2024-06-27 21:59:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-06-27 21:59:09,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2024-06-27 21:59:09,342 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 88 flow. Second operand 3 states and 87 transitions. [2024-06-27 21:59:09,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 217 flow [2024-06-27 21:59:09,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 21:59:09,346 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 107 flow [2024-06-27 21:59:09,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-06-27 21:59:09,346 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2024-06-27 21:59:09,347 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 107 flow [2024-06-27 21:59:09,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-27 21:59:09,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:09,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:09,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 21:59:09,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:09,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1892990267, now seen corresponding path program 1 times [2024-06-27 21:59:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:09,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183622388] [2024-06-27 21:59:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:09,405 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-27 21:59:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183622388] [2024-06-27 21:59:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183622388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:09,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048022647] [2024-06-27 21:59:09,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:09,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:09,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-06-27 21:59:09,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-27 21:59:09,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:09,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-06-27 21:59:09,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:09,531 INFO L124 PetriNetUnfolderBase]: 466/936 cut-off events. [2024-06-27 21:59:09,532 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-27 21:59:09,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 936 events. 466/936 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4447 event pairs, 344 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 1874. Up to 753 conditions per place. [2024-06-27 21:59:09,536 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 38 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-06-27 21:59:09,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 205 flow [2024-06-27 21:59:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-27 21:59:09,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5359477124183006 [2024-06-27 21:59:09,537 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 107 flow. Second operand 3 states and 82 transitions. [2024-06-27 21:59:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 205 flow [2024-06-27 21:59:09,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 21:59:09,539 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 106 flow [2024-06-27 21:59:09,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-06-27 21:59:09,540 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2024-06-27 21:59:09,540 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 106 flow [2024-06-27 21:59:09,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-27 21:59:09,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:09,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:09,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 21:59:09,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:09,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1446845542, now seen corresponding path program 1 times [2024-06-27 21:59:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981604042] [2024-06-27 21:59:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:09,857 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-27 21:59:09,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981604042] [2024-06-27 21:59:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981604042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 21:59:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749565057] [2024-06-27 21:59:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:09,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 21:59:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 21:59:09,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 21:59:09,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-06-27 21:59:09,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-27 21:59:09,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:09,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-06-27 21:59:09,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,056 INFO L124 PetriNetUnfolderBase]: 488/967 cut-off events. [2024-06-27 21:59:10,056 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-27 21:59:10,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 967 events. 488/967 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4546 event pairs, 139 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1947. Up to 504 conditions per place. [2024-06-27 21:59:10,061 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 54 selfloop transitions, 5 changer transitions 2/71 dead transitions. [2024-06-27 21:59:10,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 295 flow [2024-06-27 21:59:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 21:59:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 21:59:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-06-27 21:59:10,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137254901960784 [2024-06-27 21:59:10,066 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 106 flow. Second operand 5 states and 131 transitions. [2024-06-27 21:59:10,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 295 flow [2024-06-27 21:59:10,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:10,069 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 118 flow [2024-06-27 21:59:10,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-27 21:59:10,070 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2024-06-27 21:59:10,071 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 118 flow [2024-06-27 21:59:10,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-27 21:59:10,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:10,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 21:59:10,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:10,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1312506673, now seen corresponding path program 1 times [2024-06-27 21:59:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084198929] [2024-06-27 21:59:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:10,134 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-27 21:59:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084198929] [2024-06-27 21:59:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084198929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:10,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:10,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:10,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843151611] [2024-06-27 21:59:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 21:59:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 21:59:10,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 21:59:10,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2024-06-27 21:59:10,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-27 21:59:10,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:10,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2024-06-27 21:59:10,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,299 INFO L124 PetriNetUnfolderBase]: 714/1440 cut-off events. [2024-06-27 21:59:10,299 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2024-06-27 21:59:10,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 1440 events. 714/1440 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7608 event pairs, 258 based on Foata normal form. 32/1441 useless extension candidates. Maximal degree in co-relation 2988. Up to 681 conditions per place. [2024-06-27 21:59:10,306 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 54 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-06-27 21:59:10,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 325 flow [2024-06-27 21:59:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 21:59:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 21:59:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-27 21:59:10,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2024-06-27 21:59:10,308 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 118 flow. Second operand 5 states and 115 transitions. [2024-06-27 21:59:10,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 325 flow [2024-06-27 21:59:10,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:10,310 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 169 flow [2024-06-27 21:59:10,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-27 21:59:10,311 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-06-27 21:59:10,311 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 169 flow [2024-06-27 21:59:10,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-27 21:59:10,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:10,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 21:59:10,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:10,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2033002912, now seen corresponding path program 1 times [2024-06-27 21:59:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326888305] [2024-06-27 21:59:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:10,473 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-27 21:59:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326888305] [2024-06-27 21:59:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326888305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:10,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658627920] [2024-06-27 21:59:10,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:10,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 21:59:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:10,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 21:59:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 21:59:10,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2024-06-27 21:59:10,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-27 21:59:10,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:10,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2024-06-27 21:59:10,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,649 INFO L124 PetriNetUnfolderBase]: 608/1201 cut-off events. [2024-06-27 21:59:10,650 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-06-27 21:59:10,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 1201 events. 608/1201 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5898 event pairs, 311 based on Foata normal form. 54/1226 useless extension candidates. Maximal degree in co-relation 2901. Up to 649 conditions per place. [2024-06-27 21:59:10,655 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 48 selfloop transitions, 4 changer transitions 4/63 dead transitions. [2024-06-27 21:59:10,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 332 flow [2024-06-27 21:59:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 21:59:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 21:59:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-27 21:59:10,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2024-06-27 21:59:10,657 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 169 flow. Second operand 4 states and 92 transitions. [2024-06-27 21:59:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 332 flow [2024-06-27 21:59:10,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:10,659 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 165 flow [2024-06-27 21:59:10,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-06-27 21:59:10,662 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-06-27 21:59:10,662 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 165 flow [2024-06-27 21:59:10,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-27 21:59:10,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,662 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, 1, 1, 1, 1] [2024-06-27 21:59:10,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 21:59:10,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:10,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2019946026, now seen corresponding path program 1 times [2024-06-27 21:59:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029089922] [2024-06-27 21:59:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:10,759 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-27 21:59:10,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029089922] [2024-06-27 21:59:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029089922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:10,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613803291] [2024-06-27 21:59:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:10,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:10,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:10,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:10,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-06-27 21:59:10,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-27 21:59:10,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:10,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-06-27 21:59:10,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,840 INFO L124 PetriNetUnfolderBase]: 257/573 cut-off events. [2024-06-27 21:59:10,840 INFO L125 PetriNetUnfolderBase]: For 337/340 co-relation queries the response was YES. [2024-06-27 21:59:10,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 573 events. 257/573 cut-off events. For 337/340 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2370 event pairs, 85 based on Foata normal form. 34/597 useless extension candidates. Maximal degree in co-relation 1376. Up to 267 conditions per place. [2024-06-27 21:59:10,843 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 35 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2024-06-27 21:59:10,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 248 flow [2024-06-27 21:59:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-06-27 21:59:10,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2024-06-27 21:59:10,844 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 165 flow. Second operand 3 states and 84 transitions. [2024-06-27 21:59:10,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 248 flow [2024-06-27 21:59:10,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 221 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 21:59:10,846 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 126 flow [2024-06-27 21:59:10,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-06-27 21:59:10,847 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2024-06-27 21:59:10,847 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 126 flow [2024-06-27 21:59:10,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-27 21:59:10,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,848 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, 1, 1, 1, 1, 1] [2024-06-27 21:59:10,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 21:59:10,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:10,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1828641077, now seen corresponding path program 1 times [2024-06-27 21:59:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631750493] [2024-06-27 21:59:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:11,921 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-27 21:59:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631750493] [2024-06-27 21:59:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631750493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171977151] [2024-06-27 21:59:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:11,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:11,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 21:59:11,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 126 flow. Second operand has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:11,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:11,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 21:59:11,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:12,511 INFO L124 PetriNetUnfolderBase]: 568/1185 cut-off events. [2024-06-27 21:59:12,512 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2024-06-27 21:59:12,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1185 events. 568/1185 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6104 event pairs, 91 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 2671. Up to 394 conditions per place. [2024-06-27 21:59:12,516 INFO L140 encePairwiseOnDemand]: 35/51 looper letters, 82 selfloop transitions, 24 changer transitions 8/120 dead transitions. [2024-06-27 21:59:12,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 603 flow [2024-06-27 21:59:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 21:59:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 21:59:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 254 transitions. [2024-06-27 21:59:12,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3557422969187675 [2024-06-27 21:59:12,518 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 126 flow. Second operand 14 states and 254 transitions. [2024-06-27 21:59:12,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 603 flow [2024-06-27 21:59:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 120 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:12,520 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 290 flow [2024-06-27 21:59:12,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=290, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-06-27 21:59:12,521 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2024-06-27 21:59:12,521 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 290 flow [2024-06-27 21:59:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:12,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:12,522 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, 1, 1, 1, 1, 1] [2024-06-27 21:59:12,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 21:59:12,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:12,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1247045879, now seen corresponding path program 2 times [2024-06-27 21:59:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94626749] [2024-06-27 21:59:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:13,382 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-27 21:59:13,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:13,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94626749] [2024-06-27 21:59:13,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94626749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007717198] [2024-06-27 21:59:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:13,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:13,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 21:59:13,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 290 flow. Second operand has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:13,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:13,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 21:59:13,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:13,955 INFO L124 PetriNetUnfolderBase]: 689/1453 cut-off events. [2024-06-27 21:59:13,955 INFO L125 PetriNetUnfolderBase]: For 1755/1755 co-relation queries the response was YES. [2024-06-27 21:59:13,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4085 conditions, 1453 events. 689/1453 cut-off events. For 1755/1755 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8084 event pairs, 140 based on Foata normal form. 0/1437 useless extension candidates. Maximal degree in co-relation 4068. Up to 524 conditions per place. [2024-06-27 21:59:13,962 INFO L140 encePairwiseOnDemand]: 36/51 looper letters, 87 selfloop transitions, 28 changer transitions 8/129 dead transitions. [2024-06-27 21:59:13,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 818 flow [2024-06-27 21:59:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 21:59:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 21:59:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 256 transitions. [2024-06-27 21:59:13,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3585434173669468 [2024-06-27 21:59:13,963 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 290 flow. Second operand 14 states and 256 transitions. [2024-06-27 21:59:13,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 818 flow [2024-06-27 21:59:13,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 801 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:13,970 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 442 flow [2024-06-27 21:59:13,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=442, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2024-06-27 21:59:13,970 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2024-06-27 21:59:13,971 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 442 flow [2024-06-27 21:59:13,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:13,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:13,971 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, 1, 1, 1, 1, 1] [2024-06-27 21:59:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 21:59:13,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:13,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -276037597, now seen corresponding path program 3 times [2024-06-27 21:59:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250925153] [2024-06-27 21:59:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:14,856 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-27 21:59:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250925153] [2024-06-27 21:59:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250925153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314554590] [2024-06-27 21:59:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:14,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:14,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:14,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:14,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 21:59:14,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 442 flow. Second operand has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 21:59:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:15,398 INFO L124 PetriNetUnfolderBase]: 761/1609 cut-off events. [2024-06-27 21:59:15,398 INFO L125 PetriNetUnfolderBase]: For 3937/3937 co-relation queries the response was YES. [2024-06-27 21:59:15,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 1609 events. 761/1609 cut-off events. For 3937/3937 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9354 event pairs, 116 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 5067. Up to 550 conditions per place. [2024-06-27 21:59:15,407 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 95 selfloop transitions, 32 changer transitions 6/139 dead transitions. [2024-06-27 21:59:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 139 transitions, 1040 flow [2024-06-27 21:59:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 21:59:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 21:59:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2024-06-27 21:59:15,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38562091503267976 [2024-06-27 21:59:15,409 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 442 flow. Second operand 12 states and 236 transitions. [2024-06-27 21:59:15,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 139 transitions, 1040 flow [2024-06-27 21:59:15,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 139 transitions, 986 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 21:59:15,421 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 530 flow [2024-06-27 21:59:15,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=530, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2024-06-27 21:59:15,421 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2024-06-27 21:59:15,421 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 530 flow [2024-06-27 21:59:15,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:15,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:15,422 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, 1, 1, 1, 1, 1] [2024-06-27 21:59:15,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 21:59:15,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:15,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 457459641, now seen corresponding path program 4 times [2024-06-27 21:59:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884133382] [2024-06-27 21:59:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:16,138 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-27 21:59:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884133382] [2024-06-27 21:59:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884133382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 21:59:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350043142] [2024-06-27 21:59:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 21:59:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 21:59:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 21:59:16,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-06-27 21:59:16,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 530 flow. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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-27 21:59:16,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:16,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-06-27 21:59:16,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:16,457 INFO L124 PetriNetUnfolderBase]: 589/1324 cut-off events. [2024-06-27 21:59:16,457 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2024-06-27 21:59:16,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 1324 events. 589/1324 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7635 event pairs, 83 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 4453. Up to 340 conditions per place. [2024-06-27 21:59:16,464 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 88 selfloop transitions, 28 changer transitions 6/130 dead transitions. [2024-06-27 21:59:16,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 130 transitions, 1095 flow [2024-06-27 21:59:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 21:59:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 21:59:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-06-27 21:59:16,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2024-06-27 21:59:16,466 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 530 flow. Second operand 9 states and 219 transitions. [2024-06-27 21:59:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 130 transitions, 1095 flow [2024-06-27 21:59:16,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 130 transitions, 997 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 21:59:16,479 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 610 flow [2024-06-27 21:59:16,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=610, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2024-06-27 21:59:16,479 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2024-06-27 21:59:16,480 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 610 flow [2024-06-27 21:59:16,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 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-27 21:59:16,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:16,480 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, 1, 1, 1, 1, 1] [2024-06-27 21:59:16,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 21:59:16,480 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:16,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2094344885, now seen corresponding path program 5 times [2024-06-27 21:59:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:16,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726937527] [2024-06-27 21:59:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:17,394 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-27 21:59:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726937527] [2024-06-27 21:59:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726937527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404654464] [2024-06-27 21:59:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:17,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:17,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-06-27 21:59:17,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 610 flow. Second operand has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:17,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:17,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-06-27 21:59:17,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:17,943 INFO L124 PetriNetUnfolderBase]: 1097/2332 cut-off events. [2024-06-27 21:59:17,943 INFO L125 PetriNetUnfolderBase]: For 7906/7906 co-relation queries the response was YES. [2024-06-27 21:59:17,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7873 conditions, 2332 events. 1097/2332 cut-off events. For 7906/7906 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14937 event pairs, 572 based on Foata normal form. 0/2312 useless extension candidates. Maximal degree in co-relation 7845. Up to 1564 conditions per place. [2024-06-27 21:59:17,957 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 111 selfloop transitions, 28 changer transitions 4/149 dead transitions. [2024-06-27 21:59:17,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 149 transitions, 1265 flow [2024-06-27 21:59:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 21:59:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 21:59:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2024-06-27 21:59:17,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3559577677224736 [2024-06-27 21:59:17,959 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 610 flow. Second operand 13 states and 236 transitions. [2024-06-27 21:59:17,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 149 transitions, 1265 flow [2024-06-27 21:59:17,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 149 transitions, 1192 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 21:59:17,980 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 867 flow [2024-06-27 21:59:17,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=867, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2024-06-27 21:59:17,981 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-06-27 21:59:17,981 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 867 flow [2024-06-27 21:59:17,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.909090909090908) internal successors, (131), 11 states have internal predecessors, (131), 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-27 21:59:17,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:17,982 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 21:59:17,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:17,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1502518988, now seen corresponding path program 1 times [2024-06-27 21:59:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453919964] [2024-06-27 21:59:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453919964] [2024-06-27 21:59:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453919964] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916988406] [2024-06-27 21:59:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:19,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:19,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:19,169 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-27 21:59:19,196 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-27 21:59:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:19,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 43 conjunts are in the unsatisfiable core [2024-06-27 21:59:19,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:19,366 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-27 21:59:19,541 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 123 treesize of output 111 [2024-06-27 21:59:19,589 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 11 treesize of output 7 [2024-06-27 21:59:19,795 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 98 treesize of output 94 [2024-06-27 21:59:19,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:19,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2024-06-27 21:59:19,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:19,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2024-06-27 21:59:20,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:20,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:20,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 69 treesize of output 45 [2024-06-27 21:59:20,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-06-27 21:59:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:20,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:20,481 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 46 [2024-06-27 21:59:20,955 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:20,957 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 21:59:20,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:20,966 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 21:59:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916988406] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:24,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644079054] [2024-06-27 21:59:24,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:24,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-06-27 21:59:24,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 51 [2024-06-27 21:59:24,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 867 flow. Second operand has 32 states, 32 states have (on average 11.3125) internal successors, (362), 32 states have internal predecessors, (362), 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-27 21:59:24,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:24,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 51 [2024-06-27 21:59:24,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:26,594 INFO L124 PetriNetUnfolderBase]: 1312/2731 cut-off events. [2024-06-27 21:59:26,595 INFO L125 PetriNetUnfolderBase]: For 9714/9714 co-relation queries the response was YES. [2024-06-27 21:59:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9319 conditions, 2731 events. 1312/2731 cut-off events. For 9714/9714 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 17337 event pairs, 47 based on Foata normal form. 0/2719 useless extension candidates. Maximal degree in co-relation 9286. Up to 461 conditions per place. [2024-06-27 21:59:26,612 INFO L140 encePairwiseOnDemand]: 33/51 looper letters, 136 selfloop transitions, 69 changer transitions 10/220 dead transitions. [2024-06-27 21:59:26,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 220 transitions, 1929 flow [2024-06-27 21:59:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 21:59:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 21:59:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2024-06-27 21:59:26,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3713235294117647 [2024-06-27 21:59:26,615 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 867 flow. Second operand 16 states and 303 transitions. [2024-06-27 21:59:26,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 220 transitions, 1929 flow [2024-06-27 21:59:26,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 220 transitions, 1767 flow, removed 81 selfloop flow, removed 0 redundant places. [2024-06-27 21:59:26,645 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 1149 flow [2024-06-27 21:59:26,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1149, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2024-06-27 21:59:26,646 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 79 predicate places. [2024-06-27 21:59:26,646 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 1149 flow [2024-06-27 21:59:26,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.3125) internal successors, (362), 32 states have internal predecessors, (362), 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-27 21:59:26,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:26,646 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:26,676 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-27 21:59:26,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 21:59:26,860 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:26,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1661374034, now seen corresponding path program 2 times [2024-06-27 21:59:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:26,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207654572] [2024-06-27 21:59:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:27,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207654572] [2024-06-27 21:59:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207654572] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337683375] [2024-06-27 21:59:27,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 21:59:27,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:27,819 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-27 21:59:27,841 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-27 21:59:28,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 21:59:28,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:28,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 41 conjunts are in the unsatisfiable core [2024-06-27 21:59:28,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:28,025 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-27 21:59:28,172 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 106 treesize of output 98 [2024-06-27 21:59:28,180 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-27 21:59:28,274 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 11 treesize of output 7 [2024-06-27 21:59:28,435 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 98 treesize of output 94 [2024-06-27 21:59:28,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2024-06-27 21:59:28,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:28,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2024-06-27 21:59:28,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:28,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2024-06-27 21:59:29,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:29,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:29,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 69 treesize of output 45 [2024-06-27 21:59:29,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-06-27 21:59:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:29,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:30,014 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 46 [2024-06-27 21:59:30,384 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:30,384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 21:59:30,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:30,396 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 21:59:31,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:31,942 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 60 treesize of output 54 [2024-06-27 21:59:31,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:31,985 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 60 treesize of output 54 [2024-06-27 21:59:32,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:32,016 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 126 treesize of output 114 [2024-06-27 21:59:32,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-06-27 21:59:32,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:32,049 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 60 treesize of output 54 [2024-06-27 21:59:32,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:32,073 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 126 treesize of output 114 [2024-06-27 21:59:32,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:32,106 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 60 treesize of output 54 [2024-06-27 21:59:32,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 21:59:32,132 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 126 treesize of output 114 [2024-06-27 21:59:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 21:59:32,165 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 24 treesize of output 18 [2024-06-27 21:59:32,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 21:59:32,177 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 24 treesize of output 18 [2024-06-27 21:59:32,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:32,779 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 21:59:32,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:32,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 126 [2024-06-27 21:59:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337683375] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:33,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:33,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37566236] [2024-06-27 21:59:33,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:33,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:33,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=827, Unknown=2, NotChecked=0, Total=992 [2024-06-27 21:59:35,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 21:59:37,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-06-27 21:59:37,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 1149 flow. Second operand has 32 states, 32 states have (on average 9.59375) internal successors, (307), 32 states have internal predecessors, (307), 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-27 21:59:37,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:37,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-06-27 21:59:37,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:42,229 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 [0] [2024-06-27 21:59:45,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 21:59:46,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 21:59:48,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 21:59:53,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 21:59:55,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 21:59:56,458 INFO L124 PetriNetUnfolderBase]: 2097/3823 cut-off events. [2024-06-27 21:59:56,458 INFO L125 PetriNetUnfolderBase]: For 17093/17093 co-relation queries the response was YES. [2024-06-27 21:59:56,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13935 conditions, 3823 events. 2097/3823 cut-off events. For 17093/17093 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 22005 event pairs, 350 based on Foata normal form. 0/3809 useless extension candidates. Maximal degree in co-relation 13896. Up to 2096 conditions per place. [2024-06-27 21:59:56,481 INFO L140 encePairwiseOnDemand]: 34/51 looper letters, 157 selfloop transitions, 42 changer transitions 3/205 dead transitions. [2024-06-27 21:59:56,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 1918 flow [2024-06-27 21:59:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 21:59:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 21:59:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 244 transitions. [2024-06-27 21:59:56,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31895424836601305 [2024-06-27 21:59:56,483 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 1149 flow. Second operand 15 states and 244 transitions. [2024-06-27 21:59:56,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 1918 flow [2024-06-27 21:59:56,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 205 transitions, 1777 flow, removed 36 selfloop flow, removed 9 redundant places. [2024-06-27 21:59:56,560 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 1214 flow [2024-06-27 21:59:56,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1214, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-06-27 21:59:56,561 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 87 predicate places. [2024-06-27 21:59:56,561 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 1214 flow [2024-06-27 21:59:56,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.59375) internal successors, (307), 32 states have internal predecessors, (307), 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-27 21:59:56,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:56,563 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:56,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 21:59:56,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-06-27 21:59:56,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 21:59:56,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1566542634, now seen corresponding path program 3 times [2024-06-27 21:59:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:56,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734183363] [2024-06-27 21:59:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734183363] [2024-06-27 21:59:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734183363] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812962440] [2024-06-27 21:59:57,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 21:59:57,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:57,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:57,779 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-27 21:59:57,780 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-27 21:59:57,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 21:59:57,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:57,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 40 conjunts are in the unsatisfiable core [2024-06-27 21:59:57,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:58,002 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-27 21:59:58,211 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 106 treesize of output 98 [2024-06-27 21:59:58,268 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 11 treesize of output 7 [2024-06-27 21:59:58,500 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 130 treesize of output 118 [2024-06-27 21:59:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:58,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2024-06-27 21:59:58,517 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 38 treesize of output 25 [2024-06-27 21:59:58,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 21:59:58,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2024-06-27 22:00:00,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 22:00:00,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:00,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 69 treesize of output 45 [2024-06-27 22:00:00,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-06-27 22:00:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:00:00,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:00,360 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 46 [2024-06-27 22:00:06,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,487 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 126 treesize of output 114 [2024-06-27 22:00:06,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,521 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 60 treesize of output 54 [2024-06-27 22:00:06,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,551 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 126 treesize of output 114 [2024-06-27 22:00:06,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,594 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 126 treesize of output 114 [2024-06-27 22:00:06,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,628 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 126 treesize of output 114 [2024-06-27 22:00:06,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,668 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 60 treesize of output 54 [2024-06-27 22:00:06,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,710 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 60 treesize of output 54 [2024-06-27 22:00:06,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 22:00:06,745 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 60 treesize of output 54 [2024-06-27 22:00:06,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 22:00:06,778 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 24 treesize of output 18 [2024-06-27 22:00:06,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 22:00:06,790 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 24 treesize of output 18 [2024-06-27 22:00:07,094 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-06-27 22:00:07,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 130 [2024-06-27 22:00:07,124 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-06-27 22:00:07,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 130 [2024-06-27 22:00:07,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:07,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 126 [2024-06-27 22:00:07,248 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-06-27 22:00:07,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 74 [2024-06-27 22:00:07,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:07,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 74 [2024-06-27 22:00:07,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:07,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 2240 treesize of output 1315 [2024-06-27 22:00:08,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:08,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 582 treesize of output 400 [2024-06-27 22:00:08,953 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2024-06-27 22:00:08,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1260 treesize of output 779 [2024-06-27 22:00:09,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1158 treesize of output 714 [2024-06-27 22:00:09,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:09,142 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 22:00:09,170 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 22:00:09,170 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 22:00:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:00:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812962440] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:12,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 22:00:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114357867] [2024-06-27 22:00:12,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:12,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 22:00:12,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:12,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 22:00:12,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=836, Unknown=3, NotChecked=0, Total=992 [2024-06-27 22:00:17,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 51 [2024-06-27 22:00:17,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 1214 flow. Second operand has 32 states, 32 states have (on average 9.59375) internal successors, (307), 32 states have internal predecessors, (307), 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-27 22:00:17,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:17,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 51 [2024-06-27 22:00:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:22,535 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 [0] [2024-06-27 22:00:26,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 22:00:30,958 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 [0] [2024-06-27 22:00:37,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 22:00:42,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 22:00:43,875 INFO L124 PetriNetUnfolderBase]: 2248/4086 cut-off events. [2024-06-27 22:00:43,875 INFO L125 PetriNetUnfolderBase]: For 19654/19654 co-relation queries the response was YES. [2024-06-27 22:00:43,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15087 conditions, 4086 events. 2248/4086 cut-off events. For 19654/19654 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23665 event pairs, 1213 based on Foata normal form. 0/4072 useless extension candidates. Maximal degree in co-relation 15045. Up to 3024 conditions per place. [2024-06-27 22:00:43,899 INFO L140 encePairwiseOnDemand]: 34/51 looper letters, 170 selfloop transitions, 39 changer transitions 4/216 dead transitions. [2024-06-27 22:00:43,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 216 transitions, 2021 flow [2024-06-27 22:00:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 22:00:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 22:00:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 271 transitions. [2024-06-27 22:00:43,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29520697167755994 [2024-06-27 22:00:43,901 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 1214 flow. Second operand 18 states and 271 transitions. [2024-06-27 22:00:43,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 216 transitions, 2021 flow [2024-06-27 22:00:43,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 216 transitions, 1902 flow, removed 26 selfloop flow, removed 11 redundant places. [2024-06-27 22:00:43,964 INFO L231 Difference]: Finished difference. Result has 144 places, 138 transitions, 1331 flow [2024-06-27 22:00:43,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1331, PETRI_PLACES=144, PETRI_TRANSITIONS=138} [2024-06-27 22:00:43,965 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 97 predicate places. [2024-06-27 22:00:43,965 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 138 transitions, 1331 flow [2024-06-27 22:00:43,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.59375) internal successors, (307), 32 states have internal predecessors, (307), 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-27 22:00:43,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:43,966 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:43,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 22:00:44,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:44,179 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:00:44,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1561473389, now seen corresponding path program 1 times [2024-06-27 22:00:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353787719] [2024-06-27 22:00:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:00:44,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:00:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:00:44,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:00:44,261 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:00:44,262 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:00:44,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:00:44,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:00:44,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:00:44,264 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-06-27 22:00:44,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:00:44,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2024-06-27 22:00:44,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-06-27 22:00:44,265 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:00:44,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:00:44,265 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:44,270 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:00:44,270 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:00:44,338 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:00:44,341 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:00:44,344 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:00:44 BasicIcfg [2024-06-27 22:00:44,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:00:44,345 INFO L158 Benchmark]: Toolchain (without parser) took 97772.13ms. Allocated memory was 172.0MB in the beginning and 966.8MB in the end (delta: 794.8MB). Free memory was 98.6MB in the beginning and 564.5MB in the end (delta: -465.9MB). Peak memory consumption was 329.0MB. Max. memory is 16.1GB. [2024-06-27 22:00:44,345 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:00:44,345 INFO L158 Benchmark]: Witness Parser took 0.39ms. Allocated memory is still 172.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:00:44,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.85ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 112.5MB in the end (delta: -14.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-06-27 22:00:44,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.62ms. Allocated memory is still 172.0MB. Free memory was 112.5MB in the beginning and 109.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:00:44,346 INFO L158 Benchmark]: Boogie Preprocessor took 66.53ms. Allocated memory is still 172.0MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:00:44,346 INFO L158 Benchmark]: RCFGBuilder took 841.84ms. Allocated memory is still 172.0MB. Free memory was 106.1MB in the beginning and 116.3MB in the end (delta: -10.1MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-06-27 22:00:44,346 INFO L158 Benchmark]: TraceAbstraction took 96160.56ms. Allocated memory was 172.0MB in the beginning and 966.8MB in the end (delta: 794.8MB). Free memory was 115.3MB in the beginning and 564.5MB in the end (delta: -449.2MB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. [2024-06-27 22:00:44,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.39ms. Allocated memory is still 172.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.85ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 112.5MB in the end (delta: -14.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.62ms. Allocated memory is still 172.0MB. Free memory was 112.5MB in the beginning and 109.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.53ms. Allocated memory is still 172.0MB. Free memory was 109.0MB in the beginning and 106.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 841.84ms. Allocated memory is still 172.0MB. Free memory was 106.1MB in the beginning and 116.3MB in the end (delta: -10.1MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * TraceAbstraction took 96160.56ms. Allocated memory was 172.0MB in the beginning and 966.8MB in the end (delta: 794.8MB). Free memory was 115.3MB in the beginning and 564.5MB in the end (delta: -449.2MB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int m_locked = 0; [L1] 0 //@ ghost int multithreaded = 0; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] 0 //@ ghost multithreaded = 1; VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] 0 //@ assert (!multithreaded || (m_locked || ((((-1LL + (long long) dequeue_flag) + (long long) enqueue_flag) >= 0LL) && (((1LL - (long long) dequeue_flag) - (long long) enqueue_flag) >= 0LL)))); [L1008] 1 //@ ghost m_locked = 1; [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1017] 1 //@ ghost m_locked = 0; [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(20) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1039] 2 //@ ghost m_locked = 1; [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1048] 2 //@ ghost m_locked = 0; [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1037] COND TRUE 2 i<(20) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] COND TRUE 1 i<((20)-1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1020] 1 //@ ghost m_locked = 1; [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1029] 1 //@ ghost m_locked = 0; [L1039] 2 //@ ghost m_locked = 1; [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 75 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 96.0s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 60.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 1558 SdHoareTripleChecker+Valid, 55.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1478 mSDsluCounter, 924 SdHoareTripleChecker+Invalid, 54.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 879 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6716 IncrementalHoareTripleChecker+Invalid, 6839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 45 mSDtfsCounter, 6716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1331occurred in iteration=15, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.8s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 459 ConstructedInterpolants, 97 QuantifiedInterpolants, 76032 SizeOfPredicates, 95 NumberOfNonLiveVariables, 876 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 8/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:00:44,580 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-06-27 22:00:44,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE