./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:56:36,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:56:36,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:56:36,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:56:36,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:56:36,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:56:36,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:56:36,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:56:36,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:56:36,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:56:36,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:56:36,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:56:36,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:56:36,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:56:36,693 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:56:36,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:56:36,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:56:36,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:56:36,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:56:36,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:56:36,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:56:36,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:56:36,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:56:36,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:56:36,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:56:36,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:56:36,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:56:36,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:56:36,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:56:36,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:56:36,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:56:36,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:56:36,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:56:36,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:56:36,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:56:36,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:56:36,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:56:36,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:56:36,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:56:36,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:56:36,701 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:56:36,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:56:36,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:56:36,701 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:56:36,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:56:36,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:56:36,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:56:36,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:56:36,983 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:56:36,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2024-02-20 11:56:38,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:56:38,332 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:56:38,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2024-02-20 11:56:38,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74c950b5/0469f80a65bf48908702d921484b1d34/FLAG74bc002e9 [2024-02-20 11:56:38,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74c950b5/0469f80a65bf48908702d921484b1d34 [2024-02-20 11:56:38,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:56:38,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:56:38,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:56:38,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:56:38,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:56:38,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0e4ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38, skipping insertion in model container [2024-02-20 11:56:38,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,396 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:56:38,575 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2024-02-20 11:56:38,586 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:56:38,603 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:56:38,630 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2024-02-20 11:56:38,631 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:56:38,645 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:56:38,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38 WrapperNode [2024-02-20 11:56:38,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:56:38,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:56:38,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:56:38,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:56:38,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,685 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2024-02-20 11:56:38,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:56:38,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:56:38,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:56:38,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:56:38,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,748 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-20 11:56:38,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:56:38,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:56:38,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:56:38,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:56:38,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (1/1) ... [2024-02-20 11:56:38,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:56:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:56:38,833 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-02-20 11:56:38,843 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-02-20 11:56:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:56:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:56:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:56:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:56:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:56:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 11:56:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 11:56:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:56:38,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:56:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:56:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:56:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:56:38,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:56:38,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:56:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:56:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:56:38,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:56:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:56:38,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:56:38,902 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:56:39,023 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:56:39,025 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:56:39,367 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:56:39,368 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:56:39,665 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:56:39,665 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-20 11:56:39,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:56:39 BoogieIcfgContainer [2024-02-20 11:56:39,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:56:39,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:56:39,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:56:39,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:56:39,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:56:38" (1/3) ... [2024-02-20 11:56:39,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495f3788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:56:39, skipping insertion in model container [2024-02-20 11:56:39,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:56:38" (2/3) ... [2024-02-20 11:56:39,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495f3788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:56:39, skipping insertion in model container [2024-02-20 11:56:39,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:56:39" (3/3) ... [2024-02-20 11:56:39,675 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2024-02-20 11:56:39,690 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:56:39,691 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:56:39,691 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:56:39,742 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 11:56:39,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 57 transitions, 135 flow [2024-02-20 11:56:39,842 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2024-02-20 11:56:39,842 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:56:39,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 0/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-20 11:56:39,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 57 transitions, 135 flow [2024-02-20 11:56:39,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 53 transitions, 124 flow [2024-02-20 11:56:39,860 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:56:39,866 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@580422a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:56:39,866 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 11:56:39,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:56:39,884 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2024-02-20 11:56:39,885 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:56:39,885 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:39,886 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:39,886 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:39,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash -325071026, now seen corresponding path program 1 times [2024-02-20 11:56:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014002194] [2024-02-20 11:56:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014002194] [2024-02-20 11:56:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014002194] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:56:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102036706] [2024-02-20 11:56:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:40,679 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:56:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:56:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:56:40,776 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 57 [2024-02-20 11:56:40,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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-02-20 11:56:40,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:40,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 57 [2024-02-20 11:56:40,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:42,080 INFO L124 PetriNetUnfolderBase]: 4870/8221 cut-off events. [2024-02-20 11:56:42,081 INFO L125 PetriNetUnfolderBase]: For 489/489 co-relation queries the response was YES. [2024-02-20 11:56:42,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16149 conditions, 8221 events. 4870/8221 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 56337 event pairs, 1571 based on Foata normal form. 1/8163 useless extension candidates. Maximal degree in co-relation 13606. Up to 2087 conditions per place. [2024-02-20 11:56:42,137 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 157 selfloop transitions, 15 changer transitions 25/213 dead transitions. [2024-02-20 11:56:42,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 213 transitions, 916 flow [2024-02-20 11:56:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:56:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:56:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 407 transitions. [2024-02-20 11:56:42,151 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-02-20 11:56:42,154 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2024-02-20 11:56:42,154 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 213 transitions, 916 flow [2024-02-20 11:56:42,155 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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-02-20 11:56:42,155 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:42,155 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:42,156 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:56:42,156 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:42,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -347156372, now seen corresponding path program 2 times [2024-02-20 11:56:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242327196] [2024-02-20 11:56:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242327196] [2024-02-20 11:56:42,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242327196] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:42,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:56:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105544820] [2024-02-20 11:56:42,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:42,956 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:56:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:56:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:56:43,017 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-02-20 11:56:43,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 213 transitions, 916 flow. Second operand has 10 states, 10 states have (on average 20.0) internal successors, (200), 10 states have internal predecessors, (200), 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-02-20 11:56:43,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:43,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-02-20 11:56:43,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:45,116 INFO L124 PetriNetUnfolderBase]: 13676/20926 cut-off events. [2024-02-20 11:56:45,117 INFO L125 PetriNetUnfolderBase]: For 7691/8035 co-relation queries the response was YES. [2024-02-20 11:56:45,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56245 conditions, 20926 events. 13676/20926 cut-off events. For 7691/8035 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 132818 event pairs, 1701 based on Foata normal form. 254/20646 useless extension candidates. Maximal degree in co-relation 53017. Up to 15016 conditions per place. [2024-02-20 11:56:45,273 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 304 selfloop transitions, 62 changer transitions 23/426 dead transitions. [2024-02-20 11:56:45,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 426 transitions, 2516 flow [2024-02-20 11:56:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:56:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:56:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 334 transitions. [2024-02-20 11:56:45,277 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.532695374800638 [2024-02-20 11:56:45,278 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 20 predicate places. [2024-02-20 11:56:45,278 INFO L507 AbstractCegarLoop]: Abstraction has has 83 places, 426 transitions, 2516 flow [2024-02-20 11:56:45,279 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.0) internal successors, (200), 10 states have internal predecessors, (200), 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-02-20 11:56:45,279 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:45,279 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:45,280 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:56:45,280 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:45,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash -9195812, now seen corresponding path program 3 times [2024-02-20 11:56:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:45,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963450718] [2024-02-20 11:56:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963450718] [2024-02-20 11:56:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963450718] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:56:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902628553] [2024-02-20 11:56:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:45,392 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:56:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:56:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:56:45,395 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-02-20 11:56:45,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 426 transitions, 2516 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-20 11:56:45,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:45,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-02-20 11:56:45,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:46,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][212], [thread2Thread1of1ForFork0InUse, 115#(= ~e2~0 1), 17#thread3EXITtrue, 34#L76true, thread3Thread1of1ForFork1InUse, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 7#L87true, 93#true]) [2024-02-20 11:56:46,546 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:46,546 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:46,547 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:46,547 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:47,327 INFO L124 PetriNetUnfolderBase]: 14880/22512 cut-off events. [2024-02-20 11:56:47,327 INFO L125 PetriNetUnfolderBase]: For 26475/27043 co-relation queries the response was YES. [2024-02-20 11:56:47,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75622 conditions, 22512 events. 14880/22512 cut-off events. For 26475/27043 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 141750 event pairs, 1809 based on Foata normal form. 439/22293 useless extension candidates. Maximal degree in co-relation 71401. Up to 16536 conditions per place. [2024-02-20 11:56:47,475 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 410 selfloop transitions, 2 changer transitions 23/509 dead transitions. [2024-02-20 11:56:47,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 509 transitions, 3918 flow [2024-02-20 11:56:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:56:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:56:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-02-20 11:56:47,477 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.695906432748538 [2024-02-20 11:56:47,478 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 22 predicate places. [2024-02-20 11:56:47,478 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 509 transitions, 3918 flow [2024-02-20 11:56:47,479 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-20 11:56:47,479 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:47,479 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:47,479 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:56:47,480 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:47,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1288052902, now seen corresponding path program 4 times [2024-02-20 11:56:47,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:47,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116214670] [2024-02-20 11:56:47,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:47,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:47,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116214670] [2024-02-20 11:56:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116214670] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:47,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:47,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:56:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952796765] [2024-02-20 11:56:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:47,558 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:56:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:56:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:56:47,560 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-02-20 11:56:47,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 509 transitions, 3918 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-20 11:56:47,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:47,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-02-20 11:56:47,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:48,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_1|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base][495], [thread2Thread1of1ForFork0InUse, 113#true, 51#L119true, thread3Thread1of1ForFork1InUse, 33#L191-1true, thread1Thread1of1ForFork2InUse, 47#L130true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 93#true, 118#(= ~e3~0 1), 10#thread1EXITtrue]) [2024-02-20 11:56:48,868 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,868 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,868 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,868 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][261], [thread2Thread1of1ForFork0InUse, 115#(= ~e2~0 1), 34#L76true, 17#thread3EXITtrue, 116#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 7#L87true, 93#true]) [2024-02-20 11:56:48,894 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:48,894 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:49,612 INFO L124 PetriNetUnfolderBase]: 16565/24895 cut-off events. [2024-02-20 11:56:49,613 INFO L125 PetriNetUnfolderBase]: For 61573/62232 co-relation queries the response was YES. [2024-02-20 11:56:49,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99865 conditions, 24895 events. 16565/24895 cut-off events. For 61573/62232 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 157337 event pairs, 1997 based on Foata normal form. 395/24507 useless extension candidates. Maximal degree in co-relation 94375. Up to 18399 conditions per place. [2024-02-20 11:56:49,797 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 517 selfloop transitions, 2 changer transitions 25/618 dead transitions. [2024-02-20 11:56:49,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 618 transitions, 5904 flow [2024-02-20 11:56:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:56:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:56:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-02-20 11:56:49,799 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.695906432748538 [2024-02-20 11:56:49,799 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 24 predicate places. [2024-02-20 11:56:49,799 INFO L507 AbstractCegarLoop]: Abstraction has has 87 places, 618 transitions, 5904 flow [2024-02-20 11:56:49,800 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-20 11:56:49,800 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:49,800 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:49,800 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:56:49,801 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:49,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash -457815330, now seen corresponding path program 5 times [2024-02-20 11:56:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233834328] [2024-02-20 11:56:49,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233834328] [2024-02-20 11:56:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233834328] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:56:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85816233] [2024-02-20 11:56:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:50,226 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:56:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:56:50,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:56:50,265 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-02-20 11:56:50,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 618 transitions, 5904 flow. Second operand has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 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-02-20 11:56:50,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:50,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-02-20 11:56:50,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:52,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_1|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base][808], [thread2Thread1of1ForFork0InUse, 51#L119true, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 47#L130true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 93#true, 118#(= ~e3~0 1), 119#true, 10#thread1EXITtrue]) [2024-02-20 11:56:52,101 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,101 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,101 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,101 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][378], [thread2Thread1of1ForFork0InUse, 116#true, 115#(= ~e2~0 1), 17#thread3EXITtrue, 34#L76true, thread3Thread1of1ForFork1InUse, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 7#L87true, 93#true, 119#true]) [2024-02-20 11:56:52,143 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,143 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,144 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:52,144 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:53,388 INFO L124 PetriNetUnfolderBase]: 19207/28904 cut-off events. [2024-02-20 11:56:53,389 INFO L125 PetriNetUnfolderBase]: For 97259/100917 co-relation queries the response was YES. [2024-02-20 11:56:53,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141092 conditions, 28904 events. 19207/28904 cut-off events. For 97259/100917 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 188249 event pairs, 2424 based on Foata normal form. 282/28347 useless extension candidates. Maximal degree in co-relation 134315. Up to 20544 conditions per place. [2024-02-20 11:56:53,776 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 820 selfloop transitions, 75 changer transitions 25/957 dead transitions. [2024-02-20 11:56:53,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 957 transitions, 10962 flow [2024-02-20 11:56:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:56:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:56:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 319 transitions. [2024-02-20 11:56:53,779 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2024-02-20 11:56:53,781 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 34 predicate places. [2024-02-20 11:56:53,781 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 957 transitions, 10962 flow [2024-02-20 11:56:53,782 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 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-02-20 11:56:53,782 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:53,788 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:53,788 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:56:53,789 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:53,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1311377690, now seen corresponding path program 6 times [2024-02-20 11:56:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319526933] [2024-02-20 11:56:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:53,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319526933] [2024-02-20 11:56:53,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319526933] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:56:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653461584] [2024-02-20 11:56:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:53,879 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:56:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:56:53,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:56:53,882 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-02-20 11:56:53,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 957 transitions, 10962 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-20 11:56:53,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:53,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-02-20 11:56:53,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:55,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_1|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base][965], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 47#L130true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#(= ~e3~0 1), 10#thread1EXITtrue, 119#true, 51#L119true, 93#true]) [2024-02-20 11:56:55,959 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:55,960 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:55,960 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:55,960 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:56,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][516], [thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 119#true, 17#thread3EXITtrue, 115#(= ~e2~0 1), 116#true, 34#L76true, 7#L87true, 93#true]) [2024-02-20 11:56:56,007 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:56:56,008 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:56,008 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:56,008 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:56:57,083 INFO L124 PetriNetUnfolderBase]: 20988/31533 cut-off events. [2024-02-20 11:56:57,084 INFO L125 PetriNetUnfolderBase]: For 173672/177558 co-relation queries the response was YES. [2024-02-20 11:56:57,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174031 conditions, 31533 events. 20988/31533 cut-off events. For 173672/177558 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 206832 event pairs, 2687 based on Foata normal form. 398/30910 useless extension candidates. Maximal degree in co-relation 172114. Up to 22360 conditions per place. [2024-02-20 11:56:57,301 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 985 selfloop transitions, 2 changer transitions 25/1119 dead transitions. [2024-02-20 11:56:57,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1119 transitions, 14974 flow [2024-02-20 11:56:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:56:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:56:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-02-20 11:56:57,303 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.695906432748538 [2024-02-20 11:56:57,304 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2024-02-20 11:56:57,304 INFO L507 AbstractCegarLoop]: Abstraction has has 99 places, 1119 transitions, 14974 flow [2024-02-20 11:56:57,304 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-20 11:56:57,304 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:56:57,304 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:56:57,305 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:56:57,305 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:56:57,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:56:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -97425234, now seen corresponding path program 7 times [2024-02-20 11:56:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:56:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578209767] [2024-02-20 11:56:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:56:57,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:56:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:56:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:56:57,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:56:57,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578209767] [2024-02-20 11:56:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578209767] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:56:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:56:57,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:56:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269834247] [2024-02-20 11:56:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:56:57,765 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:56:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:56:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:56:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:56:57,793 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 57 [2024-02-20 11:56:57,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 1119 transitions, 14974 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-02-20 11:56:57,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:56:57,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 57 [2024-02-20 11:56:57,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:56:58,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L142-->L146: Formula: (not (= (ite (= 0 (mod v_~e1~0_64 256)) 1 0) 0)) InVars {~e1~0=v_~e1~0_64} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_64} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][255], [thread2Thread1of1ForFork0InUse, 72#(= ~i~0 0), thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 16#L93true, 119#true, 115#(= ~e2~0 1), 116#true, 135#true, 13#L146true, 11#L56true, 93#true]) [2024-02-20 11:56:58,722 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-20 11:56:58,722 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-20 11:56:58,722 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-20 11:56:58,723 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-20 11:56:58,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L93-->L96: Formula: (= v_~n2~0_27 (+ v_~n2~0_28 1)) InVars {~n2~0=v_~n2~0_28} OutVars{~n2~0=v_~n2~0_27, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_1|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork0_#t~post2#1][253], [thread2Thread1of1ForFork0InUse, 72#(= ~i~0 0), thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 59#L142true, 43#L96true, 119#true, 116#true, 115#(= ~e2~0 1), 135#true, 11#L56true, 93#true]) [2024-02-20 11:56:58,833 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-02-20 11:56:58,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-02-20 11:56:58,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-02-20 11:56:58,833 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-02-20 11:56:59,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][627], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 47#L130true, 134#(= ~e1~0 1), 118#(= ~e3~0 1), 54#L53true, 119#true, 51#L119true, 135#true, 93#true]) [2024-02-20 11:56:59,160 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-20 11:56:59,160 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:56:59,160 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:56:59,160 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:56:59,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][465], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 59#L142true, 70#true, 134#(= ~e1~0 1), 54#L53true, 119#true, 51#L119true, 116#true, 135#true, 93#true]) [2024-02-20 11:56:59,875 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-02-20 11:56:59,875 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:56:59,876 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:56:59,876 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:02,008 INFO L124 PetriNetUnfolderBase]: 22475/34032 cut-off events. [2024-02-20 11:57:02,008 INFO L125 PetriNetUnfolderBase]: For 236554/241471 co-relation queries the response was YES. [2024-02-20 11:57:02,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213401 conditions, 34032 events. 22475/34032 cut-off events. For 236554/241471 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 226447 event pairs, 2618 based on Foata normal form. 339/33678 useless extension candidates. Maximal degree in co-relation 211234. Up to 24025 conditions per place. [2024-02-20 11:57:02,396 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 1206 selfloop transitions, 39 changer transitions 17/1325 dead transitions. [2024-02-20 11:57:02,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 1325 transitions, 20325 flow [2024-02-20 11:57:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:57:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:57:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-02-20 11:57:02,398 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2024-02-20 11:57:02,398 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 41 predicate places. [2024-02-20 11:57:02,398 INFO L507 AbstractCegarLoop]: Abstraction has has 104 places, 1325 transitions, 20325 flow [2024-02-20 11:57:02,399 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-02-20 11:57:02,399 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:57:02,399 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:57:02,399 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:57:02,399 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:57:02,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:57:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1770104150, now seen corresponding path program 8 times [2024-02-20 11:57:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:57:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763562259] [2024-02-20 11:57:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:57:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:57:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:57:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:57:02,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:57:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763562259] [2024-02-20 11:57:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763562259] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:57:02,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:57:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:57:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547572990] [2024-02-20 11:57:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:57:02,842 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:57:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:57:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:57:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:57:02,905 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-20 11:57:02,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 1325 transitions, 20325 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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-02-20 11:57:02,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:57:02,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-20 11:57:02,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:57:04,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][671], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 47#L130true, 134#(= ~e1~0 1), 118#(= ~e3~0 1), 54#L53true, 119#true, 51#L119true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:04,946 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-20 11:57:04,946 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:04,946 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:04,946 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:06,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][480], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 33#L191-1true, thread1Thread1of1ForFork2InUse, 59#L142true, 70#true, 134#(= ~e1~0 1), 54#L53true, 119#true, 51#L119true, 116#true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:06,334 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-02-20 11:57:06,334 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:06,334 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:06,334 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:07,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][1239], [thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 119#true, 17#thread3EXITtrue, 116#true, 115#(= ~e2~0 1), 34#L76true, 143#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 135#true, 7#L87true, 93#true]) [2024-02-20 11:57:07,809 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:07,809 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:07,809 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:07,810 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:10,407 INFO L124 PetriNetUnfolderBase]: 31901/48247 cut-off events. [2024-02-20 11:57:10,407 INFO L125 PetriNetUnfolderBase]: For 417722/429639 co-relation queries the response was YES. [2024-02-20 11:57:10,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346754 conditions, 48247 events. 31901/48247 cut-off events. For 417722/429639 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 338130 event pairs, 3603 based on Foata normal form. 440/47592 useless extension candidates. Maximal degree in co-relation 344321. Up to 35499 conditions per place. [2024-02-20 11:57:10,770 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 1755 selfloop transitions, 201 changer transitions 287/2299 dead transitions. [2024-02-20 11:57:10,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 2299 transitions, 40318 flow [2024-02-20 11:57:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-20 11:57:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-20 11:57:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 588 transitions. [2024-02-20 11:57:10,773 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5730994152046783 [2024-02-20 11:57:10,773 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2024-02-20 11:57:10,773 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 2299 transitions, 40318 flow [2024-02-20 11:57:10,774 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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-02-20 11:57:10,774 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:57:10,774 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:57:10,774 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:57:10,774 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:57:10,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:57:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1741548894, now seen corresponding path program 9 times [2024-02-20 11:57:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:57:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723423816] [2024-02-20 11:57:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:57:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:57:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:57:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:57:11,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:57:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723423816] [2024-02-20 11:57:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723423816] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:57:11,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:57:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:57:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447253451] [2024-02-20 11:57:11,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:57:11,188 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:57:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:57:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:57:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:57:11,232 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-20 11:57:11,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 2299 transitions, 40318 flow. Second operand has 11 states, 11 states have (on average 20.545454545454547) internal successors, (226), 11 states have internal predecessors, (226), 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-02-20 11:57:11,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:57:11,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-20 11:57:11,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:57:14,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][946], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 47#L130true, 134#(= ~e1~0 1), 118#(= ~e3~0 1), 54#L53true, 167#true, 119#true, 51#L119true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:14,276 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-20 11:57:14,276 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:14,276 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:14,276 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:15,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L122-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][666], [thread2Thread1of1ForFork0InUse, 30#L44true, 113#true, thread3Thread1of1ForFork1InUse, 42#thread2EXITtrue, thread1Thread1of1ForFork2InUse, 59#L142true, 70#true, 134#(= ~e1~0 1), 167#true, 119#true, 116#true, 141#true, 28#L190-4true, 135#true, 93#true]) [2024-02-20 11:57:15,807 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-02-20 11:57:15,807 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-20 11:57:15,807 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-20 11:57:15,807 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-02-20 11:57:16,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([518] L190-4-->L191-1: Formula: (= |v_ULTIMATE.start_main_#t~mem20#1_27| (select (select |v_#memory_int#2_8| |v_ULTIMATE.start_main_~#t1~0#1.base_58|) |v_ULTIMATE.start_main_~#t1~0#1.offset_44|)) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_58|, #memory_int#2=|v_#memory_int#2_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_44|} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_27|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_34|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_26|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_58|, #memory_int#2=|v_#memory_int#2_8|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_44|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1][958], [thread2Thread1of1ForFork0InUse, 30#L44true, 113#true, thread3Thread1of1ForFork1InUse, 26#L122true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 59#L142true, 70#true, 134#(= ~e1~0 1), 167#true, 119#true, 116#true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:16,288 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2024-02-20 11:57:16,289 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-02-20 11:57:16,289 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-02-20 11:57:16,289 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-02-20 11:57:16,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L122-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][666], [thread2Thread1of1ForFork0InUse, 113#true, 30#L44true, thread3Thread1of1ForFork1InUse, 42#thread2EXITtrue, thread1Thread1of1ForFork2InUse, 33#L191-1true, 59#L142true, 70#true, 134#(= ~e1~0 1), 167#true, 119#true, 116#true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:16,359 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-02-20 11:57:16,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-20 11:57:16,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-20 11:57:16,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-02-20 11:57:20,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_1|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base][2634], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 47#L130true, 118#(= ~e3~0 1), 167#true, 10#thread1EXITtrue, 119#true, 51#L119true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:20,109 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,109 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,110 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,110 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][1833], [thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 167#true, 119#true, 17#thread3EXITtrue, 116#true, 34#L76true, 115#(= ~e2~0 1), 141#true, 135#true, 7#L87true, 93#true]) [2024-02-20 11:57:20,321 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,321 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,321 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:20,321 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:26,630 INFO L124 PetriNetUnfolderBase]: 49345/74081 cut-off events. [2024-02-20 11:57:26,630 INFO L125 PetriNetUnfolderBase]: For 819309/843754 co-relation queries the response was YES. [2024-02-20 11:57:26,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592579 conditions, 74081 events. 49345/74081 cut-off events. For 819309/843754 co-relation queries the response was YES. Maximal size of possible extension queue 1685. Compared 542825 event pairs, 4912 based on Foata normal form. 916/73629 useless extension candidates. Maximal degree in co-relation 589880. Up to 56030 conditions per place. [2024-02-20 11:57:27,251 INFO L140 encePairwiseOnDemand]: 41/57 looper letters, 2806 selfloop transitions, 237 changer transitions 481/3570 dead transitions. [2024-02-20 11:57:27,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 3570 transitions, 69767 flow [2024-02-20 11:57:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:57:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:57:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 571 transitions. [2024-02-20 11:57:27,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5892672858617131 [2024-02-20 11:57:27,254 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, 74 predicate places. [2024-02-20 11:57:27,254 INFO L507 AbstractCegarLoop]: Abstraction has has 137 places, 3570 transitions, 69767 flow [2024-02-20 11:57:27,255 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.545454545454547) internal successors, (226), 11 states have internal predecessors, (226), 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-02-20 11:57:27,255 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:57:27,255 INFO L234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:57:27,255 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:57:27,255 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:57:27,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:57:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -251331868, now seen corresponding path program 10 times [2024-02-20 11:57:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:57:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265807991] [2024-02-20 11:57:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:57:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:57:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:57:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:57:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:57:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265807991] [2024-02-20 11:57:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265807991] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:57:27,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:57:27,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:57:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279465821] [2024-02-20 11:57:27,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:57:27,984 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:57:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:57:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:57:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:57:28,024 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-02-20 11:57:28,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 3570 transitions, 69767 flow. Second operand has 10 states, 10 states have (on average 20.9) internal successors, (209), 10 states have internal predecessors, (209), 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-02-20 11:57:28,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:57:28,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-02-20 11:57:28,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:57:33,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][1195], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 47#L130true, 134#(= ~e1~0 1), 118#(= ~e3~0 1), 54#L53true, 167#true, 197#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), 119#true, 51#L119true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:33,840 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-20 11:57:33,840 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:33,840 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:33,840 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-20 11:57:39,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2555], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 11#L56true, 93#true]) [2024-02-20 11:57:39,428 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-02-20 11:57:39,428 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:39,428 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:39,428 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-02-20 11:57:40,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] L56-->L60: Formula: (not (= (ite (= (mod v_~e2~0_60 256) 0) 1 0) 0)) InVars {~e2~0=v_~e2~0_60} OutVars{thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e2~0=v_~e2~0_60, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][2263], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 70#true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 141#true, 135#true, 198#(and (<= 1 ~n2~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 93#true, 23#L60true]) [2024-02-20 11:57:40,938 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-02-20 11:57:40,938 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-02-20 11:57:40,939 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-02-20 11:57:40,939 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-02-20 11:57:46,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2353], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 12#L116true, 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:46,628 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,628 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,628 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,628 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3491], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 84#(and (= ~i1~0 0) (= ~i2~0 1) (= ~i~0 1)), 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 12#L116true, 135#true, 93#true]) [2024-02-20 11:57:46,653 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,653 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,653 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,653 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([560] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_1|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base][3839], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 47#L130true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 192#true, 118#(= ~e3~0 1), 167#true, 119#true, 10#thread1EXITtrue, 51#L119true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:46,664 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,664 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,664 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,664 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3498], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 20#L73true, 33#L191-1true, 73#(= ~i1~0 0), 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:46,673 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,673 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,673 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,673 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2358], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 20#L73true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:46,693 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,693 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,693 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,693 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L122-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][2374], [thread2Thread1of1ForFork0InUse, 113#true, 42#thread2EXITtrue, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 47#L130true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 143#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 195#(and (<= ~n3~0 ~n1~0) (<= 0 ~n2~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:46,701 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,701 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,701 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:46,701 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L165-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][2544], [thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 192#true, 167#true, 119#true, 116#true, 115#(= ~e2~0 1), 17#thread3EXITtrue, 34#L76true, 143#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 7#L87true, 135#true, 93#true]) [2024-02-20 11:57:47,136 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,136 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,136 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,136 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2503], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 172#(and (<= 0 ~n1~0) (<= ~n1~0 ~n2~0)), 33#L191-1true, 62#L139true, 118#(= ~e3~0 1), 119#true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 12#L116true, 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:47,253 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,254 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,254 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,254 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3684], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 172#(and (<= 0 ~n1~0) (<= ~n1~0 ~n2~0)), 84#(and (= ~i1~0 0) (= ~i2~0 1) (= ~i~0 1)), 62#L139true, 118#(= ~e3~0 1), 119#true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 12#L116true, 135#true, 93#true]) [2024-02-20 11:57:47,267 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,267 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,267 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,267 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3968], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 20#L73true, thread1Thread1of1ForFork2InUse, 172#(and (<= 0 ~n1~0) (<= ~n1~0 ~n2~0)), 33#L191-1true, 73#(= ~i1~0 0), 62#L139true, 118#(= ~e3~0 1), 119#true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:47,275 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,275 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,275 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,275 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L122-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][1230], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 42#thread2EXITtrue, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 47#L130true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 141#true, 195#(and (<= ~n3~0 ~n1~0) (<= 0 ~n2~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:47,288 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,288 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,288 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:47,288 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-02-20 11:57:48,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L76-->L79: Formula: (= v_~n1~0_9 0) InVars {} OutVars{~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[~n1~0][2350], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 6#L79true, 118#(= ~e3~0 1), 167#true, 119#true, 141#true, 199#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 12#L116true, 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:48,048 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,048 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,048 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,048 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L119-->L122: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0][2359], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 26#L122true, 132#true, 33#L191-1true, 20#L73true, thread1Thread1of1ForFork2InUse, 73#(= ~i1~0 0), 3#L136true, 192#true, 118#(= ~e3~0 1), 167#true, 119#true, 143#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:48,081 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,081 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,081 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,081 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3498], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 73#(= ~i1~0 0), 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:48,283 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,283 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,283 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,283 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3834], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:48,302 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,303 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,303 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,303 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2353], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:48,316 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,316 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,316 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,316 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2358], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 62#L139true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:48,330 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,330 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,330 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,331 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L76-->L79: Formula: (= v_~n1~0_9 0) InVars {} OutVars{~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[~n1~0][2501], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 6#L79true, 118#(= ~e3~0 1), 119#true, 171#(and (<= 0 ~n1~0) (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 141#true, 199#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 12#L116true, 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:48,794 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,794 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,794 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,794 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L119-->L122: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0][2496], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 26#L122true, 132#true, 33#L191-1true, 20#L73true, thread1Thread1of1ForFork2InUse, 73#(= ~i1~0 0), 3#L136true, 118#(= ~e3~0 1), 167#true, 119#true, 141#true, 195#(and (<= ~n3~0 ~n1~0) (<= 0 ~n2~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:48,812 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,812 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,812 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,812 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-02-20 11:57:48,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3968], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 172#(and (<= 0 ~n1~0) (<= ~n1~0 ~n2~0)), thread1Thread1of1ForFork2InUse, 33#L191-1true, 73#(= ~i1~0 0), 62#L139true, 118#(= ~e3~0 1), 119#true, 34#L76true, 51#L119true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:48,883 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,883 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,883 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,883 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][3989], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, thread1Thread1of1ForFork2InUse, 172#(and (<= 0 ~n1~0) (<= ~n1~0 ~n2~0)), 33#L191-1true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 62#L139true, 118#(= ~e3~0 1), 119#true, 51#L119true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:48,898 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,898 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,898 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,898 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([577] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][2503], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 172#(and (<= 0 ~n1~0) (<= ~n1~0 ~n2~0)), thread1Thread1of1ForFork2InUse, 33#L191-1true, 62#L139true, 118#(= ~e3~0 1), 119#true, 51#L119true, 34#L76true, 200#(and (<= 2 ~n3~0) (<= 1 ~n2~0)), 141#true, 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:48,904 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,904 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,905 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:48,905 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L50-->L53: Formula: (= v_~n1~0_21 (+ v_~n1~0_22 1)) InVars {~n1~0=v_~n1~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_1|, ~n1~0=v_~n1~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1#1, ~n1~0][2592], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 134#(= ~e1~0 1), 54#L53true, 219#(and (<= 2 ~n3~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n2~0 ~n1~0)), 52#L162true, 167#true, 119#true, 51#L119true, 116#true, 141#true, 135#true, 93#true]) [2024-02-20 11:57:49,433 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([585] L162-->L165: Formula: (= v_~n3~0_7 0) InVars {} OutVars{~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][2595], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, 33#L191-1true, 70#true, 134#(= ~e1~0 1), 36#L50true, 197#(and (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), 119#true, 51#L119true, 116#true, 141#true, 31#L165true, 135#true, 169#(and (<= 0 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), 93#true]) [2024-02-20 11:57:49,433 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-02-20 11:57:49,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L119-->L122: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0][2359], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 26#L122true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 73#(= ~i1~0 0), 3#L136true, 192#true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 143#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:49,643 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,643 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,643 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,644 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L119-->L122: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0][2359], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 26#L122true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 192#true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 143#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:49,667 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,667 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,667 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,667 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L76-->L79: Formula: (= v_~n1~0_9 0) InVars {} OutVars{~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[~n1~0][2350], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 6#L79true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 141#true, 199#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:49,677 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,677 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,677 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,677 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L76-->L79: Formula: (= v_~n1~0_9 0) InVars {} OutVars{~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[~n1~0][2350], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 70#true, 3#L136true, 6#L79true, 118#(= ~e3~0 1), 167#true, 119#true, 51#L119true, 141#true, 199#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 135#true, 93#true]) [2024-02-20 11:57:49,686 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,686 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,686 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:49,686 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L119-->L122: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0][2496], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 26#L122true, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 73#(= ~i1~0 0), 3#L136true, 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 195#(and (<= ~n3~0 ~n1~0) (<= 0 ~n2~0) (<= ~n2~0 ~n1~0)), 141#true, 135#true, 93#true]) [2024-02-20 11:57:50,348 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,348 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,348 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,349 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L119-->L122: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0][2496], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 26#L122true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 86#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), 118#(= ~e3~0 1), 167#true, 119#true, 34#L76true, 141#true, 195#(and (<= ~n3~0 ~n1~0) (<= 0 ~n2~0) (<= ~n2~0 ~n1~0)), 135#true, 93#true]) [2024-02-20 11:57:50,361 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,361 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L76-->L79: Formula: (= v_~n1~0_9 0) InVars {} OutVars{~n1~0=v_~n1~0_9} AuxVars[] AssignedVars[~n1~0][2501], [thread2Thread1of1ForFork0InUse, 113#true, thread3Thread1of1ForFork1InUse, 132#true, 33#L191-1true, thread1Thread1of1ForFork2InUse, 3#L136true, 6#L79true, 118#(= ~e3~0 1), 119#true, 171#(and (<= 0 ~n1~0) (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 51#L119true, 141#true, 199#(and (<= 1 ~n2~0) (<= 1 ~n3~0)), 135#true, 93#true, 82#(and (= ~i1~0 0) (= ~i~0 1))]) [2024-02-20 11:57:50,371 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,371 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,372 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-02-20 11:57:50,372 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event