./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_longest.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_longest.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_longest.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/queue_longest.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:07,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 21:59:07,380 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:07,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 21:59:07,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 21:59:07,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 21:59:07,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 21:59:07,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 21:59:07,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 21:59:07,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 21:59:07,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 21:59:07,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 21:59:07,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 21:59:07,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 21:59:07,413 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 21:59:07,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 21:59:07,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 21:59:07,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 21:59:07,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 21:59:07,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 21:59:07,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 21:59:07,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 21:59:07,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 21:59:07,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 21:59:07,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 21:59:07,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 21:59:07,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 21:59:07,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 21:59:07,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 21:59:07,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 21:59:07,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 21:59:07,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 21:59:07,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:07,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 21:59:07,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 21:59:07,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 21:59:07,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 21:59:07,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 21:59:07,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 21:59:07,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 21:59:07,420 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 21:59:07,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 21:59:07,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 21:59:07,420 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:07,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 21:59:07,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 21:59:07,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 21:59:07,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 21:59:07,676 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 21:59:07,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-06-27 21:59:08,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 21:59:08,862 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 21:59:08,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2024-06-27 21:59:08,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb8527b8/93adc2aa6fc74223b680faebaeb6f3a4/FLAG04286401f [2024-06-27 21:59:08,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb8527b8/93adc2aa6fc74223b680faebaeb6f3a4 [2024-06-27 21:59:08,892 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 21:59:08,893 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 21:59:08,893 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_longest.yml/witness.yml [2024-06-27 21:59:08,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 21:59:08,976 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 21:59:08,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:08,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 21:59:08,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 21:59:08,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:08" (1/2) ... [2024-06-27 21:59:08,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec3c87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:08" (1/2) ... [2024-06-27 21:59:08,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b0404e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,984 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:08" (2/2) ... [2024-06-27 21:59:08,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec3c87c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:08, skipping insertion in model container [2024-06-27 21:59:08,984 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:08" (2/2) ... [2024-06-27 21:59:08,984 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 21:59:09,031 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 21:59:09,033 INFO L97 edCorrectnessWitness]: Location invariant before [L1063-L1063] ! 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:09,033 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:09,033 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-27 21:59:09,033 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 21:59:09,034 INFO L106 edCorrectnessWitness]: ghost_update [L1048-L1048] m_locked = 0; [2024-06-27 21:59:09,034 INFO L106 edCorrectnessWitness]: ghost_update [L1029-L1029] m_locked = 0; [2024-06-27 21:59:09,034 INFO L106 edCorrectnessWitness]: ghost_update [L1017-L1017] m_locked = 0; [2024-06-27 21:59:09,035 INFO L106 edCorrectnessWitness]: ghost_update [L1039-L1039] m_locked = 1; [2024-06-27 21:59:09,035 INFO L106 edCorrectnessWitness]: ghost_update [L1020-L1020] m_locked = 1; [2024-06-27 21:59:09,035 INFO L106 edCorrectnessWitness]: ghost_update [L1062-L1062] multithreaded = 1; [2024-06-27 21:59:09,035 INFO L106 edCorrectnessWitness]: ghost_update [L1008-L1008] m_locked = 1; [2024-06-27 21:59:09,075 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 21:59:09,504 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_longest.i[43296,43309] [2024-06-27 21:59:09,511 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_longest.i[43503,43516] [2024-06-27 21:59:09,516 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_longest.i[43783,43796] [2024-06-27 21:59:09,523 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:09,534 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:09,610 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_longest.i[43296,43309] Start Parsing Local [2024-06-27 21:59:09,612 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_longest.i[43503,43516] Start Parsing Local [2024-06-27 21:59:09,615 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_longest.i[43783,43796] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:09,636 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:09,686 INFO L206 MainTranslator]: Completed translation [2024-06-27 21:59:09,686 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:09 WrapperNode [2024-06-27 21:59:09,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:09,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:09,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 21:59:09,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 21:59:09,692 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:09" (1/1) ... [2024-06-27 21:59:09,708 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:09" (1/1) ... [2024-06-27 21:59:09,730 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-06-27 21:59:09,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:09,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 21:59:09,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 21:59:09,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 21:59:09,739 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:09" (1/1) ... [2024-06-27 21:59:09,739 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:09" (1/1) ... [2024-06-27 21:59:09,748 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:09" (1/1) ... [2024-06-27 21:59:09,761 INFO L175 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 5, 4, 32]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 18 writes are split as follows [0, 0, 3, 15]. [2024-06-27 21:59:09,761 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:09" (1/1) ... [2024-06-27 21:59:09,761 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:09" (1/1) ... [2024-06-27 21:59:09,770 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:09" (1/1) ... [2024-06-27 21:59:09,772 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:09" (1/1) ... [2024-06-27 21:59:09,774 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:09" (1/1) ... [2024-06-27 21:59:09,775 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:09" (1/1) ... [2024-06-27 21:59:09,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 21:59:09,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 21:59:09,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 21:59:09,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 21:59:09,779 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:09" (1/1) ... [2024-06-27 21:59:09,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:09,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:09,800 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:09,816 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:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 21:59:09,826 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 21:59:09,826 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 21:59:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 21:59:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 21:59:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 21:59:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 21:59:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 21:59:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 21:59:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 21:59:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 21:59:09,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 21:59:09,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 21:59:09,830 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:09,935 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 21:59:09,937 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 21:59:10,202 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 21:59:10,203 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 21:59:10,440 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 21:59:10,440 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 21:59:10,441 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:10 BoogieIcfgContainer [2024-06-27 21:59:10,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 21:59:10,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 21:59:10,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 21:59:10,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 21:59:10,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 09:59:08" (1/4) ... [2024-06-27 21:59:10,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d92090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 09:59:10, skipping insertion in model container [2024-06-27 21:59:10,446 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:08" (2/4) ... [2024-06-27 21:59:10,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d92090 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:10, skipping insertion in model container [2024-06-27 21:59:10,446 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:09" (3/4) ... [2024-06-27 21:59:10,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d92090 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:10, skipping insertion in model container [2024-06-27 21:59:10,446 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:10" (4/4) ... [2024-06-27 21:59:10,447 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-06-27 21:59:10,460 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 21:59:10,460 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 21:59:10,460 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 21:59:10,502 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 21:59:10,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 118 flow [2024-06-27 21:59:10,542 INFO L124 PetriNetUnfolderBase]: 7/50 cut-off events. [2024-06-27 21:59:10,543 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 21:59:10,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 7/50 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-06-27 21:59:10,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 52 transitions, 118 flow [2024-06-27 21:59:10,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 48 transitions, 105 flow [2024-06-27 21:59:10,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 21:59:10,558 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;@44bc0c04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 21:59:10,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 21:59:10,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 21:59:10,560 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 21:59:10,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:10,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 21:59:10,561 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:10,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 646947, now seen corresponding path program 1 times [2024-06-27 21:59:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128199861] [2024-06-27 21:59:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:10,686 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128199861] [2024-06-27 21:59:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128199861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721547258] [2024-06-27 21:59:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:10,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 21:59:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:10,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 21:59:10,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 21:59:10,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:10,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 105 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:10,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:10,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:10,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:10,916 INFO L124 PetriNetUnfolderBase]: 439/840 cut-off events. [2024-06-27 21:59:10,917 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 21:59:10,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 840 events. 439/840 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4107 event pairs, 343 based on Foata normal form. 48/777 useless extension candidates. Maximal degree in co-relation 1538. Up to 721 conditions per place. [2024-06-27 21:59:10,926 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 32 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2024-06-27 21:59:10,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 159 flow [2024-06-27 21:59:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 21:59:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 21:59:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2024-06-27 21:59:10,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-06-27 21:59:10,938 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 105 flow. Second operand 2 states and 63 transitions. [2024-06-27 21:59:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 159 flow [2024-06-27 21:59:10,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:10,947 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 90 flow [2024-06-27 21:59:10,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2024-06-27 21:59:10,952 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2024-06-27 21:59:10,952 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 90 flow [2024-06-27 21:59:10,952 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:10,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:10,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:10,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 21:59:10,953 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:10,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 504170151, now seen corresponding path program 1 times [2024-06-27 21:59:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411545794] [2024-06-27 21:59:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:11,201 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,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411545794] [2024-06-27 21:59:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411545794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:11,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 21:59:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123167553] [2024-06-27 21:59:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:11,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:11,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:11,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 21:59:11,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:11,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 21:59:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:11,364 INFO L124 PetriNetUnfolderBase]: 552/1056 cut-off events. [2024-06-27 21:59:11,364 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 21:59:11,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 1056 events. 552/1056 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4913 event pairs, 272 based on Foata normal form. 94/1088 useless extension candidates. Maximal degree in co-relation 1999. Up to 472 conditions per place. [2024-06-27 21:59:11,373 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 45 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2024-06-27 21:59:11,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 221 flow [2024-06-27 21:59:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-06-27 21:59:11,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2024-06-27 21:59:11,375 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 90 flow. Second operand 3 states and 88 transitions. [2024-06-27 21:59:11,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 221 flow [2024-06-27 21:59:11,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 21:59:11,378 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 109 flow [2024-06-27 21:59:11,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-06-27 21:59:11,379 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-06-27 21:59:11,379 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 109 flow [2024-06-27 21:59:11,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:11,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:11,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 21:59:11,381 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:11,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 264572176, now seen corresponding path program 1 times [2024-06-27 21:59:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481417835] [2024-06-27 21:59:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:11,471 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,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481417835] [2024-06-27 21:59:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481417835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058780815] [2024-06-27 21:59:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:11,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:11,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:11,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:11,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:11,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:11,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:11,592 INFO L124 PetriNetUnfolderBase]: 466/937 cut-off events. [2024-06-27 21:59:11,593 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-27 21:59:11,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 937 events. 466/937 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4439 event pairs, 344 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1876. Up to 754 conditions per place. [2024-06-27 21:59:11,596 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-06-27 21:59:11,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 209 flow [2024-06-27 21:59:11,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-27 21:59:11,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2024-06-27 21:59:11,598 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 109 flow. Second operand 3 states and 83 transitions. [2024-06-27 21:59:11,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 209 flow [2024-06-27 21:59:11,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 21:59:11,599 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 108 flow [2024-06-27 21:59:11,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-06-27 21:59:11,600 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-06-27 21:59:11,600 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 108 flow [2024-06-27 21:59:11,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:11,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:11,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 21:59:11,601 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:11,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -388195476, now seen corresponding path program 1 times [2024-06-27 21:59:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:11,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302231657] [2024-06-27 21:59:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:11,884 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,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:11,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302231657] [2024-06-27 21:59:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302231657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:11,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 21:59:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634881761] [2024-06-27 21:59:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 21:59:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:11,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 21:59:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 21:59:11,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:11,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:11,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:11,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:12,065 INFO L124 PetriNetUnfolderBase]: 488/968 cut-off events. [2024-06-27 21:59:12,065 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-27 21:59:12,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 968 events. 488/968 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4562 event pairs, 139 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1949. Up to 504 conditions per place. [2024-06-27 21:59:12,069 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 55 selfloop transitions, 5 changer transitions 2/72 dead transitions. [2024-06-27 21:59:12,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 299 flow [2024-06-27 21:59:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 21:59:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 21:59:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-06-27 21:59:12,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076923076923077 [2024-06-27 21:59:12,071 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 108 flow. Second operand 5 states and 132 transitions. [2024-06-27 21:59:12,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 299 flow [2024-06-27 21:59:12,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:12,072 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 120 flow [2024-06-27 21:59:12,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-06-27 21:59:12,073 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-06-27 21:59:12,073 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 120 flow [2024-06-27 21:59:12,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:12,074 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:12,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 21:59:12,074 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:12,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1368784160, now seen corresponding path program 1 times [2024-06-27 21:59:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065257434] [2024-06-27 21:59:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:12,119 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:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065257434] [2024-06-27 21:59:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065257434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714560088] [2024-06-27 21:59:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:12,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 21:59:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 21:59:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 21:59:12,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 21:59:12,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:12,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 21:59:12,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:12,301 INFO L124 PetriNetUnfolderBase]: 714/1441 cut-off events. [2024-06-27 21:59:12,301 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2024-06-27 21:59:12,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 1441 events. 714/1441 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7611 event pairs, 258 based on Foata normal form. 32/1442 useless extension candidates. Maximal degree in co-relation 2990. Up to 681 conditions per place. [2024-06-27 21:59:12,306 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 55 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2024-06-27 21:59:12,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 329 flow [2024-06-27 21:59:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 21:59:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 21:59:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 21:59:12,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-06-27 21:59:12,307 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 120 flow. Second operand 5 states and 116 transitions. [2024-06-27 21:59:12,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 329 flow [2024-06-27 21:59:12,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 319 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:12,310 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 171 flow [2024-06-27 21:59:12,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-06-27 21:59:12,310 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-06-27 21:59:12,310 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 171 flow [2024-06-27 21:59:12,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:12,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:12,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 21:59:12,311 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:12,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 517366238, now seen corresponding path program 1 times [2024-06-27 21:59:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299956250] [2024-06-27 21:59:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:12,436 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:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:12,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299956250] [2024-06-27 21:59:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299956250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:12,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212844478] [2024-06-27 21:59:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:12,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 21:59:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 21:59:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 21:59:12,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 21:59:12,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:12,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 21:59:12,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:12,602 INFO L124 PetriNetUnfolderBase]: 608/1202 cut-off events. [2024-06-27 21:59:12,603 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-06-27 21:59:12,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1202 events. 608/1202 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5894 event pairs, 311 based on Foata normal form. 54/1227 useless extension candidates. Maximal degree in co-relation 2903. Up to 650 conditions per place. [2024-06-27 21:59:12,607 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 49 selfloop transitions, 4 changer transitions 4/64 dead transitions. [2024-06-27 21:59:12,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 336 flow [2024-06-27 21:59:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 21:59:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 21:59:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 21:59:12,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44711538461538464 [2024-06-27 21:59:12,609 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 171 flow. Second operand 4 states and 93 transitions. [2024-06-27 21:59:12,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 336 flow [2024-06-27 21:59:12,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:12,611 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 167 flow [2024-06-27 21:59:12,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-27 21:59:12,612 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-06-27 21:59:12,612 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 167 flow [2024-06-27 21:59:12,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:12,613 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,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 21:59:12,613 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:12,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1815256343, now seen corresponding path program 1 times [2024-06-27 21:59:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474951680] [2024-06-27 21:59:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:12,687 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:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474951680] [2024-06-27 21:59:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474951680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 21:59:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108556571] [2024-06-27 21:59:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:12,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2024-06-27 21:59:12,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:12,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2024-06-27 21:59:12,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:12,779 INFO L124 PetriNetUnfolderBase]: 257/574 cut-off events. [2024-06-27 21:59:12,779 INFO L125 PetriNetUnfolderBase]: For 337/340 co-relation queries the response was YES. [2024-06-27 21:59:12,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 574 events. 257/574 cut-off events. For 337/340 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2367 event pairs, 85 based on Foata normal form. 34/598 useless extension candidates. Maximal degree in co-relation 1378. Up to 267 conditions per place. [2024-06-27 21:59:12,782 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-06-27 21:59:12,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 252 flow [2024-06-27 21:59:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 21:59:12,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2024-06-27 21:59:12,783 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 167 flow. Second operand 3 states and 85 transitions. [2024-06-27 21:59:12,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 252 flow [2024-06-27 21:59:12,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 225 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 21:59:12,786 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 128 flow [2024-06-27 21:59:12,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-06-27 21:59:12,786 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-06-27 21:59:12,786 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 128 flow [2024-06-27 21:59:12,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:12,787 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, 1] [2024-06-27 21:59:12,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 21:59:12,787 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:12,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1496571921, now seen corresponding path program 1 times [2024-06-27 21:59:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678669331] [2024-06-27 21:59:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:12,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:13,849 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,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678669331] [2024-06-27 21:59:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678669331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:13,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172811620] [2024-06-27 21:59:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:13,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:13,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:13,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 128 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:13,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:14,349 INFO L124 PetriNetUnfolderBase]: 568/1181 cut-off events. [2024-06-27 21:59:14,349 INFO L125 PetriNetUnfolderBase]: For 512/513 co-relation queries the response was YES. [2024-06-27 21:59:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 1181 events. 568/1181 cut-off events. For 512/513 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6052 event pairs, 95 based on Foata normal form. 1/1170 useless extension candidates. Maximal degree in co-relation 2667. Up to 394 conditions per place. [2024-06-27 21:59:14,354 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 84 selfloop transitions, 20 changer transitions 8/118 dead transitions. [2024-06-27 21:59:14,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 118 transitions, 590 flow [2024-06-27 21:59:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 21:59:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 21:59:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2024-06-27 21:59:14,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3881118881118881 [2024-06-27 21:59:14,356 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 128 flow. Second operand 11 states and 222 transitions. [2024-06-27 21:59:14,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 118 transitions, 590 flow [2024-06-27 21:59:14,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 118 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:14,359 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 260 flow [2024-06-27 21:59:14,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=260, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-27 21:59:14,361 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2024-06-27 21:59:14,361 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 260 flow [2024-06-27 21:59:14,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:14,362 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, 1] [2024-06-27 21:59:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 21:59:14,362 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:14,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1026935609, now seen corresponding path program 2 times [2024-06-27 21:59:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760280465] [2024-06-27 21:59:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:15,220 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:15,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760280465] [2024-06-27 21:59:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760280465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021561557] [2024-06-27 21:59:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:15,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:15,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:15,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:15,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:15,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:15,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:15,703 INFO L124 PetriNetUnfolderBase]: 728/1555 cut-off events. [2024-06-27 21:59:15,703 INFO L125 PetriNetUnfolderBase]: For 1798/1798 co-relation queries the response was YES. [2024-06-27 21:59:15,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4338 conditions, 1555 events. 728/1555 cut-off events. For 1798/1798 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8994 event pairs, 141 based on Foata normal form. 0/1538 useless extension candidates. Maximal degree in co-relation 4323. Up to 914 conditions per place. [2024-06-27 21:59:15,710 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 88 selfloop transitions, 26 changer transitions 4/124 dead transitions. [2024-06-27 21:59:15,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 775 flow [2024-06-27 21:59:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 21:59:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 21:59:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 237 transitions. [2024-06-27 21:59:15,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3505917159763314 [2024-06-27 21:59:15,711 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 260 flow. Second operand 13 states and 237 transitions. [2024-06-27 21:59:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 775 flow [2024-06-27 21:59:15,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 760 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:15,717 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 471 flow [2024-06-27 21:59:15,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=471, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-06-27 21:59:15,717 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2024-06-27 21:59:15,718 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 471 flow [2024-06-27 21:59:15,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:15,718 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, 1] [2024-06-27 21:59:15,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 21:59:15,718 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:15,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1302754159, now seen corresponding path program 3 times [2024-06-27 21:59:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476969047] [2024-06-27 21:59:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:16,477 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,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476969047] [2024-06-27 21:59:16,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476969047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:16,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:16,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943688170] [2024-06-27 21:59:16,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:16,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:16,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:16,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:16,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 471 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:16,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:16,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:17,213 INFO L124 PetriNetUnfolderBase]: 874/1852 cut-off events. [2024-06-27 21:59:17,214 INFO L125 PetriNetUnfolderBase]: For 3067/3067 co-relation queries the response was YES. [2024-06-27 21:59:17,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 1852 events. 874/1852 cut-off events. For 3067/3067 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11036 event pairs, 42 based on Foata normal form. 0/1842 useless extension candidates. Maximal degree in co-relation 5498. Up to 457 conditions per place. [2024-06-27 21:59:17,224 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 112 selfloop transitions, 44 changer transitions 8/170 dead transitions. [2024-06-27 21:59:17,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 170 transitions, 1160 flow [2024-06-27 21:59:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 21:59:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 21:59:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 306 transitions. [2024-06-27 21:59:17,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36778846153846156 [2024-06-27 21:59:17,226 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 471 flow. Second operand 16 states and 306 transitions. [2024-06-27 21:59:17,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 170 transitions, 1160 flow [2024-06-27 21:59:17,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 170 transitions, 1076 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:17,242 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 599 flow [2024-06-27 21:59:17,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=599, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-06-27 21:59:17,243 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 46 predicate places. [2024-06-27 21:59:17,243 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 599 flow [2024-06-27 21:59:17,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:17,244 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, 1] [2024-06-27 21:59:17,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 21:59:17,244 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:17,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1322573815, now seen corresponding path program 4 times [2024-06-27 21:59:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:17,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648626253] [2024-06-27 21:59:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:17,995 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,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648626253] [2024-06-27 21:59:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648626253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:17,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:17,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243292314] [2024-06-27 21:59:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:17,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:18,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:18,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 599 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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:18,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:18,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:18,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:18,593 INFO L124 PetriNetUnfolderBase]: 1004/2120 cut-off events. [2024-06-27 21:59:18,593 INFO L125 PetriNetUnfolderBase]: For 4446/4446 co-relation queries the response was YES. [2024-06-27 21:59:18,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6669 conditions, 2120 events. 1004/2120 cut-off events. For 4446/4446 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13278 event pairs, 224 based on Foata normal form. 0/2096 useless extension candidates. Maximal degree in co-relation 6644. Up to 909 conditions per place. [2024-06-27 21:59:18,604 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 106 selfloop transitions, 33 changer transitions 8/153 dead transitions. [2024-06-27 21:59:18,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 153 transitions, 1186 flow [2024-06-27 21:59:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 21:59:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 21:59:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2024-06-27 21:59:18,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3916083916083916 [2024-06-27 21:59:18,606 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 599 flow. Second operand 11 states and 224 transitions. [2024-06-27 21:59:18,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 153 transitions, 1186 flow [2024-06-27 21:59:18,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 153 transitions, 1120 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 21:59:18,619 INFO L231 Difference]: Finished difference. Result has 105 places, 96 transitions, 760 flow [2024-06-27 21:59:18,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=760, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2024-06-27 21:59:18,620 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 57 predicate places. [2024-06-27 21:59:18,620 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 760 flow [2024-06-27 21:59:18,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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:18,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:18,621 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, 1] [2024-06-27 21:59:18,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 21:59:18,621 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:18,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1774375265, now seen corresponding path program 5 times [2024-06-27 21:59:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425973516] [2024-06-27 21:59:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:19,324 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:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:19,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425973516] [2024-06-27 21:59:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425973516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:19,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 21:59:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736059324] [2024-06-27 21:59:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:19,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 21:59:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 21:59:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 21:59:19,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-06-27 21:59:19,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 760 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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:19,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:19,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-06-27 21:59:19,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:20,024 INFO L124 PetriNetUnfolderBase]: 1076/2272 cut-off events. [2024-06-27 21:59:20,024 INFO L125 PetriNetUnfolderBase]: For 5641/5641 co-relation queries the response was YES. [2024-06-27 21:59:20,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7438 conditions, 2272 events. 1076/2272 cut-off events. For 5641/5641 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 14259 event pairs, 152 based on Foata normal form. 0/2260 useless extension candidates. Maximal degree in co-relation 7407. Up to 1033 conditions per place. [2024-06-27 21:59:20,038 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 119 selfloop transitions, 37 changer transitions 7/169 dead transitions. [2024-06-27 21:59:20,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 169 transitions, 1371 flow [2024-06-27 21:59:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 21:59:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 21:59:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 288 transitions. [2024-06-27 21:59:20,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2024-06-27 21:59:20,041 INFO L175 Difference]: Start difference. First operand has 105 places, 96 transitions, 760 flow. Second operand 16 states and 288 transitions. [2024-06-27 21:59:20,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 169 transitions, 1371 flow [2024-06-27 21:59:20,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 169 transitions, 1284 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-27 21:59:20,060 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 815 flow [2024-06-27 21:59:20,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=815, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2024-06-27 21:59:20,060 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 70 predicate places. [2024-06-27 21:59:20,060 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 815 flow [2024-06-27 21:59:20,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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:20,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:20,061 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, 1] [2024-06-27 21:59:20,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 21:59:20,061 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:20,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2086035937, now seen corresponding path program 1 times [2024-06-27 21:59:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633167505] [2024-06-27 21:59:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:20,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:20,939 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,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:20,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633167505] [2024-06-27 21:59:20,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633167505] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336651304] [2024-06-27 21:59:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:20,944 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:20,980 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:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:21,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 38 conjunts are in the unsatisfiable core [2024-06-27 21:59:21,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:21,155 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:21,161 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 7 treesize of output 6 [2024-06-27 21:59:21,338 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 117 treesize of output 107 [2024-06-27 21:59:21,393 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 18 treesize of output 13 [2024-06-27 21:59:21,572 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 137 treesize of output 123 [2024-06-27 21:59:21,600 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:21,607 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 37 treesize of output 32 [2024-06-27 21:59:21,620 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:21,624 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-27 21:59:21,989 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 36 treesize of output 30 [2024-06-27 21:59:21,992 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 67 treesize of output 55 [2024-06-27 21:59:22,038 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:22,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:22,223 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:22,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:22,710 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:22,717 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:22,717 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:24,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:24,585 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 58 treesize of output 56 [2024-06-27 21:59:24,593 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 21:59:24,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:24,703 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:25,831 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:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336651304] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:25,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219796251] [2024-06-27 21:59:25,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:25,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:25,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2024-06-27 21:59:26,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 52 [2024-06-27 21:59:26,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 100 transitions, 815 flow. Second operand has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 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,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:26,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 52 [2024-06-27 21:59:26,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:28,796 INFO L124 PetriNetUnfolderBase]: 1252/2623 cut-off events. [2024-06-27 21:59:28,812 INFO L125 PetriNetUnfolderBase]: For 6383/6383 co-relation queries the response was YES. [2024-06-27 21:59:28,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8519 conditions, 2623 events. 1252/2623 cut-off events. For 6383/6383 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 16630 event pairs, 66 based on Foata normal form. 0/2611 useless extension candidates. Maximal degree in co-relation 8486. Up to 454 conditions per place. [2024-06-27 21:59:28,834 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 140 selfloop transitions, 54 changer transitions 10/209 dead transitions. [2024-06-27 21:59:28,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 209 transitions, 1714 flow [2024-06-27 21:59:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 21:59:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 21:59:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 285 transitions. [2024-06-27 21:59:28,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2024-06-27 21:59:28,836 INFO L175 Difference]: Start difference. First operand has 118 places, 100 transitions, 815 flow. Second operand 15 states and 285 transitions. [2024-06-27 21:59:28,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 209 transitions, 1714 flow [2024-06-27 21:59:28,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 1584 flow, removed 19 selfloop flow, removed 15 redundant places. [2024-06-27 21:59:28,856 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 962 flow [2024-06-27 21:59:28,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=962, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-06-27 21:59:28,857 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 74 predicate places. [2024-06-27 21:59:28,857 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 962 flow [2024-06-27 21:59:28,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 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:28,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:28,857 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, 1] [2024-06-27 21:59:28,869 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:29,069 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:29,069 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:29,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash -628231583, now seen corresponding path program 2 times [2024-06-27 21:59:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:29,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064470737] [2024-06-27 21:59:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:30,068 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:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064470737] [2024-06-27 21:59:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064470737] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125560268] [2024-06-27 21:59:30,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 21:59:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:30,085 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:30,109 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:30,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 21:59:30,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:30,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 33 conjunts are in the unsatisfiable core [2024-06-27 21:59:30,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:30,318 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:30,322 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 7 treesize of output 6 [2024-06-27 21:59:30,496 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 117 treesize of output 107 [2024-06-27 21:59:30,550 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 18 treesize of output 13 [2024-06-27 21:59:30,744 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 124 treesize of output 114 [2024-06-27 21:59:30,748 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:30,752 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 66 treesize of output 57 [2024-06-27 21:59:31,008 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 36 treesize of output 30 [2024-06-27 21:59:31,012 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 67 treesize of output 55 [2024-06-27 21:59:31,051 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:31,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:31,216 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:31,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:31,599 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,614 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:31,614 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:38,159 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 21:59:38,159 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:38,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 21:59:38,204 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:38,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-27 21:59:42,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse23 (+ (* (select .cse22 .cse4) 4) |c_~#queue~0.offset|))) (let ((.cse15 (store .cse22 .cse23 1)) (.cse5 (store .cse22 .cse23 0)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (select .cse5 .cse6)) (.cse9 (select .cse5 .cse4)) (.cse14 (+ 3200 |c_~#queue~0.offset|)) (.cse17 (select .cse15 .cse6)) (.cse16 (select .cse15 .cse4))) (let ((.cse0 (forall ((v_ArrVal_549 Int)) (not (= 800 (select (store .cse22 .cse23 v_ArrVal_549) .cse4))))) (.cse12 (store (store .cse15 .cse6 (+ .cse17 1)) .cse4 (+ .cse16 1))) (.cse18 (+ |c_~#queue~0.offset| (* (select .cse15 .cse14) 4))) (.cse1 (forall ((v_ArrVal_549 Int)) (= 800 (select (store .cse22 .cse23 v_ArrVal_549) .cse4)))) (.cse2 (store (store .cse5 .cse6 (+ .cse7 1)) .cse4 (+ .cse9 1))) (.cse8 (+ (* (select .cse5 .cse14) 4) |c_~#queue~0.offset|)) (.cse21 (= (mod c_~enqueue_flag~0 256) 0))) (and (or (and .cse0 (or .cse1 (let ((.cse3 (+ (* .cse9 4) |c_~#queue~0.offset| 4)) (.cse13 (+ (* .cse16 4) |c_~#queue~0.offset| 4))) (and (forall ((v_ArrVal_557 Int)) (not (= 800 (select (store .cse2 .cse3 v_ArrVal_557) .cse4)))) (or (forall ((v_DerPreprocessor_31 Int)) (or (= 801 v_DerPreprocessor_31) (= (select (store (store .cse5 .cse6 (+ .cse7 2)) .cse4 v_DerPreprocessor_31) .cse8) 0))) (not (= 800 .cse9))) (or (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_32 Int)) (let ((.cse11 (store (store (store .cse15 .cse13 v_DerPreprocessor_32) .cse6 v_DerPreprocessor_33) .cse4 v_DerPreprocessor_34))) (let ((.cse10 (store .cse12 .cse13 (select .cse11 .cse13)))) (or (not (= v_DerPreprocessor_33 (+ (select .cse10 .cse6) 1))) (not (= (select .cse11 (+ (* (select (store .cse12 .cse13 v_DerPreprocessor_32) .cse14) 4) |c_~#queue~0.offset|)) 0)) (not (= v_DerPreprocessor_34 (+ (select .cse10 .cse4) 1))))))) (= .cse16 799)) (or (not (= .cse16 800)) (forall ((v_DerPreprocessor_31 Int)) (or (= 801 v_DerPreprocessor_31) (not (= (select (store (store .cse15 .cse6 (+ .cse17 2)) .cse4 v_DerPreprocessor_31) .cse18) 0))))) (or (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (v_DerPreprocessor_32 Int)) (let ((.cse20 (store (store (store .cse5 .cse3 v_DerPreprocessor_32) .cse6 v_DerPreprocessor_33) .cse4 v_DerPreprocessor_34))) (let ((.cse19 (store .cse2 .cse3 (select .cse20 .cse3)))) (or (not (= v_DerPreprocessor_33 (+ (select .cse19 .cse6) 1))) (= (select .cse20 (+ |c_~#queue~0.offset| (* (select (store .cse2 .cse3 v_DerPreprocessor_32) .cse14) 4))) 0) (not (= v_DerPreprocessor_34 (+ (select .cse19 .cse4) 1))))))) (= .cse9 799)) (forall ((v_ArrVal_557 Int)) (not (= (select (store .cse12 .cse13 v_ArrVal_557) .cse4) 800))))))) .cse21) (or (and .cse0 (or (not (= (select .cse12 .cse18) 0)) .cse1) (or .cse1 (= (select .cse2 .cse8) 0))) (not .cse21)))))))) is different from false [2024-06-27 21:59:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125560268] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:45,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:45,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 21:59:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238608857] [2024-06-27 21:59:45,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 21:59:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 21:59:45,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=775, Unknown=2, NotChecked=58, Total=992 [2024-06-27 21:59:45,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2024-06-27 21:59:45,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 962 flow. Second operand has 32 states, 32 states have (on average 9.6875) internal successors, (310), 32 states have internal predecessors, (310), 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:45,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2024-06-27 21:59:45,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:53,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 21:59:57,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:01,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:06,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:10,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:14,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:18,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:22,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:24,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:25,505 INFO L124 PetriNetUnfolderBase]: 2330/4272 cut-off events. [2024-06-27 22:00:25,505 INFO L125 PetriNetUnfolderBase]: For 10263/10263 co-relation queries the response was YES. [2024-06-27 22:00:25,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14416 conditions, 4272 events. 2330/4272 cut-off events. For 10263/10263 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 25634 event pairs, 194 based on Foata normal form. 0/4259 useless extension candidates. Maximal degree in co-relation 14378. Up to 1131 conditions per place. [2024-06-27 22:00:25,531 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 178 selfloop transitions, 67 changer transitions 9/257 dead transitions. [2024-06-27 22:00:25,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 257 transitions, 2102 flow [2024-06-27 22:00:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 22:00:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 22:00:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 315 transitions. [2024-06-27 22:00:25,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3563348416289593 [2024-06-27 22:00:25,534 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 962 flow. Second operand 17 states and 315 transitions. [2024-06-27 22:00:25,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 257 transitions, 2102 flow [2024-06-27 22:00:25,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 257 transitions, 2009 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 22:00:25,579 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 1234 flow [2024-06-27 22:00:25,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1234, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-06-27 22:00:25,579 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 86 predicate places. [2024-06-27 22:00:25,579 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 1234 flow [2024-06-27 22:00:25,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.6875) internal successors, (310), 32 states have internal predecessors, (310), 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:25,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:25,580 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, 1] [2024-06-27 22:00:25,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 22:00:25,781 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 22:00:25,782 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 22:00:25,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:25,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1364337663, now seen corresponding path program 3 times [2024-06-27 22:00:25,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:25,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019866028] [2024-06-27 22:00:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:26,872 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:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019866028] [2024-06-27 22:00:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019866028] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839611337] [2024-06-27 22:00:26,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 22:00:26,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:26,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:26,874 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 22:00:26,918 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 22:00:27,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 22:00:27,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:00:27,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-27 22:00:27,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:27,103 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 7 treesize of output 6 [2024-06-27 22:00:27,109 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 22:00:27,353 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 117 treesize of output 107 [2024-06-27 22:00:27,444 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 18 treesize of output 13 [2024-06-27 22:00:27,772 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 124 treesize of output 114 [2024-06-27 22:00:27,780 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 58 treesize of output 49 [2024-06-27 22:00:28,072 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 57 treesize of output 47 [2024-06-27 22:00:28,075 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 41 treesize of output 33 [2024-06-27 22:00:28,103 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:28,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:28,292 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:28,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:28,756 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:28,772 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 22:00:28,772 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:34,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:34,955 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:34,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:00:34,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 91 [2024-06-27 22:00:42,535 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:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839611337] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:42,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 22:00:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939036913] [2024-06-27 22:00:42,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:42,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 22:00:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 22:00:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=826, Unknown=1, NotChecked=0, Total=992 [2024-06-27 22:00:46,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:47,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:52,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:56,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:00:56,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2024-06-27 22:00:56,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 1234 flow. Second operand has 32 states, 32 states have (on average 9.6875) internal successors, (310), 32 states have internal predecessors, (310), 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:56,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:56,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2024-06-27 22:00:56,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:01,636 INFO L124 PetriNetUnfolderBase]: 2567/4712 cut-off events. [2024-06-27 22:01:01,637 INFO L125 PetriNetUnfolderBase]: For 15806/15806 co-relation queries the response was YES. [2024-06-27 22:01:01,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17220 conditions, 4712 events. 2567/4712 cut-off events. For 15806/15806 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 28676 event pairs, 416 based on Foata normal form. 15/4713 useless extension candidates. Maximal degree in co-relation 17177. Up to 2430 conditions per place. [2024-06-27 22:01:01,697 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 184 selfloop transitions, 50 changer transitions 6/243 dead transitions. [2024-06-27 22:01:01,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 243 transitions, 2260 flow [2024-06-27 22:01:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 22:01:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 22:01:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 279 transitions. [2024-06-27 22:01:01,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33533653846153844 [2024-06-27 22:01:01,701 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 1234 flow. Second operand 16 states and 279 transitions. [2024-06-27 22:01:01,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 243 transitions, 2260 flow [2024-06-27 22:01:01,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 243 transitions, 2161 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-27 22:01:01,762 INFO L231 Difference]: Finished difference. Result has 144 places, 143 transitions, 1482 flow [2024-06-27 22:01:01,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1482, PETRI_PLACES=144, PETRI_TRANSITIONS=143} [2024-06-27 22:01:01,763 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 96 predicate places. [2024-06-27 22:01:01,764 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 143 transitions, 1482 flow [2024-06-27 22:01:01,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.6875) internal successors, (310), 32 states have internal predecessors, (310), 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:01:01,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:01,764 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, 1] [2024-06-27 22:01:01,792 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:01:01,976 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:01:01,976 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:01:01,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 575621857, now seen corresponding path program 4 times [2024-06-27 22:01:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:01,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654374253] [2024-06-27 22:01:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:03,128 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:01:03,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:03,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654374253] [2024-06-27 22:01:03,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654374253] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:01:03,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030634404] [2024-06-27 22:01:03,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 22:01:03,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:01:03,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:01:03,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 22:01:03,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 22:01:03,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 22:01:03,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:01:03,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2024-06-27 22:01:03,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:01:03,315 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 7 treesize of output 6 [2024-06-27 22:01:03,331 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 22:01:03,624 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 149 treesize of output 131 [2024-06-27 22:01:03,765 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 18 treesize of output 13 [2024-06-27 22:01:03,993 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 137 treesize of output 123 [2024-06-27 22:01:04,007 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-27 22:01:04,011 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-27 22:01:04,020 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 58 treesize of output 49 [2024-06-27 22:01:04,033 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 22:01:04,323 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 63 treesize of output 51 [2024-06-27 22:01:04,327 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 26 treesize of output 20 [2024-06-27 22:01:04,357 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:01:04,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:01:04,611 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:01:05,439 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 22:01:05,440 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:01:05,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:01:05,454 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:01:36,722 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:01:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030634404] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:01:36,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:01:36,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 32 [2024-06-27 22:01:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446492103] [2024-06-27 22:01:36,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:01:36,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-06-27 22:01:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-06-27 22:01:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=863, Unknown=5, NotChecked=0, Total=1056 [2024-06-27 22:01:40,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:01:44,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:01:49,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:01:49,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2024-06-27 22:01:49,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 1482 flow. Second operand has 33 states, 33 states have (on average 9.606060606060606) internal successors, (317), 33 states have internal predecessors, (317), 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:01:49,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:49,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2024-06-27 22:01:49,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:53,276 INFO L124 PetriNetUnfolderBase]: 2656/4880 cut-off events. [2024-06-27 22:01:53,276 INFO L125 PetriNetUnfolderBase]: For 19382/19382 co-relation queries the response was YES. [2024-06-27 22:01:53,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18563 conditions, 4880 events. 2656/4880 cut-off events. For 19382/19382 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 30002 event pairs, 479 based on Foata normal form. 15/4881 useless extension candidates. Maximal degree in co-relation 18514. Up to 2802 conditions per place. [2024-06-27 22:01:53,307 INFO L140 encePairwiseOnDemand]: 33/52 looper letters, 191 selfloop transitions, 45 changer transitions 9/248 dead transitions. [2024-06-27 22:01:53,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 248 transitions, 2449 flow [2024-06-27 22:01:53,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 22:01:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 22:01:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 273 transitions. [2024-06-27 22:01:53,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.328125 [2024-06-27 22:01:53,308 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 1482 flow. Second operand 16 states and 273 transitions. [2024-06-27 22:01:53,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 248 transitions, 2449 flow [2024-06-27 22:01:53,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 248 transitions, 2309 flow, removed 41 selfloop flow, removed 10 redundant places. [2024-06-27 22:01:53,384 INFO L231 Difference]: Finished difference. Result has 155 places, 151 transitions, 1580 flow [2024-06-27 22:01:53,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1580, PETRI_PLACES=155, PETRI_TRANSITIONS=151} [2024-06-27 22:01:53,384 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 107 predicate places. [2024-06-27 22:01:53,385 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 1580 flow [2024-06-27 22:01:53,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.606060606060606) internal successors, (317), 33 states have internal predecessors, (317), 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:01:53,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:53,385 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, 1] [2024-06-27 22:01:53,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 22:01:53,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-06-27 22:01:53,600 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:01:53,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash -491428771, now seen corresponding path program 5 times [2024-06-27 22:01:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:53,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616291626] [2024-06-27 22:01:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:54,638 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:01:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616291626] [2024-06-27 22:01:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616291626] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:01:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938848091] [2024-06-27 22:01:54,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 22:01:54,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:01:54,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:01:54,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 22:01:54,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 22:01:54,820 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 22:01:54,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:01:54,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 36 conjunts are in the unsatisfiable core [2024-06-27 22:01:54,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:01:54,833 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 7 treesize of output 6 [2024-06-27 22:01:54,845 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 22:01:55,296 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 117 treesize of output 107 [2024-06-27 22:01:55,380 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 18 treesize of output 13 [2024-06-27 22:01:55,588 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 124 treesize of output 114 [2024-06-27 22:01:55,610 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 66 treesize of output 57 [2024-06-27 22:01:55,990 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 36 treesize of output 30 [2024-06-27 22:01:55,996 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 67 treesize of output 55 [2024-06-27 22:01:56,079 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:01:56,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:01:56,330 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:01:56,998 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 22:01:56,999 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:01:57,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:01:57,015 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:02:08,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-27 22:02:08,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:02:08,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 195 [2024-06-27 22:02:08,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:02:08,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 7620 treesize of output 4354 [2024-06-27 22:02:09,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:02:09,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 135 [2024-06-27 22:02:09,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 22:02:09,747 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:02:09,763 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 22:02:09,764 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:02:56,622 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:02:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938848091] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:02:56,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:02:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-06-27 22:02:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142611293] [2024-06-27 22:02:56,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:02:56,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 22:02:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:56,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 22:02:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=811, Unknown=10, NotChecked=0, Total=992 [2024-06-27 22:03:00,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:03:04,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:03:08,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:03:13,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:03:17,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 22:03:17,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 52 [2024-06-27 22:03:17,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 1580 flow. Second operand has 32 states, 32 states have (on average 9.6875) internal successors, (310), 32 states have internal predecessors, (310), 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:03:17,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:03:17,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 52 [2024-06-27 22:03:17,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:24,850 INFO L124 PetriNetUnfolderBase]: 2890/5305 cut-off events. [2024-06-27 22:03:24,850 INFO L125 PetriNetUnfolderBase]: For 22850/22850 co-relation queries the response was YES. [2024-06-27 22:03:24,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20547 conditions, 5305 events. 2890/5305 cut-off events. For 22850/22850 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 33243 event pairs, 1495 based on Foata normal form. 0/5292 useless extension candidates. Maximal degree in co-relation 20492. Up to 3635 conditions per place. [2024-06-27 22:03:24,881 INFO L140 encePairwiseOnDemand]: 33/52 looper letters, 190 selfloop transitions, 54 changer transitions 7/254 dead transitions. [2024-06-27 22:03:24,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 254 transitions, 2664 flow [2024-06-27 22:03:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 22:03:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 22:03:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 258 transitions. [2024-06-27 22:03:24,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33076923076923076 [2024-06-27 22:03:24,883 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 1580 flow. Second operand 15 states and 258 transitions. [2024-06-27 22:03:24,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 254 transitions, 2664 flow [2024-06-27 22:03:24,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 254 transitions, 2522 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-27 22:03:24,971 INFO L231 Difference]: Finished difference. Result has 164 places, 168 transitions, 1904 flow [2024-06-27 22:03:24,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1904, PETRI_PLACES=164, PETRI_TRANSITIONS=168} [2024-06-27 22:03:24,971 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 116 predicate places. [2024-06-27 22:03:24,971 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 168 transitions, 1904 flow [2024-06-27 22:03:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.6875) internal successors, (310), 32 states have internal predecessors, (310), 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:03:24,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:24,972 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, 1] [2024-06-27 22:03:24,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-27 22:03:25,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-06-27 22:03:25,184 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:03:25,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash -112387299, now seen corresponding path program 1 times [2024-06-27 22:03:25,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:25,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436231424] [2024-06-27 22:03:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:03:25,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:03:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:03:25,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:03:25,286 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:03:25,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:03:25,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:03:25,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:03:25,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:03:25,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-06-27 22:03:25,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:03:25,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2024-06-27 22:03:25,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-06-27 22:03:25,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:03:25,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:03:25,289 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:25,295 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:03:25,295 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:03:25,357 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:03:25,357 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:03:25,357 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:03:25 BasicIcfg [2024-06-27 22:03:25,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:03:25,360 INFO L158 Benchmark]: Toolchain (without parser) took 256382.03ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 97.5MB in the beginning and 592.4MB in the end (delta: -495.0MB). Peak memory consumption was 277.6MB. Max. memory is 16.1GB. [2024-06-27 22:03:25,361 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:03:25,361 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 100.7MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:03:25,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.85ms. Allocated memory is still 178.3MB. Free memory was 97.3MB in the beginning and 125.5MB in the end (delta: -28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-06-27 22:03:25,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.97ms. Allocated memory is still 178.3MB. Free memory was 125.5MB in the beginning and 122.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:03:25,362 INFO L158 Benchmark]: Boogie Preprocessor took 46.20ms. Allocated memory is still 178.3MB. Free memory was 122.0MB in the beginning and 118.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:03:25,362 INFO L158 Benchmark]: RCFGBuilder took 662.43ms. Allocated memory is still 178.3MB. Free memory was 118.7MB in the beginning and 131.2MB in the end (delta: -12.5MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2024-06-27 22:03:25,365 INFO L158 Benchmark]: TraceAbstraction took 254915.24ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 131.1MB in the beginning and 592.4MB in the end (delta: -461.3MB). Peak memory consumption was 308.5MB. Max. memory is 16.1GB. [2024-06-27 22:03:25,366 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.16ms. Allocated memory is still 178.3MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 100.7MB in the end (delta: 168.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.85ms. Allocated memory is still 178.3MB. Free memory was 97.3MB in the beginning and 125.5MB in the end (delta: -28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.97ms. Allocated memory is still 178.3MB. Free memory was 125.5MB in the beginning and 122.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.20ms. Allocated memory is still 178.3MB. Free memory was 122.0MB in the beginning and 118.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.43ms. Allocated memory is still 178.3MB. Free memory was 118.7MB in the beginning and 131.2MB in the end (delta: -12.5MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * TraceAbstraction took 254915.24ms. Allocated memory was 178.3MB in the beginning and 947.9MB in the end (delta: 769.7MB). Free memory was 131.1MB in the beginning and 592.4MB in the end (delta: -461.3MB). Peak memory consumption was 308.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[(800)]; [L949] 0 int stored_elements[(800)]; [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)) [L1062] 0 //@ ghost multithreaded = 1; VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, 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}] [L1063] 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 == (800)) [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)) [L1017] 1 //@ ghost m_locked = 0; [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, id2=0, m={3:0}, queue={5:0}, stored_elements={4: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<(800) 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=800] [L1037] COND TRUE 2 i<(800) 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<((800)-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=800] [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 == (800)) [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 == (800)) [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: 1063]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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: 1062]: 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: 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: 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, 76 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: 254.8s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 112.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 2123 SdHoareTripleChecker+Valid, 101.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2051 mSDsluCounter, 1255 SdHoareTripleChecker+Invalid, 99.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 196 IncrementalHoareTripleChecker+Unchecked, 1186 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9632 IncrementalHoareTripleChecker+Invalid, 9957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 69 mSDtfsCounter, 9632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 218 SyntacticMatches, 6 SemanticMatches, 257 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2284 ImplicationChecksByTransitivity, 111.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1904occurred in iteration=17, InterpolantAutomatonStates: 171, 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.7s SatisfiabilityAnalysisTime, 139.8s InterpolantComputationTime, 563 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 659 ConstructedInterpolants, 151 QuantifiedInterpolants, 155660 SizeOfPredicates, 151 NumberOfNonLiveVariables, 1380 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 12/60 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:03:25,459 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 0 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