./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-array-sum-alt2.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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-more-array-sum-alt2.wvr.c ./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-array-sum-alt2.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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 10:56:12,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 10:56:12,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 10:56:12,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 10:56:12,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 10:56:12,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 10:56:12,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 10:56:12,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 10:56:12,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 10:56:12,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 10:56:12,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 10:56:12,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 10:56:12,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 10:56:12,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 10:56:12,710 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 10:56:12,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 10:56:12,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 10:56:12,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 10:56:12,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 10:56:12,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 10:56:12,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 10:56:12,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 10:56:12,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 10:56:12,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 10:56:12,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 10:56:12,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 10:56:12,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 10:56:12,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 10:56:12,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 10:56:12,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 10:56:12,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 10:56:12,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 10:56:12,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:56:12,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 10:56:12,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 10:56:12,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 10:56:12,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 10:56:12,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 10:56:12,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 10:56:12,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 10:56:12,715 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 10:56:12,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 10:56:12,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 10:56:12,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 10:56:12,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 10:56:12,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 10:56:12,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 10:56:12,923 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 10:56:12,924 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 10:56:12,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/popl20-more-array-sum-alt2.wvr.yml/witness.yml [2024-05-12 10:56:12,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 10:56:12,972 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 10:56:12,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2024-05-12 10:56:13,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 10:56:14,063 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 10:56:14,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2024-05-12 10:56:14,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b66660de/e53f645097804686a90c9b531c715f80/FLAGa3948c4a8 [2024-05-12 10:56:14,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b66660de/e53f645097804686a90c9b531c715f80 [2024-05-12 10:56:14,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 10:56:14,087 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 10:56:14,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 10:56:14,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 10:56:14,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 10:56:14,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:56:12" (1/2) ... [2024-05-12 10:56:14,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c5fc74 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:56:14, skipping insertion in model container [2024-05-12 10:56:14,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:56:12" (1/2) ... [2024-05-12 10:56:14,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51f5d904 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 10:56:14, skipping insertion in model container [2024-05-12 10:56:14,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:56:14" (2/2) ... [2024-05-12 10:56:14,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c5fc74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14, skipping insertion in model container [2024-05-12 10:56:14,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 10:56:14" (2/2) ... [2024-05-12 10:56:14,098 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 10:56:14,114 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 10:56:14,118 INFO L97 edCorrectnessWitness]: Location invariant before [L90-L90] ! multithreaded || ((((4294967296LL + (long long )M) + (long long )N >= 0LL && (4294967295LL - (long long )M) + (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) [2024-05-12 10:56:14,118 INFO L97 edCorrectnessWitness]: Location invariant before [L88-L88] ! multithreaded || ((((4294967296LL + (long long )M) + (long long )N >= 0LL && (4294967295LL - (long long )M) + (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) [2024-05-12 10:56:14,118 INFO L97 edCorrectnessWitness]: Location invariant before [L89-L89] ! multithreaded || ((((4294967296LL + (long long )M) + (long long )N >= 0LL && (4294967295LL - (long long )M) + (long long )N >= 0LL) && (4294967295LL + (long long )M) - (long long )N >= 0LL) && (4294967294LL - (long long )M) - (long long )N >= 0LL) [2024-05-12 10:56:14,118 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 10:56:14,118 INFO L106 edCorrectnessWitness]: ghost_update [L87-L87] multithreaded = 1; [2024-05-12 10:56:14,135 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 10:56:14,300 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2024-05-12 10:56:14,314 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:56:14,323 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 10:56:14,386 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2024-05-12 10:56:14,391 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 10:56:14,402 INFO L206 MainTranslator]: Completed translation [2024-05-12 10:56:14,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14 WrapperNode [2024-05-12 10:56:14,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 10:56:14,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 10:56:14,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 10:56:14,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 10:56:14,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,437 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 203 [2024-05-12 10:56:14,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 10:56:14,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 10:56:14,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 10:56:14,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 10:56:14,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,474 INFO L175 MemorySlicer]: Split 12 memory accesses to 5 slices as follows [2, 2, 2, 2, 4]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-05-12 10:56:14,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 10:56:14,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 10:56:14,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 10:56:14,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 10:56:14,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (1/1) ... [2024-05-12 10:56:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 10:56:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:14,509 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-05-12 10:56:14,549 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-05-12 10:56:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 10:56:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 10:56:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 10:56:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 10:56:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 10:56:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 10:56:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 10:56:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-12 10:56:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 10:56:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 10:56:14,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 10:56:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 10:56:14,584 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 10:56:14,670 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 10:56:14,672 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 10:56:14,899 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 10:56:14,899 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 10:56:15,084 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 10:56:15,084 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-12 10:56:15,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:56:15 BoogieIcfgContainer [2024-05-12 10:56:15,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 10:56:15,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 10:56:15,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 10:56:15,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 10:56:15,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 10:56:12" (1/4) ... [2024-05-12 10:56:15,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21750c4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 10:56:15, skipping insertion in model container [2024-05-12 10:56:15,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 10:56:14" (2/4) ... [2024-05-12 10:56:15,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21750c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:56:15, skipping insertion in model container [2024-05-12 10:56:15,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 10:56:14" (3/4) ... [2024-05-12 10:56:15,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21750c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 10:56:15, skipping insertion in model container [2024-05-12 10:56:15,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 10:56:15" (4/4) ... [2024-05-12 10:56:15,092 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2024-05-12 10:56:15,106 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 10:56:15,106 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 10:56:15,106 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 10:56:15,146 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-12 10:56:15,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 107 flow [2024-05-12 10:56:15,200 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-05-12 10:56:15,200 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-05-12 10:56:15,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-05-12 10:56:15,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 43 transitions, 107 flow [2024-05-12 10:56:15,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 39 transitions, 96 flow [2024-05-12 10:56:15,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 10:56:15,226 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;@4f97482b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 10:56:15,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 10:56:15,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 10:56:15,234 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2024-05-12 10:56:15,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 10:56:15,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:15,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:15,235 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:15,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -766222699, now seen corresponding path program 1 times [2024-05-12 10:56:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385991865] [2024-05-12 10:56:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:15,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:15,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385991865] [2024-05-12 10:56:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385991865] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:56:15,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:56:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:56:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686116202] [2024-05-12 10:56:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:15,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 10:56:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 10:56:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 10:56:15,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-05-12 10:56:15,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-05-12 10:56:15,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:15,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-05-12 10:56:15,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:15,907 INFO L124 PetriNetUnfolderBase]: 821/1201 cut-off events. [2024-05-12 10:56:15,907 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-05-12 10:56:15,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 1201 events. 821/1201 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5207 event pairs, 464 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 2067. Up to 1103 conditions per place. [2024-05-12 10:56:15,917 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 28 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2024-05-12 10:56:15,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 148 flow [2024-05-12 10:56:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:56:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:56:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-05-12 10:56:15,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2024-05-12 10:56:15,928 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 96 flow. Second operand 3 states and 62 transitions. [2024-05-12 10:56:15,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 148 flow [2024-05-12 10:56:15,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-05-12 10:56:15,935 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 80 flow [2024-05-12 10:56:15,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2024-05-12 10:56:15,940 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2024-05-12 10:56:15,940 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 80 flow [2024-05-12 10:56:15,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-05-12 10:56:15,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:15,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:15,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 10:56:15,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:15,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash -696140465, now seen corresponding path program 1 times [2024-05-12 10:56:15,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560247009] [2024-05-12 10:56:15,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:16,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560247009] [2024-05-12 10:56:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560247009] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:56:16,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:56:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 10:56:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131532179] [2024-05-12 10:56:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:16,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 10:56:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 10:56:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 10:56:16,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-05-12 10:56:16,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 80 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-05-12 10:56:16,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:16,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-05-12 10:56:16,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:16,243 INFO L124 PetriNetUnfolderBase]: 962/1447 cut-off events. [2024-05-12 10:56:16,244 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-05-12 10:56:16,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1447 events. 962/1447 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6564 event pairs, 136 based on Foata normal form. 1/1430 useless extension candidates. Maximal degree in co-relation 2776. Up to 1193 conditions per place. [2024-05-12 10:56:16,250 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 43 selfloop transitions, 4 changer transitions 1/55 dead transitions. [2024-05-12 10:56:16,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2024-05-12 10:56:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 10:56:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 10:56:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-05-12 10:56:16,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2024-05-12 10:56:16,256 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 80 flow. Second operand 3 states and 88 transitions. [2024-05-12 10:56:16,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2024-05-12 10:56:16,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:56:16,259 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 105 flow [2024-05-12 10:56:16,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-05-12 10:56:16,260 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2024-05-12 10:56:16,260 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 105 flow [2024-05-12 10:56:16,260 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-05-12 10:56:16,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:16,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 10:56:16,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:16,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1835759911, now seen corresponding path program 1 times [2024-05-12 10:56:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:16,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509737510] [2024-05-12 10:56:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:16,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509737510] [2024-05-12 10:56:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509737510] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:56:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:56:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:56:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844380411] [2024-05-12 10:56:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:16,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:56:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:56:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:56:16,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-05-12 10:56:16,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:16,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:16,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-05-12 10:56:16,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:16,705 INFO L124 PetriNetUnfolderBase]: 1762/2658 cut-off events. [2024-05-12 10:56:16,705 INFO L125 PetriNetUnfolderBase]: For 639/644 co-relation queries the response was YES. [2024-05-12 10:56:16,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5996 conditions, 2658 events. 1762/2658 cut-off events. For 639/644 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13910 event pairs, 921 based on Foata normal form. 0/2508 useless extension candidates. Maximal degree in co-relation 5988. Up to 1569 conditions per place. [2024-05-12 10:56:16,715 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 74 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-05-12 10:56:16,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 84 transitions, 383 flow [2024-05-12 10:56:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:56:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:56:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-05-12 10:56:16,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5953488372093023 [2024-05-12 10:56:16,716 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 105 flow. Second operand 5 states and 128 transitions. [2024-05-12 10:56:16,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 84 transitions, 383 flow [2024-05-12 10:56:16,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 84 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 10:56:16,718 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 137 flow [2024-05-12 10:56:16,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-05-12 10:56:16,719 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2024-05-12 10:56:16,719 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 137 flow [2024-05-12 10:56:16,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:16,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:16,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:16,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 10:56:16,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:16,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1679936174, now seen corresponding path program 1 times [2024-05-12 10:56:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989237700] [2024-05-12 10:56:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989237700] [2024-05-12 10:56:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989237700] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:56:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:56:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:56:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217279656] [2024-05-12 10:56:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:16,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:56:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:16,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:56:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:56:16,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-05-12 10:56:16,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:16,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:16,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-05-12 10:56:16,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:17,029 INFO L124 PetriNetUnfolderBase]: 1395/2128 cut-off events. [2024-05-12 10:56:17,029 INFO L125 PetriNetUnfolderBase]: For 787/1019 co-relation queries the response was YES. [2024-05-12 10:56:17,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 2128 events. 1395/2128 cut-off events. For 787/1019 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10603 event pairs, 778 based on Foata normal form. 55/2050 useless extension candidates. Maximal degree in co-relation 4961. Up to 1588 conditions per place. [2024-05-12 10:56:17,038 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 67 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-05-12 10:56:17,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 373 flow [2024-05-12 10:56:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:56:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:56:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-05-12 10:56:17,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5720930232558139 [2024-05-12 10:56:17,040 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 137 flow. Second operand 5 states and 123 transitions. [2024-05-12 10:56:17,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 373 flow [2024-05-12 10:56:17,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 369 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 10:56:17,042 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 158 flow [2024-05-12 10:56:17,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-05-12 10:56:17,043 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-05-12 10:56:17,043 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 158 flow [2024-05-12 10:56:17,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:17,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:17,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:17,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 10:56:17,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:17,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1244193695, now seen corresponding path program 1 times [2024-05-12 10:56:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210247289] [2024-05-12 10:56:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210247289] [2024-05-12 10:56:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210247289] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 10:56:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 10:56:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 10:56:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523367761] [2024-05-12 10:56:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:17,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:56:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:56:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 10:56:17,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-05-12 10:56:17,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:17,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:17,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-05-12 10:56:17,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:17,357 INFO L124 PetriNetUnfolderBase]: 1242/1792 cut-off events. [2024-05-12 10:56:17,358 INFO L125 PetriNetUnfolderBase]: For 862/1249 co-relation queries the response was YES. [2024-05-12 10:56:17,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 1792 events. 1242/1792 cut-off events. For 862/1249 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8108 event pairs, 736 based on Foata normal form. 53/1759 useless extension candidates. Maximal degree in co-relation 4551. Up to 1598 conditions per place. [2024-05-12 10:56:17,368 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 33 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2024-05-12 10:56:17,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 354 flow [2024-05-12 10:56:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:56:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:56:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-05-12 10:56:17,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5441860465116279 [2024-05-12 10:56:17,370 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 158 flow. Second operand 5 states and 117 transitions. [2024-05-12 10:56:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 354 flow [2024-05-12 10:56:17,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:56:17,374 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 131 flow [2024-05-12 10:56:17,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2024-05-12 10:56:17,375 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-05-12 10:56:17,375 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 131 flow [2024-05-12 10:56:17,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:17,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:17,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:17,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 10:56:17,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:17,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -119602370, now seen corresponding path program 1 times [2024-05-12 10:56:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:17,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490132620] [2024-05-12 10:56:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490132620] [2024-05-12 10:56:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490132620] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152568973] [2024-05-12 10:56:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:17,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:17,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:17,486 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-05-12 10:56:17,494 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-05-12 10:56:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:17,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 10:56:17,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:17,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152568973] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:17,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:17,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-05-12 10:56:17,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223900473] [2024-05-12 10:56:17,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-12 10:56:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-12 10:56:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-05-12 10:56:17,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-05-12 10:56:17,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 131 flow. Second operand has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 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-05-12 10:56:17,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:17,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-05-12 10:56:17,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:18,400 INFO L124 PetriNetUnfolderBase]: 2424/3416 cut-off events. [2024-05-12 10:56:18,400 INFO L125 PetriNetUnfolderBase]: For 1293/1667 co-relation queries the response was YES. [2024-05-12 10:56:18,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9056 conditions, 3416 events. 2424/3416 cut-off events. For 1293/1667 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 16206 event pairs, 468 based on Foata normal form. 0/3052 useless extension candidates. Maximal degree in co-relation 9039. Up to 1082 conditions per place. [2024-05-12 10:56:18,417 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 114 selfloop transitions, 17 changer transitions 0/134 dead transitions. [2024-05-12 10:56:18,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 134 transitions, 680 flow [2024-05-12 10:56:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 10:56:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 10:56:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2024-05-12 10:56:18,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608879492600423 [2024-05-12 10:56:18,420 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 131 flow. Second operand 11 states and 218 transitions. [2024-05-12 10:56:18,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 134 transitions, 680 flow [2024-05-12 10:56:18,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 134 transitions, 618 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-05-12 10:56:18,433 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 198 flow [2024-05-12 10:56:18,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2024-05-12 10:56:18,436 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-05-12 10:56:18,436 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 198 flow [2024-05-12 10:56:18,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.214285714285714) internal successors, (171), 14 states have internal predecessors, (171), 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-05-12 10:56:18,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:18,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:18,451 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-05-12 10:56:18,648 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,SelfDestructingSolverStorable5 [2024-05-12 10:56:18,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:18,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1419841350, now seen corresponding path program 2 times [2024-05-12 10:56:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141514655] [2024-05-12 10:56:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141514655] [2024-05-12 10:56:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141514655] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643449645] [2024-05-12 10:56:18,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 10:56:18,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:18,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:18,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:18,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-12 10:56:18,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 10:56:18,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:18,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 10:56:18,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:18,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:18,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643449645] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:18,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-12 10:56:18,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-05-12 10:56:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122185661] [2024-05-12 10:56:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:18,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 10:56:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 10:56:18,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-05-12 10:56:18,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-05-12 10:56:18,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 10:56:18,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:18,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-05-12 10:56:18,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:19,365 INFO L124 PetriNetUnfolderBase]: 3075/4328 cut-off events. [2024-05-12 10:56:19,366 INFO L125 PetriNetUnfolderBase]: For 2315/2315 co-relation queries the response was YES. [2024-05-12 10:56:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11784 conditions, 4328 events. 3075/4328 cut-off events. For 2315/2315 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20993 event pairs, 456 based on Foata normal form. 19/4344 useless extension candidates. Maximal degree in co-relation 11769. Up to 1170 conditions per place. [2024-05-12 10:56:19,384 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 101 selfloop transitions, 29 changer transitions 0/133 dead transitions. [2024-05-12 10:56:19,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 133 transitions, 734 flow [2024-05-12 10:56:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 10:56:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 10:56:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-05-12 10:56:19,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2024-05-12 10:56:19,385 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 198 flow. Second operand 9 states and 180 transitions. [2024-05-12 10:56:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 133 transitions, 734 flow [2024-05-12 10:56:19,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 10:56:19,393 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 408 flow [2024-05-12 10:56:19,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=408, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2024-05-12 10:56:19,393 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-05-12 10:56:19,393 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 408 flow [2024-05-12 10:56:19,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 10:56:19,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:19,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:19,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:19,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-05-12 10:56:19,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:19,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1224788950, now seen corresponding path program 3 times [2024-05-12 10:56:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:19,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996599956] [2024-05-12 10:56:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:19,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996599956] [2024-05-12 10:56:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996599956] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218218429] [2024-05-12 10:56:19,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 10:56:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:19,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:19,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-12 10:56:19,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-05-12 10:56:19,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:19,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 10:56:19,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:19,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218218429] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:19,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:19,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-05-12 10:56:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712323407] [2024-05-12 10:56:19,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:19,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 10:56:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:19,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 10:56:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-05-12 10:56:20,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-05-12 10:56:20,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 408 flow. Second operand has 15 states, 15 states have (on average 12.8) internal successors, (192), 15 states have internal predecessors, (192), 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-05-12 10:56:20,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:20,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-05-12 10:56:20,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:20,955 INFO L124 PetriNetUnfolderBase]: 4526/6328 cut-off events. [2024-05-12 10:56:20,955 INFO L125 PetriNetUnfolderBase]: For 10720/10720 co-relation queries the response was YES. [2024-05-12 10:56:20,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21709 conditions, 6328 events. 4526/6328 cut-off events. For 10720/10720 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 32380 event pairs, 771 based on Foata normal form. 23/6348 useless extension candidates. Maximal degree in co-relation 21688. Up to 1976 conditions per place. [2024-05-12 10:56:20,992 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 154 selfloop transitions, 62 changer transitions 0/219 dead transitions. [2024-05-12 10:56:20,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 219 transitions, 1486 flow [2024-05-12 10:56:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-12 10:56:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-05-12 10:56:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 288 transitions. [2024-05-12 10:56:20,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47840531561461797 [2024-05-12 10:56:20,994 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 408 flow. Second operand 14 states and 288 transitions. [2024-05-12 10:56:20,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 219 transitions, 1486 flow [2024-05-12 10:56:21,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 219 transitions, 1459 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-05-12 10:56:21,062 INFO L231 Difference]: Finished difference. Result has 85 places, 104 transitions, 901 flow [2024-05-12 10:56:21,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=901, PETRI_PLACES=85, PETRI_TRANSITIONS=104} [2024-05-12 10:56:21,065 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-05-12 10:56:21,065 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 901 flow [2024-05-12 10:56:21,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.8) internal successors, (192), 15 states have internal predecessors, (192), 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-05-12 10:56:21,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:21,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:21,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:21,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:21,276 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:21,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash 916116474, now seen corresponding path program 4 times [2024-05-12 10:56:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720256779] [2024-05-12 10:56:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720256779] [2024-05-12 10:56:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720256779] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272740663] [2024-05-12 10:56:21,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 10:56:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:21,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:21,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-12 10:56:21,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 10:56:21,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:21,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 10:56:21,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:21,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272740663] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:21,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-05-12 10:56:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648511602] [2024-05-12 10:56:21,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-12 10:56:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-12 10:56:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-05-12 10:56:21,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2024-05-12 10:56:21,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 901 flow. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 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-05-12 10:56:21,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:21,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2024-05-12 10:56:21,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:23,030 INFO L124 PetriNetUnfolderBase]: 6772/9557 cut-off events. [2024-05-12 10:56:23,030 INFO L125 PetriNetUnfolderBase]: For 31820/31820 co-relation queries the response was YES. [2024-05-12 10:56:23,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37958 conditions, 9557 events. 6772/9557 cut-off events. For 31820/31820 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 48166 event pairs, 452 based on Foata normal form. 32/9070 useless extension candidates. Maximal degree in co-relation 37930. Up to 1845 conditions per place. [2024-05-12 10:56:23,091 INFO L140 encePairwiseOnDemand]: 29/43 looper letters, 266 selfloop transitions, 163 changer transitions 0/430 dead transitions. [2024-05-12 10:56:23,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 430 transitions, 3732 flow [2024-05-12 10:56:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-12 10:56:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-05-12 10:56:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 472 transitions. [2024-05-12 10:56:23,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4221824686940966 [2024-05-12 10:56:23,094 INFO L175 Difference]: Start difference. First operand has 85 places, 104 transitions, 901 flow. Second operand 26 states and 472 transitions. [2024-05-12 10:56:23,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 430 transitions, 3732 flow [2024-05-12 10:56:23,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 430 transitions, 3557 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-05-12 10:56:23,347 INFO L231 Difference]: Finished difference. Result has 115 places, 215 transitions, 2326 flow [2024-05-12 10:56:23,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2326, PETRI_PLACES=115, PETRI_TRANSITIONS=215} [2024-05-12 10:56:23,348 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2024-05-12 10:56:23,348 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 215 transitions, 2326 flow [2024-05-12 10:56:23,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 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-05-12 10:56:23,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:23,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:23,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:23,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:23,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1756410042, now seen corresponding path program 5 times [2024-05-12 10:56:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749701148] [2024-05-12 10:56:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749701148] [2024-05-12 10:56:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749701148] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279508222] [2024-05-12 10:56:23,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 10:56:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:23,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:23,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-12 10:56:23,772 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 10:56:23,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:23,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 10:56:23,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:23,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279508222] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:23,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-05-12 10:56:23,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367524033] [2024-05-12 10:56:23,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:23,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 10:56:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 10:56:23,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-05-12 10:56:23,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2024-05-12 10:56:23,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 215 transitions, 2326 flow. Second operand has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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-05-12 10:56:23,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:23,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2024-05-12 10:56:23,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:25,477 INFO L124 PetriNetUnfolderBase]: 7506/10567 cut-off events. [2024-05-12 10:56:25,477 INFO L125 PetriNetUnfolderBase]: For 42562/42562 co-relation queries the response was YES. [2024-05-12 10:56:25,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46644 conditions, 10567 events. 7506/10567 cut-off events. For 42562/42562 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 53789 event pairs, 669 based on Foata normal form. 28/10595 useless extension candidates. Maximal degree in co-relation 46606. Up to 2060 conditions per place. [2024-05-12 10:56:25,541 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 245 selfloop transitions, 227 changer transitions 0/473 dead transitions. [2024-05-12 10:56:25,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 473 transitions, 4611 flow [2024-05-12 10:56:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-12 10:56:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-05-12 10:56:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 410 transitions. [2024-05-12 10:56:25,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334038054968288 [2024-05-12 10:56:25,543 INFO L175 Difference]: Start difference. First operand has 115 places, 215 transitions, 2326 flow. Second operand 22 states and 410 transitions. [2024-05-12 10:56:25,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 473 transitions, 4611 flow [2024-05-12 10:56:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 473 transitions, 4492 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-05-12 10:56:25,986 INFO L231 Difference]: Finished difference. Result has 138 places, 314 transitions, 3692 flow [2024-05-12 10:56:25,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3692, PETRI_PLACES=138, PETRI_TRANSITIONS=314} [2024-05-12 10:56:25,986 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 93 predicate places. [2024-05-12 10:56:25,986 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 314 transitions, 3692 flow [2024-05-12 10:56:25,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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-05-12 10:56:25,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:25,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:26,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:26,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-12 10:56:26,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:26,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash 209534384, now seen corresponding path program 6 times [2024-05-12 10:56:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816596913] [2024-05-12 10:56:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816596913] [2024-05-12 10:56:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816596913] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:26,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350713824] [2024-05-12 10:56:26,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 10:56:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:26,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:26,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-12 10:56:26,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-05-12 10:56:26,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:26,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-12 10:56:26,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:26,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:26,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350713824] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:26,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-12 10:56:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2024-05-12 10:56:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442053509] [2024-05-12 10:56:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:26,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 10:56:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 10:56:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-05-12 10:56:26,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-05-12 10:56:26,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 314 transitions, 3692 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 10:56:26,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:26,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-05-12 10:56:26,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:27,505 INFO L124 PetriNetUnfolderBase]: 5813/8277 cut-off events. [2024-05-12 10:56:27,505 INFO L125 PetriNetUnfolderBase]: For 48036/48036 co-relation queries the response was YES. [2024-05-12 10:56:27,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40383 conditions, 8277 events. 5813/8277 cut-off events. For 48036/48036 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 43205 event pairs, 476 based on Foata normal form. 22/8296 useless extension candidates. Maximal degree in co-relation 40340. Up to 2611 conditions per place. [2024-05-12 10:56:27,683 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 170 selfloop transitions, 150 changer transitions 0/361 dead transitions. [2024-05-12 10:56:27,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 361 transitions, 4477 flow [2024-05-12 10:56:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 10:56:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 10:56:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-05-12 10:56:27,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48255813953488375 [2024-05-12 10:56:27,684 INFO L175 Difference]: Start difference. First operand has 138 places, 314 transitions, 3692 flow. Second operand 8 states and 166 transitions. [2024-05-12 10:56:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 361 transitions, 4477 flow [2024-05-12 10:56:28,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 361 transitions, 4312 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-05-12 10:56:28,039 INFO L231 Difference]: Finished difference. Result has 141 places, 314 transitions, 3881 flow [2024-05-12 10:56:28,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3495, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3881, PETRI_PLACES=141, PETRI_TRANSITIONS=314} [2024-05-12 10:56:28,039 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-05-12 10:56:28,039 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 314 transitions, 3881 flow [2024-05-12 10:56:28,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 10:56:28,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:28,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:28,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:28,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:28,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:28,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1102899482, now seen corresponding path program 1 times [2024-05-12 10:56:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:28,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524669632] [2024-05-12 10:56:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524669632] [2024-05-12 10:56:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524669632] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830813043] [2024-05-12 10:56:28,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:28,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:28,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:28,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:28,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-12 10:56:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:28,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-12 10:56:28,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:28,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830813043] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-12 10:56:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-05-12 10:56:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022675384] [2024-05-12 10:56:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 10:56:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 10:56:28,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 10:56:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-12 10:56:28,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-05-12 10:56:28,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 314 transitions, 3881 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:28,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:28,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-05-12 10:56:28,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:29,480 INFO L124 PetriNetUnfolderBase]: 6553/9290 cut-off events. [2024-05-12 10:56:29,480 INFO L125 PetriNetUnfolderBase]: For 75814/77510 co-relation queries the response was YES. [2024-05-12 10:56:29,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46121 conditions, 9290 events. 6553/9290 cut-off events. For 75814/77510 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 52116 event pairs, 1519 based on Foata normal form. 856/9433 useless extension candidates. Maximal degree in co-relation 46079. Up to 4346 conditions per place. [2024-05-12 10:56:29,546 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 255 selfloop transitions, 43 changer transitions 0/387 dead transitions. [2024-05-12 10:56:29,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 387 transitions, 5459 flow [2024-05-12 10:56:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 10:56:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 10:56:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-05-12 10:56:29,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790697674418605 [2024-05-12 10:56:29,558 INFO L175 Difference]: Start difference. First operand has 141 places, 314 transitions, 3881 flow. Second operand 5 states and 103 transitions. [2024-05-12 10:56:29,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 387 transitions, 5459 flow [2024-05-12 10:56:29,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 387 transitions, 5317 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 10:56:29,855 INFO L231 Difference]: Finished difference. Result has 143 places, 315 transitions, 4020 flow [2024-05-12 10:56:29,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3769, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4020, PETRI_PLACES=143, PETRI_TRANSITIONS=315} [2024-05-12 10:56:29,856 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places. [2024-05-12 10:56:29,856 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 315 transitions, 4020 flow [2024-05-12 10:56:29,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-05-12 10:56:29,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:29,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:29,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:30,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:30,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1770244397, now seen corresponding path program 1 times [2024-05-12 10:56:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:30,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836099454] [2024-05-12 10:56:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:30,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836099454] [2024-05-12 10:56:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836099454] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272319182] [2024-05-12 10:56:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:30,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:30,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:30,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:30,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-12 10:56:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:30,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-12 10:56:30,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-12 10:56:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:30,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:30,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-12 10:56:30,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-05-12 10:56:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:30,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272319182] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:30,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:30,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 16 [2024-05-12 10:56:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140524625] [2024-05-12 10:56:30,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-12 10:56:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:30,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-12 10:56:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-05-12 10:56:30,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-05-12 10:56:30,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 315 transitions, 4020 flow. Second operand has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 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-05-12 10:56:30,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:30,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-05-12 10:56:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:31,986 INFO L124 PetriNetUnfolderBase]: 6864/10189 cut-off events. [2024-05-12 10:56:31,986 INFO L125 PetriNetUnfolderBase]: For 72806/73596 co-relation queries the response was YES. [2024-05-12 10:56:32,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52778 conditions, 10189 events. 6864/10189 cut-off events. For 72806/73596 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 59990 event pairs, 512 based on Foata normal form. 355/10365 useless extension candidates. Maximal degree in co-relation 52734. Up to 7259 conditions per place. [2024-05-12 10:56:32,076 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 414 selfloop transitions, 134 changer transitions 1/630 dead transitions. [2024-05-12 10:56:32,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 630 transitions, 8121 flow [2024-05-12 10:56:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-12 10:56:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-05-12 10:56:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 340 transitions. [2024-05-12 10:56:32,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2024-05-12 10:56:32,085 INFO L175 Difference]: Start difference. First operand has 143 places, 315 transitions, 4020 flow. Second operand 15 states and 340 transitions. [2024-05-12 10:56:32,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 630 transitions, 8121 flow [2024-05-12 10:56:32,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 630 transitions, 8053 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 10:56:32,636 INFO L231 Difference]: Finished difference. Result has 158 places, 440 transitions, 6054 flow [2024-05-12 10:56:32,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3976, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6054, PETRI_PLACES=158, PETRI_TRANSITIONS=440} [2024-05-12 10:56:32,636 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 113 predicate places. [2024-05-12 10:56:32,636 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 440 transitions, 6054 flow [2024-05-12 10:56:32,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.764705882352942) internal successors, (251), 17 states have internal predecessors, (251), 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-05-12 10:56:32,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:32,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:32,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-12 10:56:32,838 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:32,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2091261206, now seen corresponding path program 1 times [2024-05-12 10:56:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238562337] [2024-05-12 10:56:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:33,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238562337] [2024-05-12 10:56:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238562337] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847165510] [2024-05-12 10:56:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:33,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:33,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:33,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:33,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-12 10:56:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:33,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-12 10:56:33,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:33,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-12 10:56:33,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-12 10:56:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:33,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847165510] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:33,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:33,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2024-05-12 10:56:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647508446] [2024-05-12 10:56:33,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:33,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-12 10:56:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:33,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-12 10:56:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-05-12 10:56:34,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-05-12 10:56:34,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 440 transitions, 6054 flow. Second operand has 25 states, 25 states have (on average 11.4) internal successors, (285), 25 states have internal predecessors, (285), 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-05-12 10:56:34,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:34,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-05-12 10:56:34,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:38,072 INFO L124 PetriNetUnfolderBase]: 13807/19863 cut-off events. [2024-05-12 10:56:38,072 INFO L125 PetriNetUnfolderBase]: For 120544/120544 co-relation queries the response was YES. [2024-05-12 10:56:38,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105081 conditions, 19863 events. 13807/19863 cut-off events. For 120544/120544 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 117354 event pairs, 676 based on Foata normal form. 2/19865 useless extension candidates. Maximal degree in co-relation 105033. Up to 12390 conditions per place. [2024-05-12 10:56:38,219 INFO L140 encePairwiseOnDemand]: 28/43 looper letters, 1070 selfloop transitions, 350 changer transitions 2/1425 dead transitions. [2024-05-12 10:56:38,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 1425 transitions, 19301 flow [2024-05-12 10:56:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-12 10:56:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-05-12 10:56:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 736 transitions. [2024-05-12 10:56:38,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504283965728274 [2024-05-12 10:56:38,221 INFO L175 Difference]: Start difference. First operand has 158 places, 440 transitions, 6054 flow. Second operand 38 states and 736 transitions. [2024-05-12 10:56:38,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 1425 transitions, 19301 flow [2024-05-12 10:56:40,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1425 transitions, 19080 flow, removed 84 selfloop flow, removed 3 redundant places. [2024-05-12 10:56:40,064 INFO L231 Difference]: Finished difference. Result has 211 places, 769 transitions, 11173 flow [2024-05-12 10:56:40,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5996, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=11173, PETRI_PLACES=211, PETRI_TRANSITIONS=769} [2024-05-12 10:56:40,064 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 166 predicate places. [2024-05-12 10:56:40,065 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 769 transitions, 11173 flow [2024-05-12 10:56:40,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.4) internal successors, (285), 25 states have internal predecessors, (285), 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-05-12 10:56:40,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:40,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:40,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:40,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-12 10:56:40,266 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:40,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1949353526, now seen corresponding path program 2 times [2024-05-12 10:56:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469694321] [2024-05-12 10:56:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:40,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:40,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469694321] [2024-05-12 10:56:40,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469694321] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:40,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916749702] [2024-05-12 10:56:40,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 10:56:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:40,821 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:40,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-12 10:56:40,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 10:56:40,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:40,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-12 10:56:40,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:40,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-12 10:56:41,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-12 10:56:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:41,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:41,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-12 10:56:41,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-12 10:56:41,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-05-12 10:56:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:41,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916749702] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:41,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-05-12 10:56:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390367669] [2024-05-12 10:56:41,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:41,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-12 10:56:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-12 10:56:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-05-12 10:56:41,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2024-05-12 10:56:41,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 769 transitions, 11173 flow. Second operand has 23 states, 23 states have (on average 10.0) internal successors, (230), 23 states have internal predecessors, (230), 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-05-12 10:56:41,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:41,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2024-05-12 10:56:41,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:43,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L48-->L50: Formula: (let ((.cse0 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_1| 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_plus_#res#1_1| (+ v_~res1~0_64 (select (select |v_#memory_int#4_70| v_~A~0.base_106) (+ v_~A~0.offset_106 (* |v_thread1Thread1of1ForFork0_~i~0#1_7| 4))))) .cse0 (not (= (ite (or .cse0 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_1| v_~res1~0_64)) 1 0) 0)) (not (= (ite (or (<= v_~res1~0_64 |v_thread1Thread1of1ForFork0_plus_#res#1_1|) .cse1) 1 0) 0)) .cse1 (= |v_thread1Thread1of1ForFork0_plus_#res#1_1| v_~res1~0_63))) InVars {~res1~0=v_~res1~0_64, ~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, #memory_int#4=|v_#memory_int#4_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{~res1~0=v_~res1~0_63, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|, #memory_int#4=|v_#memory_int#4_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1][183], [Black: 1787#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2020#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2046#(and (= ~res2~0 ~res1~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))), Black: 2014#(and (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2026#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1854#(and (= ~res2~0 0) (= (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0) (= ~M~0 0)), Black: 2012#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2044#(and (= ~res2~0 ~res1~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0))), Black: 2028#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)))), Black: 1968#(or (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)), 1361#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0)), Black: 2018#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1149#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 2016#(and (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0)) (= ~M~0 0)), Black: 1786#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1132#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1155#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2002#(and (<= 0 ~M~0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1159#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 2038#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0))) (or (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0))), Black: 2034#(and (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 946#(<= 1 ~N~0), Black: 1143#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0)), 1139#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 1 ~M~0)), Black: 2000#(and (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~res1~0 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1373#(<= 1 ~N~0), 1557#true, Black: 281#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 138#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 279#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), 26#L89-5true, Black: 913#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 923#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 770#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 911#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 919#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 915#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 899#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 927#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 905#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 921#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 57#(and (<= 0 (+ ~N~0 2147483648)) (<= ~M~0 (+ 4294967295 ~N~0)) (<= 0 (+ ~N~0 ~M~0 2147483648)) (<= ~N~0 (+ 4294967295 ~M~0)) (<= (+ ~N~0 ~M~0) 4294967294)), 27#L50true, 684#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 497#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 575#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 686#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 688#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0)), Black: 496#(<= 1 ~N~0), 24#thread3EXITtrue, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1780#true, 897#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1363#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 7#L58true, 2066#true, Black: 292#(<= 1 ~N~0), Black: 479#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 483#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0)), Black: 481#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1769#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1560#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1565#(and (= ~res2~0 ~res1~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 1566#(= ~res2~0 ~res1~0), Black: 1784#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0))]) [2024-05-12 10:56:43,875 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-05-12 10:56:43,875 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 10:56:43,875 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-05-12 10:56:43,875 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-05-12 10:56:44,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L48-->L50: Formula: (let ((.cse0 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_1| 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_plus_#res#1_1| (+ v_~res1~0_64 (select (select |v_#memory_int#4_70| v_~A~0.base_106) (+ v_~A~0.offset_106 (* |v_thread1Thread1of1ForFork0_~i~0#1_7| 4))))) .cse0 (not (= (ite (or .cse0 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_1| v_~res1~0_64)) 1 0) 0)) (not (= (ite (or (<= v_~res1~0_64 |v_thread1Thread1of1ForFork0_plus_#res#1_1|) .cse1) 1 0) 0)) .cse1 (= |v_thread1Thread1of1ForFork0_plus_#res#1_1| v_~res1~0_63))) InVars {~res1~0=v_~res1~0_64, ~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, #memory_int#4=|v_#memory_int#4_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{~res1~0=v_~res1~0_63, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|, #memory_int#4=|v_#memory_int#4_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1][183], [Black: 1787#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2020#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2046#(and (= ~res2~0 ~res1~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))), Black: 2014#(and (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2026#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1854#(and (= ~res2~0 0) (= (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0) (= ~M~0 0)), Black: 2012#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2044#(and (= ~res2~0 ~res1~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0))), Black: 2028#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)))), Black: 1968#(or (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)), 1361#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0)), Black: 2018#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1149#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 2016#(and (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0)) (= ~M~0 0)), Black: 1786#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1132#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1155#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2002#(and (<= 0 ~M~0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1159#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 2038#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0))) (or (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0))), Black: 2034#(and (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 946#(<= 1 ~N~0), Black: 1143#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0)), Black: 2000#(and (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~res1~0 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1139#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 1 ~M~0)), Black: 1373#(<= 1 ~N~0), 1557#true, Black: 281#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 138#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 279#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 913#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 923#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 770#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 911#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 919#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 915#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 899#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 927#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 905#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 921#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 57#(and (<= 0 (+ ~N~0 2147483648)) (<= ~M~0 (+ 4294967295 ~N~0)) (<= 0 (+ ~N~0 ~M~0 2147483648)) (<= ~N~0 (+ 4294967295 ~M~0)) (<= (+ ~N~0 ~M~0) 4294967294)), 27#L50true, 684#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 497#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 575#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 686#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 688#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0)), Black: 496#(<= 1 ~N~0), 24#thread3EXITtrue, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1780#true, 897#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1363#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 7#L58true, 23#L90true, 2066#true, Black: 292#(<= 1 ~N~0), Black: 479#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 483#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0)), Black: 481#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1769#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1560#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1565#(and (= ~res2~0 ~res1~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 1566#(= ~res2~0 ~res1~0), Black: 1784#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0))]) [2024-05-12 10:56:44,299 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-05-12 10:56:44,299 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:56:44,299 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-05-12 10:56:44,299 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-05-12 10:56:44,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L48-->L50: Formula: (let ((.cse0 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_1| 2147483648)))) (and (= |v_thread1Thread1of1ForFork0_plus_#res#1_1| (+ v_~res1~0_64 (select (select |v_#memory_int#4_70| v_~A~0.base_106) (+ v_~A~0.offset_106 (* |v_thread1Thread1of1ForFork0_~i~0#1_7| 4))))) .cse0 (not (= (ite (or .cse0 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_1| v_~res1~0_64)) 1 0) 0)) (not (= (ite (or (<= v_~res1~0_64 |v_thread1Thread1of1ForFork0_plus_#res#1_1|) .cse1) 1 0) 0)) .cse1 (= |v_thread1Thread1of1ForFork0_plus_#res#1_1| v_~res1~0_63))) InVars {~res1~0=v_~res1~0_64, ~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, #memory_int#4=|v_#memory_int#4_70|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|} OutVars{~res1~0=v_~res1~0_63, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|, #memory_int#4=|v_#memory_int#4_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1][183], [Black: 1787#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2020#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2046#(and (= ~res2~0 ~res1~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))), Black: 2014#(and (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2026#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1854#(and (= ~res2~0 0) (= (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0) (= ~M~0 0)), Black: 2012#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 2044#(and (= ~res2~0 ~res1~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0))), Black: 2028#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)))), Black: 1968#(or (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)), 1361#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0)), Black: 2018#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1149#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 2016#(and (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0)) (= ~M~0 0)), Black: 1132#(and (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1786#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 1155#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2002#(and (<= 0 ~M~0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0)), Black: 1159#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 2038#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0))) (or (= (+ ~res2~0 (select (select |#memory_int#4| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#4| ~A~0.base) ~A~0.offset) ~res1~0)) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0))), Black: 2034#(and (<= 0 ~M~0) (= ~A~0.offset 0) (or (= (select (select |#memory_int#4| ~A~0.base) (* ~M~0 4)) (+ ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= ~N~0 1) (= ~res2~0 0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|) (= ~res1~0 (select (select |#memory_int#4| ~A~0.base) 0))), Black: 946#(<= 1 ~N~0), Black: 1143#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0)), Black: 2000#(and (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~res1~0 0) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 1139#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= 1 ~M~0)), Black: 1373#(<= 1 ~N~0), 1557#true, Black: 281#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 138#(and (<= 1 ~N~0) (<= ~M~0 0)), Black: 279#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= ~M~0 0)), Black: 913#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 923#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 770#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 911#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 919#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 915#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 899#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 927#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 905#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 921#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), 57#(and (<= 0 (+ ~N~0 2147483648)) (<= ~M~0 (+ 4294967295 ~N~0)) (<= 0 (+ ~N~0 ~M~0 2147483648)) (<= ~N~0 (+ 4294967295 ~M~0)) (<= (+ ~N~0 ~M~0) 4294967294)), 40#L90-2true, 27#L50true, 684#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 497#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), Black: 575#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)), Black: 686#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 688#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0)), Black: 496#(<= 1 ~N~0), 24#thread3EXITtrue, Black: 64#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1780#true, 897#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (<= 1 ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|)), Black: 1363#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 7#L58true, 2066#true, Black: 292#(<= 1 ~N~0), Black: 479#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 483#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~M~0)), Black: 481#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1769#(and (= ~A~0.offset 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1560#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0)), Black: 1565#(and (= ~res2~0 ~res1~0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 1566#(= ~res2~0 ~res1~0), Black: 1784#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0))]) [2024-05-12 10:56:44,532 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-05-12 10:56:44,532 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:56:44,532 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-05-12 10:56:44,532 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-05-12 10:56:45,265 INFO L124 PetriNetUnfolderBase]: 14390/20945 cut-off events. [2024-05-12 10:56:45,265 INFO L125 PetriNetUnfolderBase]: For 176023/176529 co-relation queries the response was YES. [2024-05-12 10:56:45,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121081 conditions, 20945 events. 14390/20945 cut-off events. For 176023/176529 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 129344 event pairs, 1445 based on Foata normal form. 273/20999 useless extension candidates. Maximal degree in co-relation 121015. Up to 17053 conditions per place. [2024-05-12 10:56:45,458 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 765 selfloop transitions, 126 changer transitions 1/1054 dead transitions. [2024-05-12 10:56:45,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1054 transitions, 16547 flow [2024-05-12 10:56:45,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 10:56:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 10:56:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2024-05-12 10:56:45,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127906976744186 [2024-05-12 10:56:45,459 INFO L175 Difference]: Start difference. First operand has 211 places, 769 transitions, 11173 flow. Second operand 12 states and 213 transitions. [2024-05-12 10:56:45,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1054 transitions, 16547 flow [2024-05-12 10:56:48,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1054 transitions, 16512 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-05-12 10:56:48,440 INFO L231 Difference]: Finished difference. Result has 226 places, 839 transitions, 12522 flow [2024-05-12 10:56:48,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=11138, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=769, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=12522, PETRI_PLACES=226, PETRI_TRANSITIONS=839} [2024-05-12 10:56:48,441 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 181 predicate places. [2024-05-12 10:56:48,441 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 839 transitions, 12522 flow [2024-05-12 10:56:48,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.0) internal successors, (230), 23 states have internal predecessors, (230), 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-05-12 10:56:48,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:56:48,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:56:48,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-12 10:56:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-12 10:56:48,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:56:48,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:56:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -843162190, now seen corresponding path program 3 times [2024-05-12 10:56:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:56:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812263800] [2024-05-12 10:56:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:56:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:56:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:56:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:56:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812263800] [2024-05-12 10:56:48,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812263800] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:56:48,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51313861] [2024-05-12 10:56:48,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 10:56:48,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:56:48,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:56:48,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:56:49,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-12 10:56:49,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-05-12 10:56:49,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:56:49,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 34 conjunts are in the unsatisfiable core [2024-05-12 10:56:49,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:56:49,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-12 10:56:49,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-12 10:56:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:56:49,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:56:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:56:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51313861] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:56:49,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:56:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2024-05-12 10:56:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840852311] [2024-05-12 10:56:49,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:56:49,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-12 10:56:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:56:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-12 10:56:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-05-12 10:56:49,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-05-12 10:56:49,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 839 transitions, 12522 flow. Second operand has 24 states, 24 states have (on average 11.083333333333334) internal successors, (266), 24 states have internal predecessors, (266), 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-05-12 10:56:49,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:56:49,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-05-12 10:56:49,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 10:56:59,227 INFO L124 PetriNetUnfolderBase]: 27341/39651 cut-off events. [2024-05-12 10:56:59,227 INFO L125 PetriNetUnfolderBase]: For 338790/338790 co-relation queries the response was YES. [2024-05-12 10:56:59,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235807 conditions, 39651 events. 27341/39651 cut-off events. For 338790/338790 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 262613 event pairs, 1332 based on Foata normal form. 2/39653 useless extension candidates. Maximal degree in co-relation 235734. Up to 24194 conditions per place. [2024-05-12 10:57:00,070 INFO L140 encePairwiseOnDemand]: 24/43 looper letters, 1299 selfloop transitions, 1327 changer transitions 2/2631 dead transitions. [2024-05-12 10:57:00,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 2631 transitions, 38852 flow [2024-05-12 10:57:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-05-12 10:57:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2024-05-12 10:57:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 1520 transitions. [2024-05-12 10:57:00,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42081949058693247 [2024-05-12 10:57:00,073 INFO L175 Difference]: Start difference. First operand has 226 places, 839 transitions, 12522 flow. Second operand 84 states and 1520 transitions. [2024-05-12 10:57:00,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 2631 transitions, 38852 flow [2024-05-12 10:57:11,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2631 transitions, 38577 flow, removed 115 selfloop flow, removed 3 redundant places. [2024-05-12 10:57:11,565 INFO L231 Difference]: Finished difference. Result has 350 places, 1922 transitions, 31485 flow [2024-05-12 10:57:11,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12389, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=31485, PETRI_PLACES=350, PETRI_TRANSITIONS=1922} [2024-05-12 10:57:11,566 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 305 predicate places. [2024-05-12 10:57:11,567 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 1922 transitions, 31485 flow [2024-05-12 10:57:11,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.083333333333334) internal successors, (266), 24 states have internal predecessors, (266), 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-05-12 10:57:11,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 10:57:11,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 10:57:11,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-12 10:57:11,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-12 10:57:11,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 10:57:11,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 10:57:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1460373366, now seen corresponding path program 4 times [2024-05-12 10:57:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 10:57:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198789821] [2024-05-12 10:57:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 10:57:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 10:57:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 10:57:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:57:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 10:57:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198789821] [2024-05-12 10:57:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198789821] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 10:57:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133217823] [2024-05-12 10:57:12,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 10:57:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 10:57:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 10:57:12,237 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 10:57:12,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-12 10:57:12,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 10:57:12,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 10:57:12,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-12 10:57:12,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 10:57:12,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-12 10:57:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-12 10:57:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 10:57:12,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 10:57:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-12 10:57:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133217823] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 10:57:12,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 10:57:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2024-05-12 10:57:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826181074] [2024-05-12 10:57:12,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 10:57:12,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-12 10:57:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 10:57:12,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-12 10:57:12,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2024-05-12 10:57:12,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-05-12 10:57:12,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 1922 transitions, 31485 flow. Second operand has 25 states, 25 states have (on average 10.96) internal successors, (274), 25 states have internal predecessors, (274), 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-05-12 10:57:12,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 10:57:12,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-05-12 10:57:12,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand