./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i -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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:21:01,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:21:01,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:21:01,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:21:01,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:21:01,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:21:01,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:21:01,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:21:01,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:21:01,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:21:01,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:21:01,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:21:01,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:21:01,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:21:01,549 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:21:01,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:21:01,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:21:01,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:21:01,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:21:01,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:21:01,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:21:01,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:21:01,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:21:01,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:21:01,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:21:01,551 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:21:01,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:21:01,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:21:01,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:21:01,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:21:01,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:21:01,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:21:01,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:01,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:21:01,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:21:01,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:21:01,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:21:01,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:21:01,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:21:01,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:21:01,556 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:21:01,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:21:01,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:21:01,556 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 [2024-06-27 16:21:01,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:21:01,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:21:01,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:21:01,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:21:01,790 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:21:01,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2024-06-27 16:21:02,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:21:03,015 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:21:03,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2024-06-27 16:21:03,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0c2e1f2/ab7f4f2e8d4843d1982872c7cd2b4d5b/FLAGd5759b690 [2024-06-27 16:21:03,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d0c2e1f2/ab7f4f2e8d4843d1982872c7cd2b4d5b [2024-06-27 16:21:03,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:21:03,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:21:03,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:03,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:21:03,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:21:03,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473f4328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03, skipping insertion in model container [2024-06-27 16:21:03,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,095 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:21:03,388 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i[30422,30435] [2024-06-27 16:21:03,429 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:03,437 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:21:03,475 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i[30422,30435] [2024-06-27 16:21:03,479 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:03,509 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:21:03,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03 WrapperNode [2024-06-27 16:21:03,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:03,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:03,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:21:03,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:21:03,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,553 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 58 [2024-06-27 16:21:03,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:03,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:21:03,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:21:03,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:21:03,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,582 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 16:21:03,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:21:03,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:21:03,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:21:03,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:21:03,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (1/1) ... [2024-06-27 16:21:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:03,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:21:03,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 16:21:03,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 16:21:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:21:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:21:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:21:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:21:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:21:03,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:21:03,685 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:21:03,788 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:21:03,789 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:21:03,883 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:21:03,883 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:21:03,942 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:21:03,942 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-06-27 16:21:03,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:03 BoogieIcfgContainer [2024-06-27 16:21:03,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:21:03,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:21:03,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:21:03,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:21:03,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:21:03" (1/3) ... [2024-06-27 16:21:03,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fdfff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:03, skipping insertion in model container [2024-06-27 16:21:03,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:03" (2/3) ... [2024-06-27 16:21:03,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fdfff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:03, skipping insertion in model container [2024-06-27 16:21:03,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:03" (3/3) ... [2024-06-27 16:21:03,950 INFO L112 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2024-06-27 16:21:03,956 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:21:03,963 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:21:03,963 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:21:03,963 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:21:04,010 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:04,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2024-06-27 16:21:04,069 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-06-27 16:21:04,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:04,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2024-06-27 16:21:04,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2024-06-27 16:21:04,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2024-06-27 16:21:04,085 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:04,090 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f44c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:04,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:21:04,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:04,094 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-06-27 16:21:04,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:04,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:04,099 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-06-27 16:21:04,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-06-27 16:21:04,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1558504319, now seen corresponding path program 1 times [2024-06-27 16:21:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:04,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881492804] [2024-06-27 16:21:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:04,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:04,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:04,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:04,207 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:04,208 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-06-27 16:21:04,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-06-27 16:21:04,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-06-27 16:21:04,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:21:04,210 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-06-27 16:21:04,216 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:04,217 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-27 16:21:04,230 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:04,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2024-06-27 16:21:04,241 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-06-27 16:21:04,241 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:04,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2024-06-27 16:21:04,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2024-06-27 16:21:04,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2024-06-27 16:21:04,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:04,244 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f44c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:04,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:21:04,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:04,249 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-06-27 16:21:04,249 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:04,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:04,249 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-06-27 16:21:04,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-06-27 16:21:04,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1819771659, now seen corresponding path program 1 times [2024-06-27 16:21:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744591645] [2024-06-27 16:21:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:04,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:04,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:04,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:04,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-27 16:21:04,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-06-27 16:21:04,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-06-27 16:21:04,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-06-27 16:21:04,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:21:04,274 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-06-27 16:21:04,275 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:04,275 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-27 16:21:04,298 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:04,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2024-06-27 16:21:04,309 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2024-06-27 16:21:04,310 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:21:04,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2024-06-27 16:21:04,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2024-06-27 16:21:04,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-06-27 16:21:04,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:04,313 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f44c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:04,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:21:04,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:04,323 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-06-27 16:21:04,323 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:21:04,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:04,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:04,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:04,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1846680817, now seen corresponding path program 1 times [2024-06-27 16:21:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:04,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75825591] [2024-06-27 16:21:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:04,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:04,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75825591] [2024-06-27 16:21:04,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75825591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:04,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500938824] [2024-06-27 16:21:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:04,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 16:21:04,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-06-27 16:21:04,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:04,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 16:21:04,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:05,100 INFO L124 PetriNetUnfolderBase]: 3454/5586 cut-off events. [2024-06-27 16:21:05,101 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2024-06-27 16:21:05,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 5586 events. 3454/5586 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34753 event pairs, 736 based on Foata normal form. 564/5799 useless extension candidates. Maximal degree in co-relation 4764. Up to 2085 conditions per place. [2024-06-27 16:21:05,143 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2024-06-27 16:21:05,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 296 flow [2024-06-27 16:21:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-06-27 16:21:05,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2024-06-27 16:21:05,156 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 112 flow. Second operand 4 states and 134 transitions. [2024-06-27 16:21:05,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 296 flow [2024-06-27 16:21:05,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 290 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:05,169 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 106 flow [2024-06-27 16:21:05,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-06-27 16:21:05,173 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-06-27 16:21:05,174 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 106 flow [2024-06-27 16:21:05,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-06-27 16:21:05,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:05,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:05,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:21:05,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:05,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1846679794, now seen corresponding path program 1 times [2024-06-27 16:21:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623828307] [2024-06-27 16:21:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623828307] [2024-06-27 16:21:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623828307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366238201] [2024-06-27 16:21:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:05,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:05,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 16:21:05,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:05,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:05,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 16:21:05,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:05,692 INFO L124 PetriNetUnfolderBase]: 3454/5328 cut-off events. [2024-06-27 16:21:05,692 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2024-06-27 16:21:05,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10724 conditions, 5328 events. 3454/5328 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 30902 event pairs, 736 based on Foata normal form. 129/5214 useless extension candidates. Maximal degree in co-relation 8547. Up to 2085 conditions per place. [2024-06-27 16:21:05,719 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 53 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-06-27 16:21:05,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 290 flow [2024-06-27 16:21:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-06-27 16:21:05,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-06-27 16:21:05,721 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 106 flow. Second operand 4 states and 120 transitions. [2024-06-27 16:21:05,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 290 flow [2024-06-27 16:21:05,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:05,724 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 101 flow [2024-06-27 16:21:05,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-06-27 16:21:05,725 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2024-06-27 16:21:05,725 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 101 flow [2024-06-27 16:21:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:05,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:05,725 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-06-27 16:21:05,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:21:05,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 16:21:05,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1817396894, now seen corresponding path program 1 times [2024-06-27 16:21:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734119352] [2024-06-27 16:21:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:05,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:05,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:05,742 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:05,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-06-27 16:21:05,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 16:21:05,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-06-27 16:21:05,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-06-27 16:21:05,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 16:21:05,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:21:05,743 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:21:05,744 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:05,744 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-27 16:21:05,761 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:05,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2024-06-27 16:21:05,766 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2024-06-27 16:21:05,767 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:21:05,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-06-27 16:21:05,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2024-06-27 16:21:05,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2024-06-27 16:21:05,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:05,769 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f44c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:05,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:21:05,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:05,771 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-06-27 16:21:05,771 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:21:05,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:05,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:05,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:05,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1944933369, now seen corresponding path program 1 times [2024-06-27 16:21:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613591643] [2024-06-27 16:21:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613591643] [2024-06-27 16:21:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613591643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453734890] [2024-06-27 16:21:05,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:05,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:05,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-06-27 16:21:05,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:05,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:05,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-06-27 16:21:05,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:08,344 INFO L124 PetriNetUnfolderBase]: 28492/41307 cut-off events. [2024-06-27 16:21:08,344 INFO L125 PetriNetUnfolderBase]: For 5011/5011 co-relation queries the response was YES. [2024-06-27 16:21:08,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80861 conditions, 41307 events. 28492/41307 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 288892 event pairs, 6352 based on Foata normal form. 4892/44047 useless extension candidates. Maximal degree in co-relation 10947. Up to 15765 conditions per place. [2024-06-27 16:21:08,681 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 70 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-06-27 16:21:08,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 410 flow [2024-06-27 16:21:08,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2024-06-27 16:21:08,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-27 16:21:08,686 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 150 flow. Second operand 4 states and 183 transitions. [2024-06-27 16:21:08,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 410 flow [2024-06-27 16:21:08,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 392 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:08,696 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 138 flow [2024-06-27 16:21:08,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2024-06-27 16:21:08,698 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2024-06-27 16:21:08,698 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 138 flow [2024-06-27 16:21:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:08,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:08,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:08,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:21:08,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:08,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1944934392, now seen corresponding path program 1 times [2024-06-27 16:21:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320576721] [2024-06-27 16:21:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320576721] [2024-06-27 16:21:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320576721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961122302] [2024-06-27 16:21:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:08,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:08,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:08,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 16:21:08,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:08,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:08,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 16:21:08,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:10,724 INFO L124 PetriNetUnfolderBase]: 28492/39753 cut-off events. [2024-06-27 16:21:10,725 INFO L125 PetriNetUnfolderBase]: For 2566/2566 co-relation queries the response was YES. [2024-06-27 16:21:10,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79926 conditions, 39753 events. 28492/39753 cut-off events. For 2566/2566 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 258318 event pairs, 6352 based on Foata normal form. 777/39029 useless extension candidates. Maximal degree in co-relation 65082. Up to 15765 conditions per place. [2024-06-27 16:21:10,970 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 71 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-06-27 16:21:10,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 392 flow [2024-06-27 16:21:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-06-27 16:21:10,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2024-06-27 16:21:10,972 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 138 flow. Second operand 4 states and 166 transitions. [2024-06-27 16:21:10,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 392 flow [2024-06-27 16:21:10,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:10,979 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 133 flow [2024-06-27 16:21:10,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-06-27 16:21:10,980 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-06-27 16:21:10,980 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 133 flow [2024-06-27 16:21:10,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:10,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:10,981 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:10,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:21:10,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:10,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1946095303, now seen corresponding path program 1 times [2024-06-27 16:21:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466960143] [2024-06-27 16:21:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:21:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466960143] [2024-06-27 16:21:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466960143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:11,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141499915] [2024-06-27 16:21:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:11,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:11,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-06-27 16:21:11,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:11,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:11,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-06-27 16:21:11,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:13,678 INFO L124 PetriNetUnfolderBase]: 38482/55572 cut-off events. [2024-06-27 16:21:13,679 INFO L125 PetriNetUnfolderBase]: For 3976/3976 co-relation queries the response was YES. [2024-06-27 16:21:13,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109068 conditions, 55572 events. 38482/55572 cut-off events. For 3976/3976 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 402503 event pairs, 8611 based on Foata normal form. 0/51210 useless extension candidates. Maximal degree in co-relation 81252. Up to 21195 conditions per place. [2024-06-27 16:21:14,134 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 68 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2024-06-27 16:21:14,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 377 flow [2024-06-27 16:21:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-06-27 16:21:14,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-06-27 16:21:14,136 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 133 flow. Second operand 4 states and 168 transitions. [2024-06-27 16:21:14,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 377 flow [2024-06-27 16:21:14,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:14,144 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 134 flow [2024-06-27 16:21:14,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-06-27 16:21:14,146 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2024-06-27 16:21:14,146 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 134 flow [2024-06-27 16:21:14,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:14,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:14,146 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:14,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:21:14,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:14,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1946096326, now seen corresponding path program 1 times [2024-06-27 16:21:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625258811] [2024-06-27 16:21:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:21:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:14,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625258811] [2024-06-27 16:21:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625258811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:14,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:14,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396908041] [2024-06-27 16:21:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:14,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:14,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:14,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:14,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-06-27 16:21:14,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:14,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:14,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-06-27 16:21:14,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:16,730 INFO L124 PetriNetUnfolderBase]: 38482/53508 cut-off events. [2024-06-27 16:21:16,730 INFO L125 PetriNetUnfolderBase]: For 3442/3442 co-relation queries the response was YES. [2024-06-27 16:21:16,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107517 conditions, 53508 events. 38482/53508 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 2042. Compared 360544 event pairs, 8611 based on Foata normal form. 1032/51036 useless extension candidates. Maximal degree in co-relation 79704. Up to 21195 conditions per place. [2024-06-27 16:21:16,978 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-06-27 16:21:16,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 370 flow [2024-06-27 16:21:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-06-27 16:21:16,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2024-06-27 16:21:16,979 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 134 flow. Second operand 4 states and 164 transitions. [2024-06-27 16:21:16,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 370 flow [2024-06-27 16:21:16,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:21:16,989 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 129 flow [2024-06-27 16:21:16,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-06-27 16:21:16,990 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-06-27 16:21:16,990 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 129 flow [2024-06-27 16:21:16,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:16,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:16,991 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:16,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:21:16,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-06-27 16:21:16,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash -736863984, now seen corresponding path program 1 times [2024-06-27 16:21:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594037464] [2024-06-27 16:21:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:16,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:17,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:17,005 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:17,005 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-06-27 16:21:17,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 16:21:17,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-06-27 16:21:17,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-06-27 16:21:17,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-06-27 16:21:17,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 16:21:17,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:21:17,006 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-06-27 16:21:17,007 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:17,007 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-27 16:21:17,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:17,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2024-06-27 16:21:17,034 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2024-06-27 16:21:17,034 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:21:17,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 235 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2024-06-27 16:21:17,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 75 transitions, 190 flow [2024-06-27 16:21:17,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 190 flow [2024-06-27 16:21:17,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:17,039 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f44c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:17,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 16:21:17,040 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:17,040 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-06-27 16:21:17,040 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:21:17,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:17,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:17,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:21:17,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash -278289359, now seen corresponding path program 1 times [2024-06-27 16:21:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074487991] [2024-06-27 16:21:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074487991] [2024-06-27 16:21:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074487991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:17,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:17,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42120945] [2024-06-27 16:21:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:17,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-06-27 16:21:17,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:17,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:17,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-06-27 16:21:17,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:33,647 INFO L124 PetriNetUnfolderBase]: 217600/294522 cut-off events. [2024-06-27 16:21:33,647 INFO L125 PetriNetUnfolderBase]: For 46094/46094 co-relation queries the response was YES. [2024-06-27 16:21:34,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581613 conditions, 294522 events. 217600/294522 cut-off events. For 46094/46094 co-relation queries the response was YES. Maximal size of possible extension queue 9086. Compared 2201598 event pairs, 49768 based on Foata normal form. 38646/320220 useless extension candidates. Maximal degree in co-relation 80810. Up to 114045 conditions per place. [2024-06-27 16:21:35,950 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 88 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-06-27 16:21:35,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 122 transitions, 530 flow [2024-06-27 16:21:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:21:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:21:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2024-06-27 16:21:35,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-06-27 16:21:35,952 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 190 flow. Second operand 4 states and 232 transitions. [2024-06-27 16:21:35,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 122 transitions, 530 flow [2024-06-27 16:21:35,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 494 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:35,964 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 170 flow [2024-06-27 16:21:35,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-27 16:21:35,965 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2024-06-27 16:21:35,965 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 170 flow [2024-06-27 16:21:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:35,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:35,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:21:35,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-06-27 16:21:35,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -278288336, now seen corresponding path program 1 times [2024-06-27 16:21:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387815487] [2024-06-27 16:21:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:21:35,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:35,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387815487] [2024-06-27 16:21:35,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387815487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:35,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:21:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635873693] [2024-06-27 16:21:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:35,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:21:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:21:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:21:36,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-06-27 16:21:36,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:21:36,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:36,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-06-27 16:21:36,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand