./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.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/48_ticket_lock_low_contention_vs-pthread.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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:21:52,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:21:52,203 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:52,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:21:52,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:21:52,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:21:52,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:21:52,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:21:52,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:21:52,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:21:52,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:21:52,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:21:52,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:21:52,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:21:52,237 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:21:52,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:21:52,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:21:52,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:21:52,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:21:52,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:21:52,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:21:52,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:21:52,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:21:52,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:21:52,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:21:52,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:21:52,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:21:52,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:21:52,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:21:52,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:21:52,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:21:52,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:21:52,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:52,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:21:52,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:21:52,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:21:52,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:21:52,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:21:52,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:21:52,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:21:52,243 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:21:52,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:21:52,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:21:52,244 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2024-06-27 16:21:52,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:21:52,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:21:52,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:21:52,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:21:52,469 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:21:52,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-06-27 16:21:53,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:21:53,660 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:21:53,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-06-27 16:21:53,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32b20aea/423e8520196f4c9f950afa70ac860001/FLAG7fe8afa50 [2024-06-27 16:21:53,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32b20aea/423e8520196f4c9f950afa70ac860001 [2024-06-27 16:21:53,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:21:53,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:21:53,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:53,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:21:53,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:21:53,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:53" (1/1) ... [2024-06-27 16:21:53,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c797062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:53, skipping insertion in model container [2024-06-27 16:21:53,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:21:53" (1/1) ... [2024-06-27 16:21:53,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:21:53,968 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/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2024-06-27 16:21:53,982 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:53,996 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:21:54,045 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/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2024-06-27 16:21:54,053 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:21:54,087 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:21:54,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:54 WrapperNode [2024-06-27 16:21:54,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:21:54,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:54,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:21:54,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:21:54,094 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:54" (1/1) ... [2024-06-27 16:21:54,104 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:54" (1/1) ... [2024-06-27 16:21:54,121 INFO L138 Inliner]: procedures = 164, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-06-27 16:21:54,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:21:54,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:21:54,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:21:54,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:21:54,130 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:54" (1/1) ... [2024-06-27 16:21:54,130 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:54" (1/1) ... [2024-06-27 16:21:54,132 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:54" (1/1) ... [2024-06-27 16:21:54,141 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-06-27 16:21:54,142 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:54" (1/1) ... [2024-06-27 16:21:54,142 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:54" (1/1) ... [2024-06-27 16:21:54,146 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:54" (1/1) ... [2024-06-27 16:21:54,149 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:54" (1/1) ... [2024-06-27 16:21:54,150 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:54" (1/1) ... [2024-06-27 16:21:54,151 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:54" (1/1) ... [2024-06-27 16:21:54,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:21:54,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:21:54,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:21:54,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:21:54,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:54" (1/1) ... [2024-06-27 16:21:54,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:21:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:21:54,183 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:54,188 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:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-06-27 16:21:54,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-06-27 16:21:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 16:21:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:21:54,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:21:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:21:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 16:21:54,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:21:54,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:21:54,219 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:54,325 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:21:54,327 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:21:54,478 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:21:54,478 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:21:54,549 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:21:54,549 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-06-27 16:21:54,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:54 BoogieIcfgContainer [2024-06-27 16:21:54,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:21:54,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:21:54,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:21:54,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:21:54,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:21:53" (1/3) ... [2024-06-27 16:21:54,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f25e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:54, skipping insertion in model container [2024-06-27 16:21:54,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:21:54" (2/3) ... [2024-06-27 16:21:54,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f25e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:21:54, skipping insertion in model container [2024-06-27 16:21:54,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:21:54" (3/3) ... [2024-06-27 16:21:54,556 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-06-27 16:21:54,562 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:21:54,569 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:21:54,569 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 16:21:54,570 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:21:54,601 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:54,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 58 flow [2024-06-27 16:21:54,667 INFO L124 PetriNetUnfolderBase]: 5/41 cut-off events. [2024-06-27 16:21:54,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:54,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 41 events. 5/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 24. Up to 4 conditions per place. [2024-06-27 16:21:54,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 58 flow [2024-06-27 16:21:54,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 27 transitions, 58 flow [2024-06-27 16:21:54,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:54,706 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;@5eb887fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:54,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:21:54,712 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:54,712 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-06-27 16:21:54,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:54,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:54,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:54,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:21:54,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2071616802, now seen corresponding path program 1 times [2024-06-27 16:21:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828383886] [2024-06-27 16:21:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:54,884 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:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828383886] [2024-06-27 16:21:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828383886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:54,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:54,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296714574] [2024-06-27 16:21:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:54,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:21:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:21:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:21:54,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-06-27 16:21:54,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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:54,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:54,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-06-27 16:21:54,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:54,975 INFO L124 PetriNetUnfolderBase]: 32/133 cut-off events. [2024-06-27 16:21:54,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 16:21:54,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 133 events. 32/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 571 event pairs, 32 based on Foata normal form. 15/128 useless extension candidates. Maximal degree in co-relation 193. Up to 87 conditions per place. [2024-06-27 16:21:54,978 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 14 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2024-06-27 16:21:54,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 80 flow [2024-06-27 16:21:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:21:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:21:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2024-06-27 16:21:54,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-27 16:21:54,990 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 58 flow. Second operand 2 states and 37 transitions. [2024-06-27 16:21:54,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 80 flow [2024-06-27 16:21:54,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:54,994 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 52 flow [2024-06-27 16:21:54,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2024-06-27 16:21:55,000 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2024-06-27 16:21:55,002 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 52 flow [2024-06-27 16:21:55,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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:55,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:55,003 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2024-06-27 16:21:55,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:21:55,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:21:55,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2047487709, now seen corresponding path program 1 times [2024-06-27 16:21:55,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542685550] [2024-06-27 16:21:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:55,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:55,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:55,068 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:55,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-06-27 16:21:55,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-06-27 16:21:55,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-06-27 16:21:55,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-06-27 16:21:55,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:21:55,071 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-06-27 16:21:55,073 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:55,074 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-06-27 16:21:55,084 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:55,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 86 flow [2024-06-27 16:21:55,094 INFO L124 PetriNetUnfolderBase]: 8/66 cut-off events. [2024-06-27 16:21:55,094 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:21:55,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 8/66 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2024-06-27 16:21:55,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 86 flow [2024-06-27 16:21:55,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 38 transitions, 86 flow [2024-06-27 16:21:55,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:55,098 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;@5eb887fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:55,098 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:21:55,101 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:55,101 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-06-27 16:21:55,101 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:55,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:55,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:55,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:21:55,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1582043964, now seen corresponding path program 1 times [2024-06-27 16:21:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223333111] [2024-06-27 16:21:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:55,124 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:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223333111] [2024-06-27 16:21:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223333111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:55,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:55,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386625310] [2024-06-27 16:21:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:55,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:21:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:55,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:21:55,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:21:55,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2024-06-27 16:21:55,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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:55,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:55,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2024-06-27 16:21:55,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:55,299 INFO L124 PetriNetUnfolderBase]: 372/910 cut-off events. [2024-06-27 16:21:55,299 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-06-27 16:21:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 910 events. 372/910 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5893 event pairs, 372 based on Foata normal form. 126/909 useless extension candidates. Maximal degree in co-relation 1047. Up to 652 conditions per place. [2024-06-27 16:21:55,307 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 19 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2024-06-27 16:21:55,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 116 flow [2024-06-27 16:21:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:21:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:21:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2024-06-27 16:21:55,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973684210526315 [2024-06-27 16:21:55,313 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 86 flow. Second operand 2 states and 53 transitions. [2024-06-27 16:21:55,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 116 flow [2024-06-27 16:21:55,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:55,316 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 78 flow [2024-06-27 16:21:55,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-06-27 16:21:55,317 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 16:21:55,317 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 78 flow [2024-06-27 16:21:55,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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:55,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:55,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:55,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:21:55,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:21:55,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1093272610, now seen corresponding path program 1 times [2024-06-27 16:21:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372301310] [2024-06-27 16:21:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:55,420 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:55,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372301310] [2024-06-27 16:21:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372301310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:55,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:55,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:21:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214874136] [2024-06-27 16:21:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:55,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:55,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-06-27 16:21:55,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:55,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:55,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-06-27 16:21:55,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:55,644 INFO L124 PetriNetUnfolderBase]: 967/1933 cut-off events. [2024-06-27 16:21:55,645 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-06-27 16:21:55,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1933 events. 967/1933 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12615 event pairs, 612 based on Foata normal form. 191/2066 useless extension candidates. Maximal degree in co-relation 3590. Up to 1239 conditions per place. [2024-06-27 16:21:55,653 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 39 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2024-06-27 16:21:55,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 213 flow [2024-06-27 16:21:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 16:21:55,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-06-27 16:21:55,657 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 78 flow. Second operand 3 states and 75 transitions. [2024-06-27 16:21:55,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 213 flow [2024-06-27 16:21:55,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:55,660 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 132 flow [2024-06-27 16:21:55,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2024-06-27 16:21:55,662 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-06-27 16:21:55,662 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 132 flow [2024-06-27 16:21:55,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:55,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:55,663 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1] [2024-06-27 16:21:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:21:55,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:21:55,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash -139676563, now seen corresponding path program 1 times [2024-06-27 16:21:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254975850] [2024-06-27 16:21:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:55,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:55,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:55,704 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:55,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-06-27 16:21:55,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-06-27 16:21:55,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-06-27 16:21:55,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-06-27 16:21:55,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-06-27 16:21:55,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:21:55,706 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:21:55,707 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:55,707 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-06-27 16:21:55,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:55,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 116 flow [2024-06-27 16:21:55,737 INFO L124 PetriNetUnfolderBase]: 11/91 cut-off events. [2024-06-27 16:21:55,737 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-27 16:21:55,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 91 events. 11/91 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 310 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 72. Up to 8 conditions per place. [2024-06-27 16:21:55,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 49 transitions, 116 flow [2024-06-27 16:21:55,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 49 transitions, 116 flow [2024-06-27 16:21:55,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:55,766 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;@5eb887fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:55,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-27 16:21:55,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:55,770 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-06-27 16:21:55,770 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:55,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:55,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:55,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:21:55,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 405552789, now seen corresponding path program 1 times [2024-06-27 16:21:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:55,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129954107] [2024-06-27 16:21:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:55,795 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:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129954107] [2024-06-27 16:21:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129954107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:55,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:55,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:55,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898091525] [2024-06-27 16:21:55,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:55,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:21:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:55,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:21:55,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:21:55,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-06-27 16:21:55,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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:55,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:55,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-06-27 16:21:55,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:56,239 INFO L124 PetriNetUnfolderBase]: 2972/5695 cut-off events. [2024-06-27 16:21:56,239 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-27 16:21:56,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10193 conditions, 5695 events. 2972/5695 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 43991 event pairs, 2972 based on Foata normal form. 918/5958 useless extension candidates. Maximal degree in co-relation 2405. Up to 4377 conditions per place. [2024-06-27 16:21:56,269 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 24 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2024-06-27 16:21:56,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 154 flow [2024-06-27 16:21:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:21:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:21:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2024-06-27 16:21:56,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2024-06-27 16:21:56,274 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 116 flow. Second operand 2 states and 69 transitions. [2024-06-27 16:21:56,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 154 flow [2024-06-27 16:21:56,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 152 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:56,277 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 104 flow [2024-06-27 16:21:56,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-27 16:21:56,279 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2024-06-27 16:21:56,279 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 104 flow [2024-06-27 16:21:56,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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:56,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:56,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:56,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:21:56,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:21:56,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 392684638, now seen corresponding path program 1 times [2024-06-27 16:21:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:56,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114925751] [2024-06-27 16:21:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:56,352 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:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114925751] [2024-06-27 16:21:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114925751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:21:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607405027] [2024-06-27 16:21:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:56,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:21:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:21:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:21:56,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-06-27 16:21:56,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:56,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:56,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-06-27 16:21:56,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:21:57,683 INFO L124 PetriNetUnfolderBase]: 12179/20345 cut-off events. [2024-06-27 16:21:57,683 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-06-27 16:21:57,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38104 conditions, 20345 events. 12179/20345 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 162772 event pairs, 7347 based on Foata normal form. 1919/21798 useless extension candidates. Maximal degree in co-relation 38098. Up to 12688 conditions per place. [2024-06-27 16:21:57,796 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 50 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2024-06-27 16:21:57,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 282 flow [2024-06-27 16:21:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:21:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:21:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 16:21:57,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 16:21:57,800 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 104 flow. Second operand 3 states and 98 transitions. [2024-06-27 16:21:57,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 282 flow [2024-06-27 16:21:57,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:21:57,803 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 176 flow [2024-06-27 16:21:57,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2024-06-27 16:21:57,805 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-06-27 16:21:57,805 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 176 flow [2024-06-27 16:21:57,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:57,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:57,806 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2024-06-27 16:21:57,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:21:57,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-06-27 16:21:57,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash -497894503, now seen corresponding path program 1 times [2024-06-27 16:21:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:57,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815033049] [2024-06-27 16:21:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:57,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:21:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:21:57,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:21:57,837 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:21:57,837 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-06-27 16:21:57,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-06-27 16:21:57,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-06-27 16:21:57,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-06-27 16:21:57,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-06-27 16:21:57,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-06-27 16:21:57,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:21:57,838 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:21:57,839 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:21:57,839 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-06-27 16:21:57,853 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:21:57,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 148 flow [2024-06-27 16:21:57,860 INFO L124 PetriNetUnfolderBase]: 14/116 cut-off events. [2024-06-27 16:21:57,860 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-06-27 16:21:57,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 116 events. 14/116 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 417 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 102. Up to 10 conditions per place. [2024-06-27 16:21:57,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 148 flow [2024-06-27 16:21:57,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 60 transitions, 148 flow [2024-06-27 16:21:57,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:21:57,862 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;@5eb887fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:21:57,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 16:21:57,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:21:57,864 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-06-27 16:21:57,864 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:21:57,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:21:57,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:21:57,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 16:21:57,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:21:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash -403793839, now seen corresponding path program 1 times [2024-06-27 16:21:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:21:57,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466064038] [2024-06-27 16:21:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:21:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:21:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:21:57,873 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:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:21:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466064038] [2024-06-27 16:21:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466064038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:21:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:21:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:21:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889386818] [2024-06-27 16:21:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:21:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:21:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:21:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:21:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:21:57,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2024-06-27 16:21:57,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 148 flow. Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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:57,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:21:57,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2024-06-27 16:21:57,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:00,069 INFO L124 PetriNetUnfolderBase]: 20472/34284 cut-off events. [2024-06-27 16:22:00,070 INFO L125 PetriNetUnfolderBase]: For 1815/1815 co-relation queries the response was YES. [2024-06-27 16:22:00,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62533 conditions, 34284 events. 20472/34284 cut-off events. For 1815/1815 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 296446 event pairs, 20472 based on Foata normal form. 6043/37036 useless extension candidates. Maximal degree in co-relation 10265. Up to 27502 conditions per place. [2024-06-27 16:22:00,256 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 29 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2024-06-27 16:22:00,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 194 flow [2024-06-27 16:22:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:22:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:22:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2024-06-27 16:22:00,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-06-27 16:22:00,257 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 148 flow. Second operand 2 states and 85 transitions. [2024-06-27 16:22:00,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 194 flow [2024-06-27 16:22:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 188 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 16:22:00,260 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 130 flow [2024-06-27 16:22:00,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-06-27 16:22:00,261 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2024-06-27 16:22:00,261 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 130 flow [2024-06-27 16:22:00,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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:22:00,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:00,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:22:00,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 16:22:00,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1072743006, now seen corresponding path program 1 times [2024-06-27 16:22:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981529781] [2024-06-27 16:22:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:00,294 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:22:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:00,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981529781] [2024-06-27 16:22:00,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981529781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:00,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:22:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383080268] [2024-06-27 16:22:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:00,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:00,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 60 [2024-06-27 16:22:00,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:22:00,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:00,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 60 [2024-06-27 16:22:00,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:10,383 INFO L124 PetriNetUnfolderBase]: 129035/194871 cut-off events. [2024-06-27 16:22:10,383 INFO L125 PetriNetUnfolderBase]: For 2050/2050 co-relation queries the response was YES. [2024-06-27 16:22:10,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367575 conditions, 194871 events. 129035/194871 cut-off events. For 2050/2050 co-relation queries the response was YES. Maximal size of possible extension queue 7300. Compared 1744695 event pairs, 75131 based on Foata normal form. 17945/209104 useless extension candidates. Maximal degree in co-relation 367568. Up to 118406 conditions per place. [2024-06-27 16:22:11,610 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 61 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2024-06-27 16:22:11,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 351 flow [2024-06-27 16:22:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:22:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:22:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-06-27 16:22:11,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2024-06-27 16:22:11,613 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 130 flow. Second operand 3 states and 121 transitions. [2024-06-27 16:22:11,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 351 flow [2024-06-27 16:22:11,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 86 transitions, 351 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:22:11,620 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 220 flow [2024-06-27 16:22:11,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-06-27 16:22:11,620 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2024-06-27 16:22:11,621 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 220 flow [2024-06-27 16:22:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:22:11,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:11,621 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:22:11,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 16:22:11,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 135108864, now seen corresponding path program 1 times [2024-06-27 16:22:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155795651] [2024-06-27 16:22:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:22:11,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 16:22:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 16:22:11,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 16:22:11,651 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 16:22:11,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-06-27 16:22:11,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 16:22:11,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-06-27 16:22:11,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-06-27 16:22:11,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-06-27 16:22:11,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-06-27 16:22:11,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 16:22:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:22:11,653 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-06-27 16:22:11,653 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-06-27 16:22:11,653 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-06-27 16:22:11,676 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 16:22:11,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 71 transitions, 182 flow [2024-06-27 16:22:11,685 INFO L124 PetriNetUnfolderBase]: 17/141 cut-off events. [2024-06-27 16:22:11,685 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-27 16:22:11,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 141 events. 17/141 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 522 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 133. Up to 12 conditions per place. [2024-06-27 16:22:11,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 71 transitions, 182 flow [2024-06-27 16:22:11,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 71 transitions, 182 flow [2024-06-27 16:22:11,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:22:11,691 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;@5eb887fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:22:11,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 16:22:11,694 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:22:11,694 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-06-27 16:22:11,694 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 16:22:11,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:11,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:11,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-06-27 16:22:11,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash 284883448, now seen corresponding path program 1 times [2024-06-27 16:22:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296005726] [2024-06-27 16:22:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:11,707 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:22:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296005726] [2024-06-27 16:22:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296005726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:11,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:22:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781976779] [2024-06-27 16:22:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:11,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:22:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:22:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:22:11,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 71 [2024-06-27 16:22:11,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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:22:11,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:11,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 71 [2024-06-27 16:22:11,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:22:23,871 INFO L124 PetriNetUnfolderBase]: 130472/199729 cut-off events. [2024-06-27 16:22:23,871 INFO L125 PetriNetUnfolderBase]: For 14310/14310 co-relation queries the response was YES. [2024-06-27 16:22:24,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369854 conditions, 199729 events. 130472/199729 cut-off events. For 14310/14310 co-relation queries the response was YES. Maximal size of possible extension queue 7137. Compared 1843324 event pairs, 130472 based on Foata normal form. 37293/220551 useless extension candidates. Maximal degree in co-relation 62729. Up to 165627 conditions per place. [2024-06-27 16:22:25,126 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 34 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2024-06-27 16:22:25,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 236 flow [2024-06-27 16:22:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:22:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:22:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 101 transitions. [2024-06-27 16:22:25,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2024-06-27 16:22:25,128 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 182 flow. Second operand 2 states and 101 transitions. [2024-06-27 16:22:25,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 236 flow [2024-06-27 16:22:25,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 64 transitions, 224 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 16:22:25,132 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 156 flow [2024-06-27 16:22:25,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-27 16:22:25,132 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2024-06-27 16:22:25,132 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 156 flow [2024-06-27 16:22:25,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 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:22:25,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:22:25,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:22:25,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:22:25,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-06-27 16:22:25,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:22:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 946902494, now seen corresponding path program 1 times [2024-06-27 16:22:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:22:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022372100] [2024-06-27 16:22:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:22:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:22:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:22:25,156 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:22:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:22:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022372100] [2024-06-27 16:22:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022372100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:22:25,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:22:25,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:22:25,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612402251] [2024-06-27 16:22:25,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:22:25,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:22:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:22:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:22:25,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:22:25,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 71 [2024-06-27 16:22:25,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:22:25,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:22:25,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 71 [2024-06-27 16:22:25,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand