./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/popl20-counter-determinism.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 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:50:25,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:50:25,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:50:25,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:50:25,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:50:25,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:50:25,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:50:25,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:50:25,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:50:25,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:50:25,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:50:25,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:50:25,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:50:25,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:50:25,853 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:50:25,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:50:25,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:50:25,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:50:25,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:50:25,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:50:25,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:50:25,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:50:25,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:50:25,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:50:25,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:50:25,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:50:25,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:50:25,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:50:25,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:50:25,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:50:25,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:50:25,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:50:25,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:50:25,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:50:25,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:50:25,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:50:25,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:50:25,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:50:25,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:50:25,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:50:25,860 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:50:25,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:50:25,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:50:25,860 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 -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:50:26,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:50:26,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:50:26,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:50:26,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:50:26,124 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:50:26,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2024-02-19 14:50:27,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:50:27,488 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:50:27,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2024-02-19 14:50:27,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c1a18a2/15e855cd5dad43eca82b392dda6b47c8/FLAG698ce75af [2024-02-19 14:50:27,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c1a18a2/15e855cd5dad43eca82b392dda6b47c8 [2024-02-19 14:50:27,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:50:27,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:50:27,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:50:27,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:50:27,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:50:27,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb8be4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27, skipping insertion in model container [2024-02-19 14:50:27,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,538 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:50:27,691 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/popl20-counter-determinism.wvr.c[2476,2489] [2024-02-19 14:50:27,699 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:50:27,709 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:50:27,741 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/popl20-counter-determinism.wvr.c[2476,2489] [2024-02-19 14:50:27,744 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:50:27,758 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:50:27,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27 WrapperNode [2024-02-19 14:50:27,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:50:27,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:50:27,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:50:27,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:50:27,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,812 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2024-02-19 14:50:27,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:50:27,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:50:27,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:50:27,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:50:27,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,860 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 14:50:27,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:50:27,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:50:27,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:50:27,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:50:27,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (1/1) ... [2024-02-19 14:50:27,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:50:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:50:27,938 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-19 14:50:27,954 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-19 14:50:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:50:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:50:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:50:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:50:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:50:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:50:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:50:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-19 14:50:27,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-19 14:50:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:50:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:50:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:50:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:50:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:50:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:50:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:50:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:50:27,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:50:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:50:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:50:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:50:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:50:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:50:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:50:28,000 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:50:28,172 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:50:28,173 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:50:28,374 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:50:28,382 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:50:28,514 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:50:28,521 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 14:50:28,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:50:28 BoogieIcfgContainer [2024-02-19 14:50:28,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:50:28,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:50:28,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:50:28,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:50:28,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:50:27" (1/3) ... [2024-02-19 14:50:28,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163ae0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:50:28, skipping insertion in model container [2024-02-19 14:50:28,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:50:27" (2/3) ... [2024-02-19 14:50:28,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163ae0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:50:28, skipping insertion in model container [2024-02-19 14:50:28,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:50:28" (3/3) ... [2024-02-19 14:50:28,530 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2024-02-19 14:50:28,545 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:50:28,545 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:50:28,549 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:50:28,619 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-19 14:50:28,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 114 flow [2024-02-19 14:50:28,696 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2024-02-19 14:50:28,696 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:50:28,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 4/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-02-19 14:50:28,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 114 flow [2024-02-19 14:50:28,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 100 flow [2024-02-19 14:50:28,717 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:50:28,724 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;@3f03c1f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:50:28,725 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:50:28,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:50:28,744 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-02-19 14:50:28,744 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:50:28,744 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:28,745 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] [2024-02-19 14:50:28,745 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 2 more)] === [2024-02-19 14:50:28,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1382262537, now seen corresponding path program 1 times [2024-02-19 14:50:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:28,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563594262] [2024-02-19 14:50:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:29,108 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-19 14:50:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563594262] [2024-02-19 14:50:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563594262] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:50:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571698505] [2024-02-19 14:50:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:29,120 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:50:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:29,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:50:29,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:50:29,158 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:50:29,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:29,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:29,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:50:29,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:29,613 INFO L124 PetriNetUnfolderBase]: 3654/5032 cut-off events. [2024-02-19 14:50:29,613 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-02-19 14:50:29,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9916 conditions, 5032 events. 3654/5032 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 24117 event pairs, 589 based on Foata normal form. 1/5012 useless extension candidates. Maximal degree in co-relation 8059. Up to 4380 conditions per place. [2024-02-19 14:50:29,658 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 45 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-02-19 14:50:29,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 267 flow [2024-02-19 14:50:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:50:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:50:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-02-19 14:50:29,670 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2024-02-19 14:50:29,673 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-02-19 14:50:29,674 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 60 transitions, 267 flow [2024-02-19 14:50:29,674 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:29,675 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:29,675 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] [2024-02-19 14:50:29,675 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:50:29,675 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 2 more)] === [2024-02-19 14:50:29,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1792684329, now seen corresponding path program 1 times [2024-02-19 14:50:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:29,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77521786] [2024-02-19 14:50:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77521786] [2024-02-19 14:50:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77521786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:29,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:50:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572491317] [2024-02-19 14:50:29,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:29,788 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:50:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:50:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:50:29,798 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:50:29,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 60 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:29,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:29,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:50:29,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:30,541 INFO L124 PetriNetUnfolderBase]: 7191/10086 cut-off events. [2024-02-19 14:50:30,541 INFO L125 PetriNetUnfolderBase]: For 2003/2207 co-relation queries the response was YES. [2024-02-19 14:50:30,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28192 conditions, 10086 events. 7191/10086 cut-off events. For 2003/2207 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 55745 event pairs, 797 based on Foata normal form. 55/10115 useless extension candidates. Maximal degree in co-relation 23715. Up to 7801 conditions per place. [2024-02-19 14:50:30,600 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 137 selfloop transitions, 7 changer transitions 1/151 dead transitions. [2024-02-19 14:50:30,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 151 transitions, 967 flow [2024-02-19 14:50:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:50:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:50:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-02-19 14:50:30,602 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-02-19 14:50:30,602 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2024-02-19 14:50:30,603 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 151 transitions, 967 flow [2024-02-19 14:50:30,603 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:30,603 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:30,603 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] [2024-02-19 14:50:30,603 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:50:30,603 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 2 more)] === [2024-02-19 14:50:30,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash -442724966, now seen corresponding path program 1 times [2024-02-19 14:50:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922676126] [2024-02-19 14:50:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:30,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922676126] [2024-02-19 14:50:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922676126] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:30,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:30,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:50:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289837476] [2024-02-19 14:50:30,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:30,649 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:50:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:50:30,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:50:30,650 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:50:30,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 151 transitions, 967 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:30,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:30,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:50:30,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:31,343 INFO L124 PetriNetUnfolderBase]: 7924/11028 cut-off events. [2024-02-19 14:50:31,343 INFO L125 PetriNetUnfolderBase]: For 7401/8081 co-relation queries the response was YES. [2024-02-19 14:50:31,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40378 conditions, 11028 events. 7924/11028 cut-off events. For 7401/8081 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 60920 event pairs, 1403 based on Foata normal form. 274/11255 useless extension candidates. Maximal degree in co-relation 32629. Up to 8742 conditions per place. [2024-02-19 14:50:31,408 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 175 selfloop transitions, 7 changer transitions 1/196 dead transitions. [2024-02-19 14:50:31,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 196 transitions, 1630 flow [2024-02-19 14:50:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:50:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:50:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-19 14:50:31,413 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2024-02-19 14:50:31,414 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2024-02-19 14:50:31,414 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 196 transitions, 1630 flow [2024-02-19 14:50:31,414 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:31,415 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:31,415 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] [2024-02-19 14:50:31,415 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:50:31,415 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 2 more)] === [2024-02-19 14:50:31,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash -453906751, now seen corresponding path program 2 times [2024-02-19 14:50:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232373170] [2024-02-19 14:50:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232373170] [2024-02-19 14:50:31,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232373170] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:31,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:50:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217673665] [2024-02-19 14:50:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:31,670 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:50:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:31,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:50:31,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:50:31,682 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:50:31,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 196 transitions, 1630 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:31,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:31,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:50:31,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:32,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][256], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 70#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 63#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 13#thread4EXITtrue, 11#L44true, 55#true]) [2024-02-19 14:50:32,152 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:50:32,152 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:32,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:32,152 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:32,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][258], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 32#L76true, 70#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 63#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 11#L44true, 55#true]) [2024-02-19 14:50:32,222 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:50:32,222 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:50:32,222 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:50:32,222 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:32,570 INFO L124 PetriNetUnfolderBase]: 9495/13151 cut-off events. [2024-02-19 14:50:32,570 INFO L125 PetriNetUnfolderBase]: For 19504/20682 co-relation queries the response was YES. [2024-02-19 14:50:32,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59205 conditions, 13151 events. 9495/13151 cut-off events. For 19504/20682 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 75139 event pairs, 511 based on Foata normal form. 200/13327 useless extension candidates. Maximal degree in co-relation 52220. Up to 10067 conditions per place. [2024-02-19 14:50:32,648 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 410 selfloop transitions, 27 changer transitions 1/444 dead transitions. [2024-02-19 14:50:32,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 444 transitions, 4574 flow [2024-02-19 14:50:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:50:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:50:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-02-19 14:50:32,649 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2024-02-19 14:50:32,649 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2024-02-19 14:50:32,650 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 444 transitions, 4574 flow [2024-02-19 14:50:32,650 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:32,650 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:32,650 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] [2024-02-19 14:50:32,650 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:50:32,650 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 2 more)] === [2024-02-19 14:50:32,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1298095323, now seen corresponding path program 3 times [2024-02-19 14:50:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:32,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918278053] [2024-02-19 14:50:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918278053] [2024-02-19 14:50:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918278053] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:32,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:50:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695067520] [2024-02-19 14:50:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:32,700 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:50:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:50:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:50:32,707 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:50:32,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 444 transitions, 4574 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:32,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:32,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:50:32,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:33,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][396], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 70#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 13#thread4EXITtrue, 11#L44true, 55#true]) [2024-02-19 14:50:33,370 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,370 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:33,370 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:33,370 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, 34#L41-4true, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 13#thread4EXITtrue, 55#true]) [2024-02-19 14:50:33,474 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,475 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:50:33,475 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,475 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:50:33,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][398], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 70#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 11#L44true, 55#true]) [2024-02-19 14:50:33,484 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,484 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:50:33,486 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-02-19 14:50:33,487 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 21#L91-4true, 13#thread4EXITtrue, 11#L44true, 55#true]) [2024-02-19 14:50:33,577 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,577 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,577 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,577 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 13#thread4EXITtrue, 55#true]) [2024-02-19 14:50:33,578 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,579 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,583 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,583 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 20#thread1EXITtrue, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 13#thread4EXITtrue, 55#true]) [2024-02-19 14:50:33,589 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,589 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,589 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,589 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, 34#L41-4true, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 55#true]) [2024-02-19 14:50:33,595 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,595 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,595 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,595 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-02-19 14:50:33,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 8#L92-1true, 9#L62-4true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 11#L44true, 13#thread4EXITtrue, 55#true]) [2024-02-19 14:50:33,812 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,812 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,813 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,813 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 21#L91-4true, 11#L44true, 55#true]) [2024-02-19 14:50:33,814 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,814 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,814 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,814 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 55#true]) [2024-02-19 14:50:33,815 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,815 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,815 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,815 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 8#L92-1true, 20#thread1EXITtrue, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 55#true]) [2024-02-19 14:50:33,821 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,821 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,822 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,822 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, 36#L92-2true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1NotInUse, 28#L51-4true, 13#thread4EXITtrue, 55#true]) [2024-02-19 14:50:33,823 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,823 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,823 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-02-19 14:50:33,823 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-02-19 14:50:33,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 8#L92-1true, 9#L62-4true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 11#L44true, 55#true]) [2024-02-19 14:50:33,913 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:50:33,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,914 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:50:33,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 66#true, 36#L92-2true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1NotInUse, 28#L51-4true, 55#true]) [2024-02-19 14:50:33,921 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:50:33,921 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,921 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,922 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:50:33,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][527], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 16#L93-1true, 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1NotInUse, 28#L51-4true, 13#thread4EXITtrue, 55#true]) [2024-02-19 14:50:33,923 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][529], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 9#L62-4true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 16#L93-1true, 63#true, 66#true, thread3Thread1of1ForFork0InUse, thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1NotInUse, 28#L51-4true, 55#true]) [2024-02-19 14:50:33,923 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:50:33,923 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-02-19 14:50:34,273 INFO L124 PetriNetUnfolderBase]: 15465/21388 cut-off events. [2024-02-19 14:50:34,274 INFO L125 PetriNetUnfolderBase]: For 42971/44935 co-relation queries the response was YES. [2024-02-19 14:50:34,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116501 conditions, 21388 events. 15465/21388 cut-off events. For 42971/44935 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 128155 event pairs, 831 based on Foata normal form. 216/21515 useless extension candidates. Maximal degree in co-relation 105565. Up to 17039 conditions per place. [2024-02-19 14:50:34,575 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 903 selfloop transitions, 62 changer transitions 9/980 dead transitions. [2024-02-19 14:50:34,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 980 transitions, 12044 flow [2024-02-19 14:50:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:50:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:50:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-19 14:50:34,576 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6232558139534884 [2024-02-19 14:50:34,577 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2024-02-19 14:50:34,577 INFO L507 AbstractCegarLoop]: Abstraction has has 63 places, 980 transitions, 12044 flow [2024-02-19 14:50:34,578 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:34,578 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:34,578 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] [2024-02-19 14:50:34,578 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:50:34,578 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 2 more)] === [2024-02-19 14:50:34,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -800134151, now seen corresponding path program 4 times [2024-02-19 14:50:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543774745] [2024-02-19 14:50:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543774745] [2024-02-19 14:50:34,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543774745] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:34,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:34,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:50:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595394167] [2024-02-19 14:50:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:34,654 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:50:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:50:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:50:34,669 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:50:34,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 980 transitions, 12044 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:34,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:34,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:50:34,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:37,069 INFO L124 PetriNetUnfolderBase]: 17757/24715 cut-off events. [2024-02-19 14:50:37,070 INFO L125 PetriNetUnfolderBase]: For 86172/88382 co-relation queries the response was YES. [2024-02-19 14:50:37,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152656 conditions, 24715 events. 17757/24715 cut-off events. For 86172/88382 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 147668 event pairs, 1314 based on Foata normal form. 399/24986 useless extension candidates. Maximal degree in co-relation 138687. Up to 18619 conditions per place. [2024-02-19 14:50:37,310 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 1370 selfloop transitions, 215 changer transitions 39/1632 dead transitions. [2024-02-19 14:50:37,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 1632 transitions, 23070 flow [2024-02-19 14:50:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:50:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:50:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-02-19 14:50:37,312 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5953488372093023 [2024-02-19 14:50:37,312 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2024-02-19 14:50:37,312 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 1632 transitions, 23070 flow [2024-02-19 14:50:37,313 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:37,313 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:37,313 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] [2024-02-19 14:50:37,313 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:50:37,313 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 2 more)] === [2024-02-19 14:50:37,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash 464310365, now seen corresponding path program 1 times [2024-02-19 14:50:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:37,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027322152] [2024-02-19 14:50:37,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027322152] [2024-02-19 14:50:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027322152] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:37,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:37,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:50:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379802977] [2024-02-19 14:50:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:37,368 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:50:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:37,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:50:37,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:50:37,376 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:50:37,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 1632 transitions, 23070 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:37,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:37,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:50:37,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:37,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([317] L91-4-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~mem18#1_29| (select (select |v_#memory_int#3_4| |v_ULTIMATE.start_main_~#t1~0#1.base_62|) |v_ULTIMATE.start_main_~#t1~0#1.offset_46|)) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_62|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_46|, #memory_int#3=|v_#memory_int#3_4|} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_29|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_62|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_46|, #memory_int#3=|v_#memory_int#3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1][567], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 8#L92-1true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 57#(= ~counter2~0 ~counter1~0), 65#(= ~counter1~0 0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true]) [2024-02-19 14:50:37,993 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,993 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,993 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,994 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0][568], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 21#L91-4true, 11#L44true, 55#true]) [2024-02-19 14:50:37,994 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,994 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,994 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,994 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_33 |v_thread2Thread1of1ForFork3_~i~1#1_5|) (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_33} OutVars{~N~0=v_~N~0_33, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][576], [30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 29#thread2EXITtrue, 73#(= thread3Thread1of1ForFork0_~i~2 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 57#(= ~counter2~0 ~counter1~0), 65#(= ~counter1~0 0), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 61#(<= ~N~0 0), 31#L42true, 21#L91-4true]) [2024-02-19 14:50:37,995 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,995 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,995 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:37,995 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:38,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L63-->L65: Formula: (= v_~counter2~0_12 (+ v_~counter2~0_13 1)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post6][566], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 3#L65true, thread3Thread1of1ForFork0InUse, 65#(= ~counter1~0 0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 55#true]) [2024-02-19 14:50:38,257 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,257 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,257 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,257 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][575], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 80#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 65#(= ~counter1~0 0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 57#(= ~counter2~0 ~counter1~0), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 13#thread4EXITtrue]) [2024-02-19 14:50:38,260 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,260 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,260 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,260 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:38,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L73-->L76: Formula: (and (= (+ v_~counter2~0_62 1) v_~counter2~0_63) (not (= (ite (< 0 v_~counter2~0_63) 1 0) 0))) InVars {~counter2~0=v_~counter2~0_63} OutVars{~counter2~0=v_~counter2~0_62, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|} AuxVars[] AssignedVars[~counter2~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][772], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 32#L76true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 65#(= ~counter1~0 0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 55#true]) [2024-02-19 14:50:38,269 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2024-02-19 14:50:38,269 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:38,269 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:38,269 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-02-19 14:50:42,154 INFO L124 PetriNetUnfolderBase]: 23912/32306 cut-off events. [2024-02-19 14:50:42,154 INFO L125 PetriNetUnfolderBase]: For 239459/245106 co-relation queries the response was YES. [2024-02-19 14:50:42,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226820 conditions, 32306 events. 23912/32306 cut-off events. For 239459/245106 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 187444 event pairs, 1815 based on Foata normal form. 776/32359 useless extension candidates. Maximal degree in co-relation 223435. Up to 24231 conditions per place. [2024-02-19 14:50:42,588 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 1604 selfloop transitions, 128 changer transitions 52/1817 dead transitions. [2024-02-19 14:50:42,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 1817 transitions, 29286 flow [2024-02-19 14:50:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:50:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:50:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-02-19 14:50:42,590 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-02-19 14:50:42,591 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 24 predicate places. [2024-02-19 14:50:42,591 INFO L507 AbstractCegarLoop]: Abstraction has has 71 places, 1817 transitions, 29286 flow [2024-02-19 14:50:42,591 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:42,591 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:42,591 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] [2024-02-19 14:50:42,592 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:50:42,592 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 2 more)] === [2024-02-19 14:50:42,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 352184110, now seen corresponding path program 1 times [2024-02-19 14:50:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087495324] [2024-02-19 14:50:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:42,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087495324] [2024-02-19 14:50:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087495324] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:50:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83884852] [2024-02-19 14:50:42,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:42,630 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:50:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:50:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:50:42,631 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:50:42,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 1817 transitions, 29286 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:42,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:42,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:50:42,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:43,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_33 |v_thread2Thread1of1ForFork3_~i~1#1_5|) (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_33} OutVars{~N~0=v_~N~0_33, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][537], [30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 29#thread2EXITtrue, 88#(= ~counter2~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 57#(= ~counter2~0 ~counter1~0), 65#(= ~counter1~0 0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 61#(<= ~N~0 0), 31#L42true, 21#L91-4true]) [2024-02-19 14:50:43,170 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,170 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,170 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,170 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0][538], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 88#(= ~counter2~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 63#true, 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 21#L91-4true, 11#L44true, 55#true]) [2024-02-19 14:50:43,170 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,171 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,171 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,171 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([317] L91-4-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~mem18#1_29| (select (select |v_#memory_int#3_4| |v_ULTIMATE.start_main_~#t1~0#1.base_62|) |v_ULTIMATE.start_main_~#t1~0#1.offset_46|)) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_62|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_46|, #memory_int#3=|v_#memory_int#3_4|} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_29|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_62|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_46|, #memory_int#3=|v_#memory_int#3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1][541], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 8#L92-1true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 88#(= ~counter2~0 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 65#(= ~counter1~0 0), 57#(= ~counter2~0 ~counter1~0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true]) [2024-02-19 14:50:43,171 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,171 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,171 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,172 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][544], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 88#(= ~counter2~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 80#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 57#(= ~counter2~0 ~counter1~0), 65#(= ~counter1~0 0), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 13#thread4EXITtrue]) [2024-02-19 14:50:43,172 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,172 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,172 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,172 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:43,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L63-->L65: Formula: (= v_~counter2~0_12 (+ v_~counter2~0_13 1)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post6][540], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 3#L65true, 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 86#true, thread3Thread1of1ForFork0InUse, 65#(= ~counter1~0 0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 55#true]) [2024-02-19 14:50:43,392 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2024-02-19 14:50:43,392 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:43,392 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:43,392 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:46,424 INFO L124 PetriNetUnfolderBase]: 19360/26463 cut-off events. [2024-02-19 14:50:46,425 INFO L125 PetriNetUnfolderBase]: For 283590/287070 co-relation queries the response was YES. [2024-02-19 14:50:46,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206460 conditions, 26463 events. 19360/26463 cut-off events. For 283590/287070 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 151496 event pairs, 930 based on Foata normal form. 1382/27395 useless extension candidates. Maximal degree in co-relation 202964. Up to 19424 conditions per place. [2024-02-19 14:50:46,656 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 1448 selfloop transitions, 58 changer transitions 187/1738 dead transitions. [2024-02-19 14:50:46,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 1738 transitions, 31445 flow [2024-02-19 14:50:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:50:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:50:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-02-19 14:50:46,658 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-02-19 14:50:46,660 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2024-02-19 14:50:46,660 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 1738 transitions, 31445 flow [2024-02-19 14:50:46,660 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:46,660 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:46,660 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] [2024-02-19 14:50:46,660 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:50:46,660 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 2 more)] === [2024-02-19 14:50:46,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:46,661 INFO L85 PathProgramCache]: Analyzing trace with hash -261145859, now seen corresponding path program 5 times [2024-02-19 14:50:46,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905472974] [2024-02-19 14:50:46,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905472974] [2024-02-19 14:50:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905472974] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:50:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:50:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:50:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480269117] [2024-02-19 14:50:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:50:46,757 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:50:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:46,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:50:46,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:50:46,768 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:50:46,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 1738 transitions, 31445 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:46,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:46,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:50:46,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:50:47,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0][590], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 88#(= ~counter2~0 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 63#true, 91#(= |thread4Thread1of1ForFork2_~i~3#1| 0), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 21#L91-4true, 11#L44true, 55#true]) [2024-02-19 14:50:47,321 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([317] L91-4-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~mem18#1_29| (select (select |v_#memory_int#3_4| |v_ULTIMATE.start_main_~#t1~0#1.base_62|) |v_ULTIMATE.start_main_~#t1~0#1.offset_46|)) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_62|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_46|, #memory_int#3=|v_#memory_int#3_4|} OutVars{ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_29|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_62|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_46|, #memory_int#3=|v_#memory_int#3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1][596], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 8#L92-1true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 88#(= ~counter2~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 91#(= |thread4Thread1of1ForFork2_~i~3#1| 0), thread3Thread1of1ForFork0InUse, 57#(= ~counter2~0 ~counter1~0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 65#(= ~counter1~0 0), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true]) [2024-02-19 14:50:47,321 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([347] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_33 |v_thread2Thread1of1ForFork3_~i~1#1_5|) (= |v_thread2Thread1of1ForFork3_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_33} OutVars{~N~0=v_~N~0_33, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_1|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_#res#1.base][600], [30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 29#thread2EXITtrue, 73#(= thread3Thread1of1ForFork0_~i~2 0), 88#(= ~counter2~0 0), 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 91#(= |thread4Thread1of1ForFork2_~i~3#1| 0), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 65#(= ~counter1~0 0), 57#(= ~counter2~0 ~counter1~0), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, 61#(<= ~N~0 0), thread1Thread1of1ForFork1InUse, 21#L91-4true, 31#L42true]) [2024-02-19 14:50:47,321 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,321 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,322 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-02-19 14:50:47,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L63-->L65: Formula: (= v_~counter2~0_12 (+ v_~counter2~0_13 1)) InVars {~counter2~0=v_~counter2~0_13} OutVars{~counter2~0=v_~counter2~0_12, thread3Thread1of1ForFork0_#t~post6=|v_thread3Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork0_#t~post6][592], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 30#L72-4true, 83#(= thread1Thread1of1ForFork1_~i~0 0), 73#(= thread3Thread1of1ForFork0_~i~2 0), 3#L65true, 79#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 86#true, 91#(= |thread4Thread1of1ForFork2_~i~3#1| 0), thread3Thread1of1ForFork0InUse, 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 65#(= ~counter1~0 0), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 55#true]) [2024-02-19 14:50:47,709 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,709 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,710 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,710 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L72-4-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_1| 0) (<= v_~N~0_35 |v_thread4Thread1of1ForFork2_~i~3#1_5|)) InVars {thread4Thread1of1ForFork2_~i~3#1=|v_thread4Thread1of1ForFork2_~i~3#1_5|, ~N~0=v_~N~0_35} OutVars{thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_1|, ~N~0=v_~N~0_35, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_~i~3#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#res#1.offset][598], [60#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 83#(= thread1Thread1of1ForFork1_~i~0 0), 2#L63true, 73#(= thread3Thread1of1ForFork0_~i~2 0), 88#(= ~counter2~0 0), 80#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), thread3Thread1of1ForFork0InUse, 65#(= ~counter1~0 0), 57#(= ~counter2~0 ~counter1~0), 69#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), thread4Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread1Thread1of1ForFork1InUse, 28#L51-4true, 31#L42true, 21#L91-4true, 13#thread4EXITtrue, 92#(<= ~N~0 0)]) [2024-02-19 14:50:47,711 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,711 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,711 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:47,711 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is not cut-off event [2024-02-19 14:50:52,490 INFO L124 PetriNetUnfolderBase]: 26291/35930 cut-off events. [2024-02-19 14:50:52,490 INFO L125 PetriNetUnfolderBase]: For 403693/409932 co-relation queries the response was YES. [2024-02-19 14:50:52,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313885 conditions, 35930 events. 26291/35930 cut-off events. For 403693/409932 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 210129 event pairs, 566 based on Foata normal form. 890/36133 useless extension candidates. Maximal degree in co-relation 309554. Up to 27336 conditions per place. [2024-02-19 14:50:52,885 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 2514 selfloop transitions, 245 changer transitions 359/3128 dead transitions. [2024-02-19 14:50:52,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 3128 transitions, 62642 flow [2024-02-19 14:50:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:50:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:50:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-02-19 14:50:52,886 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-02-19 14:50:52,887 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2024-02-19 14:50:52,887 INFO L507 AbstractCegarLoop]: Abstraction has has 77 places, 3128 transitions, 62642 flow [2024-02-19 14:50:52,887 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-19 14:50:52,887 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:50:52,887 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] [2024-02-19 14:50:52,887 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:50:52,888 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 2 more)] === [2024-02-19 14:50:52,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:50:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1655901831, now seen corresponding path program 6 times [2024-02-19 14:50:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:50:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137817765] [2024-02-19 14:50:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:50:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:50:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:50:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:50:52,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137817765] [2024-02-19 14:50:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137817765] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:50:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768082140] [2024-02-19 14:50:52,997 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 14:50:52,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:50:52,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:50:52,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:50:53,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:50:53,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-02-19 14:50:53,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:50:53,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:50:53,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:50:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:53,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:50:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:50:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768082140] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:50:53,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:50:53,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-02-19 14:50:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335699137] [2024-02-19 14:50:53,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:50:53,167 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 14:50:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:50:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 14:50:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:50:53,183 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:50:53,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 3128 transitions, 62642 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:50:53,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:50:53,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:50:53,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:07,365 INFO L124 PetriNetUnfolderBase]: 42480/56767 cut-off events. [2024-02-19 14:51:07,366 INFO L125 PetriNetUnfolderBase]: For 941287/954820 co-relation queries the response was YES. [2024-02-19 14:51:07,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542388 conditions, 56767 events. 42480/56767 cut-off events. For 941287/954820 co-relation queries the response was YES. Maximal size of possible extension queue 1666. Compared 332920 event pairs, 1371 based on Foata normal form. 3529/58979 useless extension candidates. Maximal degree in co-relation 535969. Up to 43233 conditions per place. [2024-02-19 14:51:08,143 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 4163 selfloop transitions, 665 changer transitions 454/5292 dead transitions. [2024-02-19 14:51:08,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 5292 transitions, 116462 flow [2024-02-19 14:51:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:51:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:51:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 360 transitions. [2024-02-19 14:51:08,145 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5980066445182725 [2024-02-19 14:51:08,145 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-02-19 14:51:08,145 INFO L507 AbstractCegarLoop]: Abstraction has has 90 places, 5292 transitions, 116462 flow [2024-02-19 14:51:08,145 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:08,145 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:08,145 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] [2024-02-19 14:51:08,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 14:51:08,357 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-19 14:51:08,357 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:08,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 239803951, now seen corresponding path program 2 times [2024-02-19 14:51:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008617597] [2024-02-19 14:51:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008617597] [2024-02-19 14:51:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008617597] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:51:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995454885] [2024-02-19 14:51:08,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:51:08,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:51:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:51:08,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:51:08,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 14:51:08,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:51:08,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:51:08,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:51:08,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:51:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:08,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:51:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995454885] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:51:08,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:51:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-02-19 14:51:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955471416] [2024-02-19 14:51:08,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:51:08,594 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 14:51:08,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 14:51:08,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:51:08,612 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:08,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 5292 transitions, 116462 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:08,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:08,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:08,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand