./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.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/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c ./goblint.2024-06-19_11-23-25.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 19:43:01,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:43:01,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:43:01,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:43:01,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:43:01,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:43:01,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:43:01,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:43:01,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:43:01,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:43:01,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:43:01,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:43:01,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:43:01,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:43:01,883 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:43:01,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:43:01,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:43:01,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:43:01,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:43:01,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:43:01,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:43:01,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:43:01,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:43:01,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:43:01,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:43:01,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:43:01,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:43:01,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:43:01,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:43:01,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:43:01,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:43:01,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:43:01,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:43:01,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:43:01,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:43:01,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:43:01,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:43:01,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:43:01,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:43:01,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:43:01,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:43:01,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:43:01,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:43:01,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 19:43:02,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:43:02,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:43:02,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:43:02,116 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:43:02,116 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:43:02,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml [2024-06-27 19:43:02,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:43:02,242 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:43:02,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-27 19:43:03,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:43:03,347 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:43:03,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-27 19:43:03,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acd6161e/ccbfbb120ca54081961de3e799af59e8/FLAGf60fa268e [2024-06-27 19:43:03,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4acd6161e/ccbfbb120ca54081961de3e799af59e8 [2024-06-27 19:43:03,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:43:03,364 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:43:03,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:43:03,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:43:03,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:43:03,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:43:02" (1/2) ... [2024-06-27 19:43:03,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27949e31 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:43:03, skipping insertion in model container [2024-06-27 19:43:03,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:43:02" (1/2) ... [2024-06-27 19:43:03,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@17a799e6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:43:03, skipping insertion in model container [2024-06-27 19:43:03,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:43:03" (2/2) ... [2024-06-27 19:43:03,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27949e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03, skipping insertion in model container [2024-06-27 19:43:03,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:43:03" (2/2) ... [2024-06-27 19:43:03,377 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:43:03,390 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:43:03,391 INFO L97 edCorrectnessWitness]: Location invariant before [L96-L96] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 19:43:03,391 INFO L97 edCorrectnessWitness]: Location invariant before [L97-L97] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 19:43:03,391 INFO L97 edCorrectnessWitness]: Location invariant before [L98-L98] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 19:43:03,392 INFO L97 edCorrectnessWitness]: Location invariant before [L99-L99] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 19:43:03,392 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:43:03,392 INFO L106 edCorrectnessWitness]: ghost_update [L95-L95] multithreaded = 1; [2024-06-27 19:43:03,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:43:03,586 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:43:03,594 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 19:43:03,653 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:43:03,669 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:43:03,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03 WrapperNode [2024-06-27 19:43:03,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:43:03,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:43:03,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:43:03,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:43:03,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,703 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 123 [2024-06-27 19:43:03,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:43:03,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:43:03,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:43:03,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:43:03,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,745 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 19:43:03,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:43:03,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:43:03,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:43:03,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:43:03,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (1/1) ... [2024-06-27 19:43:03,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:43:03,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:43:03,797 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 19:43:03,798 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 19:43:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:43:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 19:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 19:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 19:43:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 19:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 19:43:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 19:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 19:43:03,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 19:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 19:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 19:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:43:03,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:43:03,825 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 19:43:03,902 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:43:03,904 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:43:04,078 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:43:04,079 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:43:04,222 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:43:04,222 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 19:43:04,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:43:04 BoogieIcfgContainer [2024-06-27 19:43:04,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:43:04,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:43:04,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:43:04,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:43:04,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:43:02" (1/4) ... [2024-06-27 19:43:04,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffb95d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:43:04, skipping insertion in model container [2024-06-27 19:43:04,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:43:03" (2/4) ... [2024-06-27 19:43:04,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffb95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:43:04, skipping insertion in model container [2024-06-27 19:43:04,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:43:03" (3/4) ... [2024-06-27 19:43:04,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffb95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:43:04, skipping insertion in model container [2024-06-27 19:43:04,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:43:04" (4/4) ... [2024-06-27 19:43:04,242 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-27 19:43:04,255 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:43:04,256 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 19:43:04,256 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:43:04,299 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 19:43:04,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 114 flow [2024-06-27 19:43:04,358 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2024-06-27 19:43:04,358 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 19:43:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 4/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 19:43:04,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 114 flow [2024-06-27 19:43:04,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 95 flow [2024-06-27 19:43:04,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:43:04,381 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;@41798b7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:43:04,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 19:43:04,383 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:43:04,383 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 19:43:04,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:43:04,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:04,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:43:04,384 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:04,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash 386037926, now seen corresponding path program 1 times [2024-06-27 19:43:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369866038] [2024-06-27 19:43:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:04,698 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 19:43:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369866038] [2024-06-27 19:43:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369866038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:43:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091447900] [2024-06-27 19:43:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:04,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:43:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:43:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:43:04,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:04,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:04,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:04,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:04,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:05,082 INFO L124 PetriNetUnfolderBase]: 2119/2910 cut-off events. [2024-06-27 19:43:05,082 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-06-27 19:43:05,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5728 conditions, 2910 events. 2119/2910 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12676 event pairs, 248 based on Foata normal form. 24/2852 useless extension candidates. Maximal degree in co-relation 5135. Up to 2289 conditions per place. [2024-06-27 19:43:05,100 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 38 selfloop transitions, 4 changer transitions 6/58 dead transitions. [2024-06-27 19:43:05,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 251 flow [2024-06-27 19:43:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:43:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:43:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-27 19:43:05,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2024-06-27 19:43:05,111 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 95 flow. Second operand 3 states and 94 transitions. [2024-06-27 19:43:05,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 251 flow [2024-06-27 19:43:05,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 227 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 19:43:05,120 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 105 flow [2024-06-27 19:43:05,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 19:43:05,125 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2024-06-27 19:43:05,125 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 105 flow [2024-06-27 19:43:05,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:05,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:05,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:43:05,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:05,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1429283465, now seen corresponding path program 1 times [2024-06-27 19:43:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084924456] [2024-06-27 19:43:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:05,217 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 19:43:05,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084924456] [2024-06-27 19:43:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084924456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:05,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:43:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906869155] [2024-06-27 19:43:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:05,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:43:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:05,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:43:05,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:43:05,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:05,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:05,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:05,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:05,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:05,469 INFO L124 PetriNetUnfolderBase]: 2017/2774 cut-off events. [2024-06-27 19:43:05,469 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2024-06-27 19:43:05,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6395 conditions, 2774 events. 2017/2774 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12403 event pairs, 200 based on Foata normal form. 42/2767 useless extension candidates. Maximal degree in co-relation 1469. Up to 1819 conditions per place. [2024-06-27 19:43:05,483 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 50 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2024-06-27 19:43:05,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 286 flow [2024-06-27 19:43:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:43:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:43:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-06-27 19:43:05,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-06-27 19:43:05,487 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 105 flow. Second operand 4 states and 116 transitions. [2024-06-27 19:43:05,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 286 flow [2024-06-27 19:43:05,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:43:05,491 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 130 flow [2024-06-27 19:43:05,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2024-06-27 19:43:05,491 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2024-06-27 19:43:05,492 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 130 flow [2024-06-27 19:43:05,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:05,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:05,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:05,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:43:05,496 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:05,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2136693893, now seen corresponding path program 1 times [2024-06-27 19:43:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140667850] [2024-06-27 19:43:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:05,560 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 19:43:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:05,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140667850] [2024-06-27 19:43:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140667850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:05,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:05,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:43:05,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978067088] [2024-06-27 19:43:05,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:05,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:43:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:43:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:43:05,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 19:43:05,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:05,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:05,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 19:43:05,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:05,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][41], [40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, 27#L67true, 4#thread4EXITtrue, 59#true, 29#L44true, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 64#true, thread4Thread1of1ForFork3InUse, Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:05,731 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-27 19:43:05,732 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 19:43:05,732 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 19:43:05,732 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 19:43:05,734 INFO L124 PetriNetUnfolderBase]: 1666/2423 cut-off events. [2024-06-27 19:43:05,734 INFO L125 PetriNetUnfolderBase]: For 1590/1631 co-relation queries the response was YES. [2024-06-27 19:43:05,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 2423 events. 1666/2423 cut-off events. For 1590/1631 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11274 event pairs, 219 based on Foata normal form. 40/2387 useless extension candidates. Maximal degree in co-relation 2156. Up to 1942 conditions per place. [2024-06-27 19:43:05,746 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 38 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2024-06-27 19:43:05,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 253 flow [2024-06-27 19:43:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:43:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:43:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-06-27 19:43:05,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7131782945736435 [2024-06-27 19:43:05,747 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 130 flow. Second operand 3 states and 92 transitions. [2024-06-27 19:43:05,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 253 flow [2024-06-27 19:43:05,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:43:05,749 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 146 flow [2024-06-27 19:43:05,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2024-06-27 19:43:05,750 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2024-06-27 19:43:05,750 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 146 flow [2024-06-27 19:43:05,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:05,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:05,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:05,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:43:05,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:05,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash -460032186, now seen corresponding path program 1 times [2024-06-27 19:43:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771461859] [2024-06-27 19:43:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:05,876 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 19:43:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771461859] [2024-06-27 19:43:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771461859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:05,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:43:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047797164] [2024-06-27 19:43:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:05,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:43:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:43:05,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:43:05,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:05,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 146 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 19:43:05,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:05,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:06,146 INFO L124 PetriNetUnfolderBase]: 1999/2838 cut-off events. [2024-06-27 19:43:06,146 INFO L125 PetriNetUnfolderBase]: For 1764/1764 co-relation queries the response was YES. [2024-06-27 19:43:06,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7340 conditions, 2838 events. 1999/2838 cut-off events. For 1764/1764 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13256 event pairs, 279 based on Foata normal form. 40/2833 useless extension candidates. Maximal degree in co-relation 2078. Up to 1309 conditions per place. [2024-06-27 19:43:06,161 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 59 selfloop transitions, 8 changer transitions 2/79 dead transitions. [2024-06-27 19:43:06,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 385 flow [2024-06-27 19:43:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:43:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:43:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-06-27 19:43:06,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-06-27 19:43:06,164 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 146 flow. Second operand 5 states and 140 transitions. [2024-06-27 19:43:06,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 79 transitions, 385 flow [2024-06-27 19:43:06,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:43:06,168 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 167 flow [2024-06-27 19:43:06,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-27 19:43:06,169 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2024-06-27 19:43:06,170 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 167 flow [2024-06-27 19:43:06,170 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 19:43:06,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:06,170 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 19:43:06,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:43:06,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:06,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -655645476, now seen corresponding path program 1 times [2024-06-27 19:43:06,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441628858] [2024-06-27 19:43:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:06,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:06,330 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 19:43:06,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:06,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441628858] [2024-06-27 19:43:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441628858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:06,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:43:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642442751] [2024-06-27 19:43:06,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:06,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:43:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:06,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:43:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:43:06,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:06,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 19:43:06,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:06,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:06,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:06,615 INFO L124 PetriNetUnfolderBase]: 2051/2906 cut-off events. [2024-06-27 19:43:06,615 INFO L125 PetriNetUnfolderBase]: For 2966/2966 co-relation queries the response was YES. [2024-06-27 19:43:06,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 2906 events. 2051/2906 cut-off events. For 2966/2966 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13470 event pairs, 325 based on Foata normal form. 24/2894 useless extension candidates. Maximal degree in co-relation 4418. Up to 2042 conditions per place. [2024-06-27 19:43:06,635 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 57 selfloop transitions, 8 changer transitions 0/75 dead transitions. [2024-06-27 19:43:06,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 391 flow [2024-06-27 19:43:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:43:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:43:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-06-27 19:43:06,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6232558139534884 [2024-06-27 19:43:06,638 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 167 flow. Second operand 5 states and 134 transitions. [2024-06-27 19:43:06,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 391 flow [2024-06-27 19:43:06,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 19:43:06,644 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 192 flow [2024-06-27 19:43:06,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-06-27 19:43:06,646 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2024-06-27 19:43:06,647 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 192 flow [2024-06-27 19:43:06,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 19:43:06,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:06,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:06,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 19:43:06,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:06,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1898970586, now seen corresponding path program 1 times [2024-06-27 19:43:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374995648] [2024-06-27 19:43:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:06,765 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 19:43:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374995648] [2024-06-27 19:43:06,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374995648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:06,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:06,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:43:06,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860244819] [2024-06-27 19:43:06,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:06,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:43:06,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:43:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:43:06,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:06,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 19:43:06,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:06,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:06,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:07,020 INFO L124 PetriNetUnfolderBase]: 2167/3102 cut-off events. [2024-06-27 19:43:07,020 INFO L125 PetriNetUnfolderBase]: For 3967/3967 co-relation queries the response was YES. [2024-06-27 19:43:07,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8802 conditions, 3102 events. 2167/3102 cut-off events. For 3967/3967 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14802 event pairs, 312 based on Foata normal form. 24/3081 useless extension candidates. Maximal degree in co-relation 4942. Up to 1757 conditions per place. [2024-06-27 19:43:07,040 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 58 selfloop transitions, 8 changer transitions 3/79 dead transitions. [2024-06-27 19:43:07,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 437 flow [2024-06-27 19:43:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:43:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:43:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-06-27 19:43:07,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-06-27 19:43:07,042 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 192 flow. Second operand 5 states and 135 transitions. [2024-06-27 19:43:07,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 437 flow [2024-06-27 19:43:07,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 421 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 19:43:07,050 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 204 flow [2024-06-27 19:43:07,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-06-27 19:43:07,053 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-06-27 19:43:07,053 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 204 flow [2024-06-27 19:43:07,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 19:43:07,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:07,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:07,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 19:43:07,053 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:07,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1178398099, now seen corresponding path program 1 times [2024-06-27 19:43:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646486187] [2024-06-27 19:43:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:07,179 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 19:43:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646486187] [2024-06-27 19:43:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646486187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:43:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891977363] [2024-06-27 19:43:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:07,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:43:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:43:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:43:07,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:07,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 19:43:07,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:07,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:07,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:07,465 INFO L124 PetriNetUnfolderBase]: 2143/3069 cut-off events. [2024-06-27 19:43:07,466 INFO L125 PetriNetUnfolderBase]: For 4564/4564 co-relation queries the response was YES. [2024-06-27 19:43:07,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 3069 events. 2143/3069 cut-off events. For 4564/4564 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14584 event pairs, 332 based on Foata normal form. 24/3053 useless extension candidates. Maximal degree in co-relation 6306. Up to 1918 conditions per place. [2024-06-27 19:43:07,479 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 64 selfloop transitions, 9 changer transitions 4/87 dead transitions. [2024-06-27 19:43:07,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 478 flow [2024-06-27 19:43:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:43:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:43:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-06-27 19:43:07,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2024-06-27 19:43:07,480 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 204 flow. Second operand 6 states and 159 transitions. [2024-06-27 19:43:07,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 478 flow [2024-06-27 19:43:07,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 19:43:07,492 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 214 flow [2024-06-27 19:43:07,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-06-27 19:43:07,493 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2024-06-27 19:43:07,493 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 214 flow [2024-06-27 19:43:07,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 19:43:07,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:07,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:07,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:43:07,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:07,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1142512942, now seen corresponding path program 1 times [2024-06-27 19:43:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912056456] [2024-06-27 19:43:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:07,572 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 19:43:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912056456] [2024-06-27 19:43:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912056456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:07,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:43:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323206937] [2024-06-27 19:43:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:07,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:43:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:43:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:43:07,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:07,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 19:43:07,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:07,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:07,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:07,810 INFO L124 PetriNetUnfolderBase]: 2187/3135 cut-off events. [2024-06-27 19:43:07,810 INFO L125 PetriNetUnfolderBase]: For 5371/5371 co-relation queries the response was YES. [2024-06-27 19:43:07,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9322 conditions, 3135 events. 2187/3135 cut-off events. For 5371/5371 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15048 event pairs, 420 based on Foata normal form. 16/3121 useless extension candidates. Maximal degree in co-relation 6892. Up to 2330 conditions per place. [2024-06-27 19:43:07,823 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 55 selfloop transitions, 8 changer transitions 2/75 dead transitions. [2024-06-27 19:43:07,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 438 flow [2024-06-27 19:43:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:43:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:43:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-06-27 19:43:07,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 19:43:07,824 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 214 flow. Second operand 5 states and 129 transitions. [2024-06-27 19:43:07,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 438 flow [2024-06-27 19:43:07,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 420 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 19:43:07,837 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 235 flow [2024-06-27 19:43:07,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2024-06-27 19:43:07,838 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-06-27 19:43:07,838 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 235 flow [2024-06-27 19:43:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 19:43:07,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:07,838 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] [2024-06-27 19:43:07,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 19:43:07,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:07,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1963286079, now seen corresponding path program 1 times [2024-06-27 19:43:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859508674] [2024-06-27 19:43:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:07,870 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 19:43:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859508674] [2024-06-27 19:43:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859508674] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:43:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278810407] [2024-06-27 19:43:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:07,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:43:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:07,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:43:07,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:43:07,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-06-27 19:43:07,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:07,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:07,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-06-27 19:43:07,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:08,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [8#L56true, Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 27#L67true, 25#L79true, 101#(= ~counter~0 0), Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,413 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,413 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 19:43:08,414 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,414 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 8#L56true, Black: 66#(= ~counter~0 0), 99#true, 29#L44true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 27#L67true, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,418 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,419 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 19:43:08,419 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,419 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 19:43:08,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 8#L56true, Black: 66#(= ~counter~0 0), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 25#L79true, 101#(= ~counter~0 0), Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,420 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,420 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,420 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,420 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 19:43:08,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [8#L56true, Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 27#L67true, 4#thread4EXITtrue, 101#(= ~counter~0 0), Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,420 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,420 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,421 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,421 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 19:43:08,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][62], [8#L56true, Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), 99#true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 27#L67true, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,421 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,421 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,421 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,421 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 8#L56true, Black: 66#(= ~counter~0 0), 29#L44true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 102#(<= ~counter~0 1), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, 27#L67true, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,423 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,423 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 19:43:08,423 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 19:43:08,423 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 19:43:08,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), 99#true, 29#L44true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 34#thread3EXITtrue, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,424 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,424 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,424 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,424 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 8#L56true, Black: 66#(= ~counter~0 0), 99#true, 29#L44true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,425 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,425 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 19:43:08,425 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,425 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][62], [8#L56true, Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), 99#true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,426 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,426 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,426 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [8#L56true, Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, 101#(= ~counter~0 0), Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,427 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,427 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 19:43:08,427 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 19:43:08,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), 29#L44true, 102#(<= ~counter~0 1), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, 27#L67true, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 13#thread2EXITtrue, 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,428 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 19:43:08,428 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,428 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,428 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 8#L56true, Black: 66#(= ~counter~0 0), 29#L44true, 102#(<= ~counter~0 1), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#thread3EXITtrue, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,428 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 19:43:08,429 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,429 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,429 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 19:43:08,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 66#(= ~counter~0 0), 29#L44true, 102#(<= ~counter~0 1), Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 34#thread3EXITtrue, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 13#thread2EXITtrue, 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,429 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-27 19:43:08,429 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,429 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([384] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][18], [Black: 97#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 8#L56true, Black: 66#(= ~counter~0 0), 99#true, 29#L44true, Black: 72#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 78#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), thread4Thread1of1ForFork3InUse, 40#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 4#thread4EXITtrue, 27#L67true, Black: 84#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 57#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 93#true, Black: 91#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 62#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0))]) [2024-06-27 19:43:08,430 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-27 19:43:08,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 19:43:08,431 INFO L124 PetriNetUnfolderBase]: 5006/7368 cut-off events. [2024-06-27 19:43:08,431 INFO L125 PetriNetUnfolderBase]: For 16589/16815 co-relation queries the response was YES. [2024-06-27 19:43:08,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22040 conditions, 7368 events. 5006/7368 cut-off events. For 16589/16815 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 43079 event pairs, 880 based on Foata normal form. 297/7533 useless extension candidates. Maximal degree in co-relation 15949. Up to 3066 conditions per place. [2024-06-27 19:43:08,459 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 59 selfloop transitions, 23 changer transitions 0/93 dead transitions. [2024-06-27 19:43:08,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 633 flow [2024-06-27 19:43:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:43:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:43:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-06-27 19:43:08,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-06-27 19:43:08,460 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 235 flow. Second operand 4 states and 128 transitions. [2024-06-27 19:43:08,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 633 flow [2024-06-27 19:43:08,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 93 transitions, 608 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 19:43:08,483 INFO L231 Difference]: Finished difference. Result has 54 places, 65 transitions, 512 flow [2024-06-27 19:43:08,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=54, PETRI_TRANSITIONS=65} [2024-06-27 19:43:08,484 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2024-06-27 19:43:08,484 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 65 transitions, 512 flow [2024-06-27 19:43:08,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:43:08,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:08,484 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] [2024-06-27 19:43:08,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 19:43:08,484 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:08,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2122979485, now seen corresponding path program 1 times [2024-06-27 19:43:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296738049] [2024-06-27 19:43:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:08,591 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 19:43:08,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:08,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296738049] [2024-06-27 19:43:08,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296738049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:08,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:43:08,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:43:08,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190979631] [2024-06-27 19:43:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:08,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:43:08,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:08,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:43:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:43:08,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:08,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 65 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 19:43:08,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:08,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:08,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:09,324 INFO L124 PetriNetUnfolderBase]: 5225/7568 cut-off events. [2024-06-27 19:43:09,325 INFO L125 PetriNetUnfolderBase]: For 24586/24586 co-relation queries the response was YES. [2024-06-27 19:43:09,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27018 conditions, 7568 events. 5225/7568 cut-off events. For 24586/24586 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 42922 event pairs, 984 based on Foata normal form. 48/7591 useless extension candidates. Maximal degree in co-relation 19105. Up to 5530 conditions per place. [2024-06-27 19:43:09,358 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 16 changer transitions 6/114 dead transitions. [2024-06-27 19:43:09,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 970 flow [2024-06-27 19:43:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:43:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:43:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-06-27 19:43:09,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2024-06-27 19:43:09,360 INFO L175 Difference]: Start difference. First operand has 54 places, 65 transitions, 512 flow. Second operand 6 states and 152 transitions. [2024-06-27 19:43:09,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 970 flow [2024-06-27 19:43:09,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 114 transitions, 956 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-06-27 19:43:09,387 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 575 flow [2024-06-27 19:43:09,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2024-06-27 19:43:09,388 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-06-27 19:43:09,388 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 575 flow [2024-06-27 19:43:09,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 19:43:09,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:43:09,388 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:09,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 19:43:09,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 19:43:09,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:43:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash 872084509, now seen corresponding path program 2 times [2024-06-27 19:43:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:43:09,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808870565] [2024-06-27 19:43:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:43:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:43:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:43:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:43:09,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:43:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808870565] [2024-06-27 19:43:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808870565] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 19:43:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167437512] [2024-06-27 19:43:09,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 19:43:09,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:43:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:43:09,499 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 19:43:09,520 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 19:43:09,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 19:43:09,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 19:43:09,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 19:43:09,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 19:43:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:43:09,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 19:43:09,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167437512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:43:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 19:43:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-06-27 19:43:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065279706] [2024-06-27 19:43:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:43:09,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:43:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:43:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:43:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:43:09,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-06-27 19:43:09,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 575 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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 19:43:09,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:43:09,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-06-27 19:43:09,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:43:10,701 INFO L124 PetriNetUnfolderBase]: 9245/13646 cut-off events. [2024-06-27 19:43:10,701 INFO L125 PetriNetUnfolderBase]: For 55663/55663 co-relation queries the response was YES. [2024-06-27 19:43:10,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47872 conditions, 13646 events. 9245/13646 cut-off events. For 55663/55663 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 86162 event pairs, 1812 based on Foata normal form. 312/13881 useless extension candidates. Maximal degree in co-relation 34143. Up to 3537 conditions per place. [2024-06-27 19:43:10,739 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 0 selfloop transitions, 0 changer transitions 164/164 dead transitions. [2024-06-27 19:43:10,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 164 transitions, 1610 flow [2024-06-27 19:43:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:43:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:43:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-06-27 19:43:10,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6079734219269103 [2024-06-27 19:43:10,741 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 575 flow. Second operand 7 states and 183 transitions. [2024-06-27 19:43:10,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 164 transitions, 1610 flow [2024-06-27 19:43:10,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 164 transitions, 1573 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 19:43:10,827 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2024-06-27 19:43:10,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2024-06-27 19:43:10,827 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2024-06-27 19:43:10,827 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2024-06-27 19:43:10,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 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 19:43:10,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-27 19:43:10,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-27 19:43:10,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-27 19:43:10,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-27 19:43:10,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-27 19:43:10,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-27 19:43:10,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-27 19:43:10,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-27 19:43:10,847 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 19:43:11,042 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,SelfDestructingSolverStorable10 [2024-06-27 19:43:11,042 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:43:11,045 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 19:43:11,045 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 19:43:11,048 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-27 19:43:11,048 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-27 19:43:11,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 07:43:11 BasicIcfg [2024-06-27 19:43:11,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 19:43:11,049 INFO L158 Benchmark]: Toolchain (without parser) took 7685.85ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 146.8MB in the beginning and 886.8MB in the end (delta: -740.0MB). Peak memory consumption was 358.0MB. Max. memory is 16.1GB. [2024-06-27 19:43:11,050 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 80.0MB in the beginning and 79.8MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:43:11,050 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:43:11,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.13ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 130.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-27 19:43:11,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.32ms. Allocated memory is still 174.1MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 19:43:11,050 INFO L158 Benchmark]: Boogie Preprocessor took 61.11ms. Allocated memory is still 174.1MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 19:43:11,051 INFO L158 Benchmark]: RCFGBuilder took 456.37ms. Allocated memory is still 174.1MB. Free memory was 126.0MB in the beginning and 86.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-27 19:43:11,051 INFO L158 Benchmark]: TraceAbstraction took 6825.65ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 85.1MB in the beginning and 886.8MB in the end (delta: -801.7MB). Peak memory consumption was 297.2MB. Max. memory is 16.1GB. [2024-06-27 19:43:11,052 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 127.9MB. Free memory was 80.0MB in the beginning and 79.8MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.13ms. Allocated memory is still 174.1MB. Free memory was 145.7MB in the beginning and 130.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.32ms. Allocated memory is still 174.1MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.11ms. Allocated memory is still 174.1MB. Free memory was 128.1MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.37ms. Allocated memory is still 174.1MB. Free memory was 126.0MB in the beginning and 86.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6825.65ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 85.1MB in the beginning and 886.8MB in the end (delta: -801.7MB). Peak memory consumption was 297.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 96]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 97]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 98]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 99]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 60 locations, 8 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: 6.7s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1774 IncrementalHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 38 mSDtfsCounter, 1774 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=575occurred in iteration=10, InterpolantAutomatonStates: 53, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 2263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2/4 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-27 19:43:11,069 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 Result: TRUE