./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 389f5b7d6579b5ac06564f3c82f3f69fea502868b761df6187d49f96e1a317cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:11:41,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:11:41,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:11:41,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:11:41,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:11:41,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:11:41,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:11:41,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:11:41,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:11:41,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:11:41,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:11:41,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:11:41,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:11:41,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:11:41,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:11:41,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:11:41,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:11:41,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:11:41,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:11:41,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:11:41,624 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:11:41,624 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:11:41,625 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:11:41,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:11:41,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:11:41,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:11:41,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:11:41,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:11:41,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:11:41,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:11:41,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:11:41,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:11:41,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:11:41,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:11:41,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:11:41,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:11:41,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:11:41,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:11:41,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:11:41,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:11:41,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:11:41,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:11:41,629 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 389f5b7d6579b5ac06564f3c82f3f69fea502868b761df6187d49f96e1a317cd [2024-10-13 12:11:41,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:11:41,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:11:41,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:11:41,891 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:11:41,892 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:11:41,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i [2024-10-13 12:11:43,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:11:43,479 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:11:43,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs-pthread.i [2024-10-13 12:11:43,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a092c187c/4a3b782729ce41c88bff52d33fe275aa/FLAG53ce6729d [2024-10-13 12:11:43,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a092c187c/4a3b782729ce41c88bff52d33fe275aa [2024-10-13 12:11:43,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:11:43,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:11:43,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:11:43,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:11:43,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:11:43,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:11:43" (1/1) ... [2024-10-13 12:11:43,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68495b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:43, skipping insertion in model container [2024-10-13 12:11:43,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:11:43" (1/1) ... [2024-10-13 12:11:43,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:11:43,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:11:43,864 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:11:43,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:11:44,030 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:11:44,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44 WrapperNode [2024-10-13 12:11:44,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:11:44,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:11:44,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:11:44,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:11:44,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,069 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2024-10-13 12:11:44,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:11:44,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:11:44,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:11:44,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:11:44,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,094 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-10-13 12:11:44,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:11:44,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:11:44,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:11:44,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:11:44,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (1/1) ... [2024-10-13 12:11:44,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:11:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:11:44,145 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-10-13 12:11:44,147 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-10-13 12:11:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-13 12:11:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-13 12:11:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-13 12:11:44,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-13 12:11:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:11:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:11:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:11:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 12:11:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:11:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:11:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:11:44,193 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:11:44,324 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:11:44,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:11:44,444 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:11:44,444 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:11:44,553 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:11:44,553 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 12:11:44,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:44 BoogieIcfgContainer [2024-10-13 12:11:44,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:11:44,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:11:44,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:11:44,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:11:44,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:11:43" (1/3) ... [2024-10-13 12:11:44,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79acb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:44, skipping insertion in model container [2024-10-13 12:11:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:11:44" (2/3) ... [2024-10-13 12:11:44,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79acb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:44, skipping insertion in model container [2024-10-13 12:11:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:44" (3/3) ... [2024-10-13 12:11:44,562 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs-pthread.i [2024-10-13 12:11:44,577 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:11:44,577 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:11:44,578 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:11:44,613 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:11:44,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 70 flow [2024-10-13 12:11:44,669 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-10-13 12:11:44,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:44,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 4/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 95 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-10-13 12:11:44,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 70 flow [2024-10-13 12:11:44,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 30 transitions, 67 flow [2024-10-13 12:11:44,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:11:44,687 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@39722c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:11:44,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-13 12:11:44,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:11:44,693 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-13 12:11:44,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:44,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:44,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:11:44,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:11:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 206163919, now seen corresponding path program 1 times [2024-10-13 12:11:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:44,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096228641] [2024-10-13 12:11:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096228641] [2024-10-13 12:11:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096228641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:44,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066390156] [2024-10-13 12:11:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:11:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:44,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:11:44,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:11:44,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2024-10-13 12:11:44,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-13 12:11:44,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:44,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2024-10-13 12:11:44,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:44,959 INFO L124 PetriNetUnfolderBase]: 79/166 cut-off events. [2024-10-13 12:11:44,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:44,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 166 events. 79/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 720 event pairs, 66 based on Foata normal form. 44/202 useless extension candidates. Maximal degree in co-relation 305. Up to 136 conditions per place. [2024-10-13 12:11:44,963 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 12 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2024-10-13 12:11:44,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 75 flow [2024-10-13 12:11:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:11:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:11:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2024-10-13 12:11:44,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-10-13 12:11:44,975 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 67 flow. Second operand 2 states and 41 transitions. [2024-10-13 12:11:44,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 75 flow [2024-10-13 12:11:44,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:11:44,979 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 50 flow [2024-10-13 12:11:44,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2024-10-13 12:11:44,984 INFO L277 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2024-10-13 12:11:44,986 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 50 flow [2024-10-13 12:11:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10-13 12:11:44,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:44,987 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:11:44,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:11:44,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:44,988 INFO L85 PathProgramCache]: Analyzing trace with hash 26218542, now seen corresponding path program 1 times [2024-10-13 12:11:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734137721] [2024-10-13 12:11:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:45,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:11:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:45,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:11:45,072 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:11:45,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-13 12:11:45,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-10-13 12:11:45,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-10-13 12:11:45,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-10-13 12:11:45,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-10-13 12:11:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:11:45,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 12:11:45,079 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:11:45,079 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 12:11:45,100 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:11:45,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 126 flow [2024-10-13 12:11:45,113 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2024-10-13 12:11:45,114 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:11:45,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 129 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2024-10-13 12:11:45,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 53 transitions, 126 flow [2024-10-13 12:11:45,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 87 flow [2024-10-13 12:11:45,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:11:45,123 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@39722c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:11:45,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 12:11:45,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:11:45,131 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-13 12:11:45,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:45,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:45,131 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:11:45,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:11:45,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash 257367695, now seen corresponding path program 1 times [2024-10-13 12:11:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521258559] [2024-10-13 12:11:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:45,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:45,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521258559] [2024-10-13 12:11:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521258559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926444345] [2024-10-13 12:11:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:45,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:11:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:45,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:11:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:11:45,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-10-13 12:11:45,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 87 flow. Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-10-13 12:11:45,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:45,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-10-13 12:11:45,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:45,389 INFO L124 PetriNetUnfolderBase]: 559/918 cut-off events. [2024-10-13 12:11:45,390 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-13 12:11:45,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 918 events. 559/918 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4736 event pairs, 450 based on Foata normal form. 188/1090 useless extension candidates. Maximal degree in co-relation 1769. Up to 800 conditions per place. [2024-10-13 12:11:45,404 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 16 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2024-10-13 12:11:45,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 101 flow [2024-10-13 12:11:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:11:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:11:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2024-10-13 12:11:45,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-10-13 12:11:45,409 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 87 flow. Second operand 2 states and 64 transitions. [2024-10-13 12:11:45,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 101 flow [2024-10-13 12:11:45,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:11:45,410 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 68 flow [2024-10-13 12:11:45,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2024-10-13 12:11:45,413 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2024-10-13 12:11:45,413 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 68 flow [2024-10-13 12:11:45,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-10-13 12:11:45,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:45,413 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:45,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:11:45,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:11:45,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -823457228, now seen corresponding path program 1 times [2024-10-13 12:11:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270049234] [2024-10-13 12:11:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270049234] [2024-10-13 12:11:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270049234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004104858] [2024-10-13 12:11:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:11:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:11:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:11:45,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-10-13 12:11:45,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-13 12:11:45,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:45,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-10-13 12:11:45,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:45,700 INFO L124 PetriNetUnfolderBase]: 620/1066 cut-off events. [2024-10-13 12:11:45,700 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-13 12:11:45,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 1066 events. 620/1066 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5945 event pairs, 139 based on Foata normal form. 20/1077 useless extension candidates. Maximal degree in co-relation 2027. Up to 760 conditions per place. [2024-10-13 12:11:45,709 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 22 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2024-10-13 12:11:45,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 141 flow [2024-10-13 12:11:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:11:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:11:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-13 12:11:45,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.559748427672956 [2024-10-13 12:11:45,713 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 68 flow. Second operand 3 states and 89 transitions. [2024-10-13 12:11:45,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 141 flow [2024-10-13 12:11:45,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 141 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:11:45,716 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 87 flow [2024-10-13 12:11:45,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2024-10-13 12:11:45,717 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-10-13 12:11:45,718 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 87 flow [2024-10-13 12:11:45,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-13 12:11:45,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:45,719 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:45,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:11:45,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:11:45,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:45,720 INFO L85 PathProgramCache]: Analyzing trace with hash -212865088, now seen corresponding path program 1 times [2024-10-13 12:11:45,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:45,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885316924] [2024-10-13 12:11:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:45,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:11:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:45,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:11:45,765 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:11:45,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-13 12:11:45,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-13 12:11:45,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-13 12:11:45,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-13 12:11:45,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-10-13 12:11:45,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-13 12:11:45,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:11:45,768 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 12:11:45,768 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:11:45,768 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 12:11:45,811 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:11:45,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 186 flow [2024-10-13 12:11:45,822 INFO L124 PetriNetUnfolderBase]: 6/58 cut-off events. [2024-10-13 12:11:45,822 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 12:11:45,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 58 events. 6/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 160 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2024-10-13 12:11:45,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 186 flow [2024-10-13 12:11:45,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 44 transitions, 109 flow [2024-10-13 12:11:45,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:11:45,827 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@39722c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:11:45,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:11:45,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:11:45,830 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-13 12:11:45,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:45,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:45,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:11:45,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:11:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash 329566181, now seen corresponding path program 1 times [2024-10-13 12:11:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:45,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73260141] [2024-10-13 12:11:45,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73260141] [2024-10-13 12:11:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73260141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115380491] [2024-10-13 12:11:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:45,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:11:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:11:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:11:45,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-10-13 12:11:45,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 109 flow. Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-10-13 12:11:45,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:45,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-10-13 12:11:45,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:46,257 INFO L124 PetriNetUnfolderBase]: 3247/4710 cut-off events. [2024-10-13 12:11:46,259 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2024-10-13 12:11:46,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 4710 events. 3247/4710 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 26567 event pairs, 2562 based on Foata normal form. 763/5404 useless extension candidates. Maximal degree in co-relation 9241. Up to 4224 conditions per place. [2024-10-13 12:11:46,296 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 20 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2024-10-13 12:11:46,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 129 flow [2024-10-13 12:11:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:11:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:11:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2024-10-13 12:11:46,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-10-13 12:11:46,302 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 109 flow. Second operand 2 states and 87 transitions. [2024-10-13 12:11:46,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 129 flow [2024-10-13 12:11:46,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:11:46,304 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 86 flow [2024-10-13 12:11:46,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=86, 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=86, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-10-13 12:11:46,305 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2024-10-13 12:11:46,305 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 86 flow [2024-10-13 12:11:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-10-13 12:11:46,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:46,306 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:11:46,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:11:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2086411230, now seen corresponding path program 1 times [2024-10-13 12:11:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958875425] [2024-10-13 12:11:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:46,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:46,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958875425] [2024-10-13 12:11:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958875425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:46,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846469443] [2024-10-13 12:11:46,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:46,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:11:46,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:11:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:11:46,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-10-13 12:11:46,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-13 12:11:46,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:46,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-10-13 12:11:46,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:46,808 INFO L124 PetriNetUnfolderBase]: 3515/5257 cut-off events. [2024-10-13 12:11:46,808 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2024-10-13 12:11:46,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10163 conditions, 5257 events. 3515/5257 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 31416 event pairs, 724 based on Foata normal form. 44/5273 useless extension candidates. Maximal degree in co-relation 10157. Up to 4267 conditions per place. [2024-10-13 12:11:46,848 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 28 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-10-13 12:11:46,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 184 flow [2024-10-13 12:11:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:11:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:11:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-13 12:11:46,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-10-13 12:11:46,851 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 86 flow. Second operand 3 states and 123 transitions. [2024-10-13 12:11:46,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 184 flow [2024-10-13 12:11:46,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:11:46,853 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 112 flow [2024-10-13 12:11:46,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-10-13 12:11:46,854 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-10-13 12:11:46,855 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 112 flow [2024-10-13 12:11:46,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-13 12:11:46,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:46,856 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:46,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:11:46,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:11:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:46,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1401397513, now seen corresponding path program 1 times [2024-10-13 12:11:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166361440] [2024-10-13 12:11:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:46,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:46,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:11:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:46,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:11:46,886 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:11:46,888 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-13 12:11:46,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:11:46,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:11:46,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-13 12:11:46,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-10-13 12:11:46,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-10-13 12:11:46,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:11:46,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:11:46,891 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 12:11:46,891 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:11:46,891 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-13 12:11:46,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:11:46,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 97 transitions, 250 flow [2024-10-13 12:11:46,928 INFO L124 PetriNetUnfolderBase]: 7/70 cut-off events. [2024-10-13 12:11:46,929 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-13 12:11:46,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 70 events. 7/70 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 86. Up to 5 conditions per place. [2024-10-13 12:11:46,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 97 transitions, 250 flow [2024-10-13 12:11:46,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 133 flow [2024-10-13 12:11:46,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:11:46,932 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@39722c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:11:46,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:11:46,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:11:46,933 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-13 12:11:46,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:46,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:46,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:11:46,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:11:46,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 422759377, now seen corresponding path program 1 times [2024-10-13 12:11:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534659196] [2024-10-13 12:11:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534659196] [2024-10-13 12:11:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534659196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575352034] [2024-10-13 12:11:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:46,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:11:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:11:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:11:46,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-10-13 12:11:46,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 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-10-13 12:11:46,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:46,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-10-13 12:11:46,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:49,044 INFO L124 PetriNetUnfolderBase]: 17071/22950 cut-off events. [2024-10-13 12:11:49,044 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2024-10-13 12:11:49,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45542 conditions, 22950 events. 17071/22950 cut-off events. For 4208/4208 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 134440 event pairs, 13314 based on Foata normal form. 3067/25760 useless extension candidates. Maximal degree in co-relation 45529. Up to 20992 conditions per place. [2024-10-13 12:11:49,338 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 24 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2024-10-13 12:11:49,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 159 flow [2024-10-13 12:11:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:11:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:11:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2024-10-13 12:11:49,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5670103092783505 [2024-10-13 12:11:49,340 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 133 flow. Second operand 2 states and 110 transitions. [2024-10-13 12:11:49,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 159 flow [2024-10-13 12:11:49,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 152 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-10-13 12:11:49,350 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 104 flow [2024-10-13 12:11:49,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-10-13 12:11:49,351 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2024-10-13 12:11:49,352 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 104 flow [2024-10-13 12:11:49,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 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-10-13 12:11:49,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:49,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:49,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:11:49,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:11:49,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2065459860, now seen corresponding path program 1 times [2024-10-13 12:11:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:49,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346426947] [2024-10-13 12:11:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346426947] [2024-10-13 12:11:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346426947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:49,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375726937] [2024-10-13 12:11:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:11:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:11:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:11:49,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-10-13 12:11:49,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10-13 12:11:49,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:49,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-10-13 12:11:49,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:51,059 INFO L124 PetriNetUnfolderBase]: 17930/24628 cut-off events. [2024-10-13 12:11:51,060 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2024-10-13 12:11:51,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47982 conditions, 24628 events. 17930/24628 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 151414 event pairs, 3961 based on Foata normal form. 92/24656 useless extension candidates. Maximal degree in co-relation 47975. Up to 21382 conditions per place. [2024-10-13 12:11:51,244 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 34 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-10-13 12:11:51,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 227 flow [2024-10-13 12:11:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:11:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:11:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2024-10-13 12:11:51,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395189003436426 [2024-10-13 12:11:51,249 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 104 flow. Second operand 3 states and 157 transitions. [2024-10-13 12:11:51,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 227 flow [2024-10-13 12:11:51,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:11:51,251 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 137 flow [2024-10-13 12:11:51,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-10-13 12:11:51,252 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-10-13 12:11:51,254 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 137 flow [2024-10-13 12:11:51,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10-13 12:11:51,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:51,254 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:11:51,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:11:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 862871265, now seen corresponding path program 1 times [2024-10-13 12:11:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003957938] [2024-10-13 12:11:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003957938] [2024-10-13 12:11:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003957938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:11:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069144789] [2024-10-13 12:11:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:11:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:11:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:11:51,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-10-13 12:11:51,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-10-13 12:11:51,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:51,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-10-13 12:11:51,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:51,610 INFO L124 PetriNetUnfolderBase]: 1187/2607 cut-off events. [2024-10-13 12:11:51,611 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2024-10-13 12:11:51,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 2607 events. 1187/2607 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17893 event pairs, 260 based on Foata normal form. 2076/4645 useless extension candidates. Maximal degree in co-relation 5677. Up to 1627 conditions per place. [2024-10-13 12:11:51,634 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 25 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-10-13 12:11:51,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 239 flow [2024-10-13 12:11:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:11:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:11:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-10-13 12:11:51,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2024-10-13 12:11:51,636 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 137 flow. Second operand 3 states and 153 transitions. [2024-10-13 12:11:51,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 239 flow [2024-10-13 12:11:51,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:11:51,638 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 152 flow [2024-10-13 12:11:51,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-10-13 12:11:51,639 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2024-10-13 12:11:51,639 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 152 flow [2024-10-13 12:11:51,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-10-13 12:11:51,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:51,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:51,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:11:51,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:11:51,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1203977249, now seen corresponding path program 1 times [2024-10-13 12:11:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:51,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73600448] [2024-10-13 12:11:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73600448] [2024-10-13 12:11:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73600448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:51,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:51,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:11:51,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83306471] [2024-10-13 12:11:51,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:51,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:11:51,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:11:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:11:51,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-10-13 12:11:51,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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-10-13 12:11:51,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:51,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-10-13 12:11:51,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:52,134 INFO L124 PetriNetUnfolderBase]: 1731/3694 cut-off events. [2024-10-13 12:11:52,134 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-10-13 12:11:52,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9331 conditions, 3694 events. 1731/3694 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 26957 event pairs, 86 based on Foata normal form. 30/3714 useless extension candidates. Maximal degree in co-relation 9322. Up to 2243 conditions per place. [2024-10-13 12:11:52,158 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 49 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2024-10-13 12:11:52,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 398 flow [2024-10-13 12:11:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:11:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:11:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2024-10-13 12:11:52,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5541237113402062 [2024-10-13 12:11:52,160 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 152 flow. Second operand 4 states and 215 transitions. [2024-10-13 12:11:52,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 398 flow [2024-10-13 12:11:52,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:11:52,164 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 194 flow [2024-10-13 12:11:52,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-10-13 12:11:52,165 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2024-10-13 12:11:52,165 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 194 flow [2024-10-13 12:11:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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-10-13 12:11:52,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:52,166 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:11:52,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:11:52,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:11:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 360081993, now seen corresponding path program 1 times [2024-10-13 12:11:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:52,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078176186] [2024-10-13 12:11:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:52,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:11:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:11:52,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:11:52,194 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:11:52,194 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-13 12:11:52,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:11:52,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-13 12:11:52,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:11:52,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2024-10-13 12:11:52,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2024-10-13 12:11:52,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-10-13 12:11:52,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:11:52,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:11:52,195 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 12:11:52,196 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:11:52,196 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-13 12:11:52,226 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:11:52,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 119 transitions, 318 flow [2024-10-13 12:11:52,235 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2024-10-13 12:11:52,235 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-13 12:11:52,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 82 events. 8/82 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 104. Up to 6 conditions per place. [2024-10-13 12:11:52,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 119 transitions, 318 flow [2024-10-13 12:11:52,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 58 transitions, 159 flow [2024-10-13 12:11:52,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:11:52,239 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@39722c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:11:52,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-13 12:11:52,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:11:52,240 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-10-13 12:11:52,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:11:52,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:11:52,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:11:52,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-13 12:11:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:11:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 536947283, now seen corresponding path program 1 times [2024-10-13 12:11:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:11:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186087541] [2024-10-13 12:11:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:11:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:11:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:11:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:11:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:11:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186087541] [2024-10-13 12:11:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186087541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:11:52,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:11:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:11:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369167803] [2024-10-13 12:11:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:11:52,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:11:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:11:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:11:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:11:52,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-10-13 12:11:52,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 159 flow. Second operand has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:11:52,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:11:52,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-10-13 12:11:52,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:11:59,958 INFO L124 PetriNetUnfolderBase]: 84655/108198 cut-off events. [2024-10-13 12:11:59,958 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2024-10-13 12:12:00,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216295 conditions, 108198 events. 84655/108198 cut-off events. For 26992/26992 co-relation queries the response was YES. Maximal size of possible extension queue 3774. Compared 644634 event pairs, 65538 based on Foata normal form. 12284/119458 useless extension candidates. Maximal degree in co-relation 216281. Up to 100352 conditions per place. [2024-10-13 12:12:00,991 INFO L140 encePairwiseOnDemand]: 110/119 looper letters, 28 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-10-13 12:12:00,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 191 flow [2024-10-13 12:12:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:12:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:12:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 133 transitions. [2024-10-13 12:12:00,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2024-10-13 12:12:00,993 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 159 flow. Second operand 2 states and 133 transitions. [2024-10-13 12:12:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 191 flow [2024-10-13 12:12:01,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 178 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-13 12:12:01,008 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 122 flow [2024-10-13 12:12:01,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-10-13 12:12:01,009 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2024-10-13 12:12:01,009 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 122 flow [2024-10-13 12:12:01,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:01,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:01,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:12:01,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-13 12:12:01,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -211440730, now seen corresponding path program 1 times [2024-10-13 12:12:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811862469] [2024-10-13 12:12:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811862469] [2024-10-13 12:12:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811862469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:01,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818079547] [2024-10-13 12:12:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:01,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:01,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-10-13 12:12:01,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10-13 12:12:01,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:01,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-10-13 12:12:01,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:08,397 INFO L124 PetriNetUnfolderBase]: 87029/112963 cut-off events. [2024-10-13 12:12:08,398 INFO L125 PetriNetUnfolderBase]: For 5082/5082 co-relation queries the response was YES. [2024-10-13 12:12:08,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221185 conditions, 112963 events. 87029/112963 cut-off events. For 5082/5082 co-relation queries the response was YES. Maximal size of possible extension queue 4061. Compared 704775 event pairs, 21478 based on Foata normal form. 188/112989 useless extension candidates. Maximal degree in co-relation 221177. Up to 101893 conditions per place. [2024-10-13 12:12:09,635 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 40 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2024-10-13 12:12:09,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 270 flow [2024-10-13 12:12:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-10-13 12:12:09,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5350140056022409 [2024-10-13 12:12:09,636 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 122 flow. Second operand 3 states and 191 transitions. [2024-10-13 12:12:09,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 270 flow [2024-10-13 12:12:09,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:09,643 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 162 flow [2024-10-13 12:12:09,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-10-13 12:12:09,644 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2024-10-13 12:12:09,644 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 162 flow [2024-10-13 12:12:09,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-10-13 12:12:09,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:09,644 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:09,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:12:09,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-13 12:12:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2072609719, now seen corresponding path program 1 times [2024-10-13 12:12:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:09,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197196510] [2024-10-13 12:12:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:09,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197196510] [2024-10-13 12:12:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197196510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:09,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:09,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:12:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890564052] [2024-10-13 12:12:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:09,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-10-13 12:12:09,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-10-13 12:12:09,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:09,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-10-13 12:12:09,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:10,072 INFO L124 PetriNetUnfolderBase]: 2900/6135 cut-off events. [2024-10-13 12:12:10,072 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2024-10-13 12:12:10,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13499 conditions, 6135 events. 2900/6135 cut-off events. For 1688/1688 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 47720 event pairs, 648 based on Foata normal form. 6162/12226 useless extension candidates. Maximal degree in co-relation 13489. Up to 3945 conditions per place. [2024-10-13 12:12:10,124 INFO L140 encePairwiseOnDemand]: 107/119 looper letters, 29 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-10-13 12:12:10,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 283 flow [2024-10-13 12:12:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2024-10-13 12:12:10,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2024-10-13 12:12:10,126 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 162 flow. Second operand 3 states and 186 transitions. [2024-10-13 12:12:10,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 283 flow [2024-10-13 12:12:10,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:12:10,131 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 180 flow [2024-10-13 12:12:10,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-10-13 12:12:10,132 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-10-13 12:12:10,132 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 180 flow [2024-10-13 12:12:10,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-10-13 12:12:10,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:10,133 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:10,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:12:10,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-13 12:12:10,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash -592232358, now seen corresponding path program 1 times [2024-10-13 12:12:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:10,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283591993] [2024-10-13 12:12:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:10,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283591993] [2024-10-13 12:12:10,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283591993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:10,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:12:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992069550] [2024-10-13 12:12:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:10,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:12:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:10,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:12:10,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:12:10,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-10-13 12:12:10,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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-10-13 12:12:10,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:10,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-10-13 12:12:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:10,833 INFO L124 PetriNetUnfolderBase]: 4045/8235 cut-off events. [2024-10-13 12:12:10,833 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2024-10-13 12:12:10,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21131 conditions, 8235 events. 4045/8235 cut-off events. For 2462/2462 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 65502 event pairs, 162 based on Foata normal form. 45/8269 useless extension candidates. Maximal degree in co-relation 21121. Up to 5638 conditions per place. [2024-10-13 12:12:10,890 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 58 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2024-10-13 12:12:10,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 478 flow [2024-10-13 12:12:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:12:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:12:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2024-10-13 12:12:10,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5504201680672269 [2024-10-13 12:12:10,892 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 180 flow. Second operand 4 states and 262 transitions. [2024-10-13 12:12:10,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 478 flow [2024-10-13 12:12:10,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:12:10,904 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 232 flow [2024-10-13 12:12:10,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-10-13 12:12:10,905 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2024-10-13 12:12:10,905 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 232 flow [2024-10-13 12:12:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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-10-13 12:12:10,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:10,905 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:10,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:12:10,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-13 12:12:10,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash -257833893, now seen corresponding path program 1 times [2024-10-13 12:12:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487418566] [2024-10-13 12:12:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:11,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487418566] [2024-10-13 12:12:11,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487418566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:12:11,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339987983] [2024-10-13 12:12:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:12:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:12:11,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:12:11,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 12:12:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:11,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:12:11,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:12:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:11,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:12:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339987983] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:12:11,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:12:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-13 12:12:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125412272] [2024-10-13 12:12:11,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:12:11,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:12:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:12:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:12:11,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-10-13 12:12:11,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 232 flow. Second operand has 11 states, 11 states have (on average 51.54545454545455) internal successors, (567), 11 states have internal predecessors, (567), 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-10-13 12:12:11,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:11,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-10-13 12:12:11,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:13,086 INFO L124 PetriNetUnfolderBase]: 10055/20384 cut-off events. [2024-10-13 12:12:13,087 INFO L125 PetriNetUnfolderBase]: For 9525/9529 co-relation queries the response was YES. [2024-10-13 12:12:13,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50219 conditions, 20384 events. 10055/20384 cut-off events. For 9525/9529 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 186255 event pairs, 2115 based on Foata normal form. 171/20544 useless extension candidates. Maximal degree in co-relation 50207. Up to 6387 conditions per place. [2024-10-13 12:12:13,205 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 59 selfloop transitions, 26 changer transitions 0/103 dead transitions. [2024-10-13 12:12:13,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 103 transitions, 604 flow [2024-10-13 12:12:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:12:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:12:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2024-10-13 12:12:13,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5310924369747899 [2024-10-13 12:12:13,206 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 232 flow. Second operand 5 states and 316 transitions. [2024-10-13 12:12:13,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 103 transitions, 604 flow [2024-10-13 12:12:13,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 582 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-10-13 12:12:13,215 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 339 flow [2024-10-13 12:12:13,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2024-10-13 12:12:13,216 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2024-10-13 12:12:13,216 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 339 flow [2024-10-13 12:12:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 51.54545454545455) internal successors, (567), 11 states have internal predecessors, (567), 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-10-13 12:12:13,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:13,217 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:13,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 12:12:13,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 12:12:13,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-13 12:12:13,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1881147712, now seen corresponding path program 1 times [2024-10-13 12:12:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:13,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963071337] [2024-10-13 12:12:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:13,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:12:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:13,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:12:13,444 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:12:13,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-13 12:12:13,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2024-10-13 12:12:13,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2024-10-13 12:12:13,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2024-10-13 12:12:13,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2024-10-13 12:12:13,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2024-10-13 12:12:13,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2024-10-13 12:12:13,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2024-10-13 12:12:13,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-10-13 12:12:13,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 12:12:13,450 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 12:12:13,451 WARN L239 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:12:13,451 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-13 12:12:13,486 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:12:13,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 141 transitions, 390 flow [2024-10-13 12:12:13,493 INFO L124 PetriNetUnfolderBase]: 9/94 cut-off events. [2024-10-13 12:12:13,494 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-13 12:12:13,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 94 events. 9/94 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 264 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 123. Up to 7 conditions per place. [2024-10-13 12:12:13,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 141 transitions, 390 flow [2024-10-13 12:12:13,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 65 transitions, 187 flow [2024-10-13 12:12:13,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:12:13,497 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@39722c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:12:13,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-13 12:12:13,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:12:13,498 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-10-13 12:12:13,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:13,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:13,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:12:13,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-10-13 12:12:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 672129899, now seen corresponding path program 1 times [2024-10-13 12:12:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135624419] [2024-10-13 12:12:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135624419] [2024-10-13 12:12:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135624419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:13,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:13,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909516445] [2024-10-13 12:12:13,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:13,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:12:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:12:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:12:13,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 141 [2024-10-13 12:12:13,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 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-10-13 12:12:13,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:13,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 141 [2024-10-13 12:12:13,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand