./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:24:21,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:24:21,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:24:21,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:24:21,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:24:21,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:24:21,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:24:21,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:24:21,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:24:21,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:24:21,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:24:21,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:24:21,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:24:21,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:24:21,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:24:21,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:24:21,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:24:21,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:24:21,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:24:21,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:24:21,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:24:21,909 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:24:21,909 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:24:21,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:24:21,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:24:21,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:24:21,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:24:21,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:24:21,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:24:21,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:24:21,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:24:21,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:24:21,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:24:21,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:24:21,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:24:21,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:24:21,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:24:21,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:24:21,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:24:21,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:24:21,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:24:21,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:24:21,913 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2024-11-09 10:24:22,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:24:22,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:24:22,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:24:22,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:24:22,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:24:22,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-11-09 10:24:23,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:24:23,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:24:23,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-11-09 10:24:23,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aefad6d9/2166290eecf44543babf3c34780c9f9d/FLAGb4e6347d5 [2024-11-09 10:24:23,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aefad6d9/2166290eecf44543babf3c34780c9f9d [2024-11-09 10:24:23,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:24:23,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:24:23,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:24:23,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:24:23,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:24:23,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:23,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724408ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23, skipping insertion in model container [2024-11-09 10:24:23,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:23,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:24:23,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:24:23,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:24:23,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:24:23,980 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:24:23,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23 WrapperNode [2024-11-09 10:24:23,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:24:23,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:24:23,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:24:23,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:24:23,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,038 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2024-11-09 10:24:24,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:24:24,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:24:24,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:24:24,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:24:24,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,057 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-11-09 10:24:24,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:24:24,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:24:24,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:24:24,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:24:24,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (1/1) ... [2024-11-09 10:24:24,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:24:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:24:24,099 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-11-09 10:24:24,101 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-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-09 10:24:24,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 10:24:24,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:24:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:24:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:24:24,142 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:24:24,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:24:24,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:24:24,363 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:24:24,363 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:24:24,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:24:24,454 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 10:24:24,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:24:24 BoogieIcfgContainer [2024-11-09 10:24:24,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:24:24,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:24:24,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:24:24,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:24:24,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:24:23" (1/3) ... [2024-11-09 10:24:24,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bbec94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:24:24, skipping insertion in model container [2024-11-09 10:24:24,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:23" (2/3) ... [2024-11-09 10:24:24,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bbec94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:24:24, skipping insertion in model container [2024-11-09 10:24:24,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:24:24" (3/3) ... [2024-11-09 10:24:24,461 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2024-11-09 10:24:24,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:24:24,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:24:24,474 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:24:24,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:24,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 70 flow [2024-11-09 10:24:24,540 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-11-09 10:24:24,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:24,544 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-11-09 10:24:24,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 70 flow [2024-11-09 10:24:24,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 30 transitions, 67 flow [2024-11-09 10:24:24,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:24,567 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;@11344014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:24,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 10:24:24,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:24,571 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:24,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:24,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:24,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:24,573 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-11-09 10:24:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 206163919, now seen corresponding path program 1 times [2024-11-09 10:24:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:24,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841917747] [2024-11-09 10:24:24,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841917747] [2024-11-09 10:24:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841917747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137708756] [2024-11-09 10:24:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:24,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:24,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:24,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:24,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2024-11-09 10:24:24,787 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-11-09 10:24:24,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:24,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2024-11-09 10:24:24,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:24,854 INFO L124 PetriNetUnfolderBase]: 79/166 cut-off events. [2024-11-09 10:24:24,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:24,858 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-11-09 10:24:24,861 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 12 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2024-11-09 10:24:24,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 75 flow [2024-11-09 10:24:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2024-11-09 10:24:24,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-11-09 10:24:24,872 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 67 flow. Second operand 2 states and 41 transitions. [2024-11-09 10:24:24,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 75 flow [2024-11-09 10:24:24,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 74 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:24,875 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 50 flow [2024-11-09 10:24:24,877 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-11-09 10:24:24,881 INFO L277 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2024-11-09 10:24:24,881 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 50 flow [2024-11-09 10:24:24,881 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-11-09 10:24:24,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:24,881 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:24,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:24:24,882 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-11-09 10:24:24,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 26218542, now seen corresponding path program 1 times [2024-11-09 10:24:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998951105] [2024-11-09 10:24:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:24,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:24,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:24,934 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:24,935 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-09 10:24:24,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-09 10:24:24,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-11-09 10:24:24,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-09 10:24:24,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-09 10:24:24,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:24:24,938 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 10:24:24,939 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:24,940 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:24:24,959 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:24,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 126 flow [2024-11-09 10:24:24,972 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2024-11-09 10:24:24,973 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:24:24,974 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-11-09 10:24:24,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 53 transitions, 126 flow [2024-11-09 10:24:24,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 87 flow [2024-11-09 10:24:24,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:24,977 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;@11344014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:24,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:24:24,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:24,980 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:24,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:24,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:24,981 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:24,982 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-11-09 10:24:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash 257367695, now seen corresponding path program 1 times [2024-11-09 10:24:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266326285] [2024-11-09 10:24:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266326285] [2024-11-09 10:24:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266326285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175769896] [2024-11-09 10:24:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:25,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:25,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-09 10:24:25,028 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-11-09 10:24:25,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:25,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-09 10:24:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:25,163 INFO L124 PetriNetUnfolderBase]: 559/918 cut-off events. [2024-11-09 10:24:25,163 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:24:25,167 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-11-09 10:24:25,174 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 16 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2024-11-09 10:24:25,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 101 flow [2024-11-09 10:24:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2024-11-09 10:24:25,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-11-09 10:24:25,178 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 87 flow. Second operand 2 states and 64 transitions. [2024-11-09 10:24:25,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 101 flow [2024-11-09 10:24:25,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:25,179 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 68 flow [2024-11-09 10:24:25,181 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-11-09 10:24:25,181 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2024-11-09 10:24:25,182 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 68 flow [2024-11-09 10:24:25,182 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-11-09 10:24:25,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:25,182 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:24:25,182 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-11-09 10:24:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -823457228, now seen corresponding path program 1 times [2024-11-09 10:24:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638905526] [2024-11-09 10:24:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:25,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:25,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638905526] [2024-11-09 10:24:25,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638905526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:25,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:25,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813391591] [2024-11-09 10:24:25,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:25,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:25,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:25,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-11-09 10:24:25,296 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-11-09 10:24:25,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-11-09 10:24:25,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:25,396 INFO L124 PetriNetUnfolderBase]: 620/1066 cut-off events. [2024-11-09 10:24:25,396 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-09 10:24:25,398 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-11-09 10:24:25,403 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 22 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2024-11-09 10:24:25,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 141 flow [2024-11-09 10:24:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:24:25,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.559748427672956 [2024-11-09 10:24:25,405 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 68 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:24:25,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 141 flow [2024-11-09 10:24:25,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 141 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:24:25,407 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 87 flow [2024-11-09 10:24:25,408 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-11-09 10:24:25,410 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2024-11-09 10:24:25,410 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 87 flow [2024-11-09 10:24:25,410 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-11-09 10:24:25,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:25,410 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:25,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:24:25,411 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-11-09 10:24:25,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -212865088, now seen corresponding path program 1 times [2024-11-09 10:24:25,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665590840] [2024-11-09 10:24:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:25,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:25,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:25,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:25,456 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:25,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-09 10:24:25,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:24:25,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:24:25,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 10:24:25,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-09 10:24:25,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-09 10:24:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:24:25,457 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:24:25,458 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:25,458 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:24:25,482 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:25,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 186 flow [2024-11-09 10:24:25,489 INFO L124 PetriNetUnfolderBase]: 6/58 cut-off events. [2024-11-09 10:24:25,490 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:24:25,490 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-11-09 10:24:25,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 186 flow [2024-11-09 10:24:25,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 44 transitions, 109 flow [2024-11-09 10:24:25,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:25,496 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;@11344014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:25,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:24:25,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:25,497 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:25,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:25,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:25,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:25,498 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-11-09 10:24:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 329566181, now seen corresponding path program 1 times [2024-11-09 10:24:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232726595] [2024-11-09 10:24:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:25,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232726595] [2024-11-09 10:24:25,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232726595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016808826] [2024-11-09 10:24:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:25,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-11-09 10:24:25,528 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-11-09 10:24:25,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:25,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-11-09 10:24:25,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:25,906 INFO L124 PetriNetUnfolderBase]: 3247/4710 cut-off events. [2024-11-09 10:24:25,906 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2024-11-09 10:24:25,916 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-11-09 10:24:25,937 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 20 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2024-11-09 10:24:25,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 129 flow [2024-11-09 10:24:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2024-11-09 10:24:25,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-11-09 10:24:25,942 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 109 flow. Second operand 2 states and 87 transitions. [2024-11-09 10:24:25,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 129 flow [2024-11-09 10:24:25,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:25,945 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 86 flow [2024-11-09 10:24:25,945 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-11-09 10:24:25,946 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2024-11-09 10:24:25,947 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 86 flow [2024-11-09 10:24:25,947 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-11-09 10:24:25,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:25,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:24:25,947 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-11-09 10:24:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2086411230, now seen corresponding path program 1 times [2024-11-09 10:24:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643925944] [2024-11-09 10:24:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643925944] [2024-11-09 10:24:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643925944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:26,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147052835] [2024-11-09 10:24:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:26,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:26,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:26,021 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-11-09 10:24:26,021 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-11-09 10:24:26,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:26,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-11-09 10:24:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:26,383 INFO L124 PetriNetUnfolderBase]: 3515/5257 cut-off events. [2024-11-09 10:24:26,384 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2024-11-09 10:24:26,394 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-11-09 10:24:26,415 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 28 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-11-09 10:24:26,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 184 flow [2024-11-09 10:24:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-09 10:24:26,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-11-09 10:24:26,417 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 86 flow. Second operand 3 states and 123 transitions. [2024-11-09 10:24:26,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 184 flow [2024-11-09 10:24:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:24:26,419 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 112 flow [2024-11-09 10:24:26,419 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-11-09 10:24:26,419 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-11-09 10:24:26,420 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 112 flow [2024-11-09 10:24:26,420 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-11-09 10:24:26,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:26,420 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:26,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:24:26,420 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-11-09 10:24:26,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1401397513, now seen corresponding path program 1 times [2024-11-09 10:24:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275131224] [2024-11-09 10:24:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:26,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:26,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:26,447 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:26,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:24:26,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:24:26,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:24:26,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:24:26,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-09 10:24:26,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:24:26,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:24:26,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:24:26,450 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:24:26,451 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:26,451 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:24:26,479 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:26,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 97 transitions, 250 flow [2024-11-09 10:24:26,488 INFO L124 PetriNetUnfolderBase]: 7/70 cut-off events. [2024-11-09 10:24:26,488 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:24:26,489 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-11-09 10:24:26,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 97 transitions, 250 flow [2024-11-09 10:24:26,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 133 flow [2024-11-09 10:24:26,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:26,492 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;@11344014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:26,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:24:26,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:26,493 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-09 10:24:26,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:26,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:26,493 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:26,493 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-11-09 10:24:26,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash 422759377, now seen corresponding path program 1 times [2024-11-09 10:24:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100026249] [2024-11-09 10:24:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100026249] [2024-11-09 10:24:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100026249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:26,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:26,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319223560] [2024-11-09 10:24:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:26,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:26,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-11-09 10:24:26,511 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-11-09 10:24:26,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:26,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-11-09 10:24:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:28,128 INFO L124 PetriNetUnfolderBase]: 17071/22950 cut-off events. [2024-11-09 10:24:28,129 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2024-11-09 10:24:28,193 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-11-09 10:24:28,300 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 24 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2024-11-09 10:24:28,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 159 flow [2024-11-09 10:24:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 110 transitions. [2024-11-09 10:24:28,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5670103092783505 [2024-11-09 10:24:28,306 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 133 flow. Second operand 2 states and 110 transitions. [2024-11-09 10:24:28,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 159 flow [2024-11-09 10:24:28,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 152 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:28,313 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 104 flow [2024-11-09 10:24:28,313 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-11-09 10:24:28,314 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2024-11-09 10:24:28,314 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 104 flow [2024-11-09 10:24:28,314 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-11-09 10:24:28,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:28,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:28,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:24:28,314 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-11-09 10:24:28,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2065459860, now seen corresponding path program 1 times [2024-11-09 10:24:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:28,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199416237] [2024-11-09 10:24:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199416237] [2024-11-09 10:24:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199416237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:28,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459639410] [2024-11-09 10:24:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:28,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:28,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-11-09 10:24:28,373 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-11-09 10:24:28,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:28,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-11-09 10:24:28,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:29,807 INFO L124 PetriNetUnfolderBase]: 17930/24628 cut-off events. [2024-11-09 10:24:29,807 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2024-11-09 10:24:29,861 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-11-09 10:24:29,940 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 34 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-09 10:24:29,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 227 flow [2024-11-09 10:24:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2024-11-09 10:24:29,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395189003436426 [2024-11-09 10:24:29,941 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 104 flow. Second operand 3 states and 157 transitions. [2024-11-09 10:24:29,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 227 flow [2024-11-09 10:24:29,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:24:29,943 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 137 flow [2024-11-09 10:24:29,943 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-11-09 10:24:29,944 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-09 10:24:29,944 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 137 flow [2024-11-09 10:24:29,944 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-11-09 10:24:29,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:29,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:29,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:24:29,945 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-11-09 10:24:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 862871265, now seen corresponding path program 1 times [2024-11-09 10:24:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202162077] [2024-11-09 10:24:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202162077] [2024-11-09 10:24:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202162077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:24:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103729833] [2024-11-09 10:24:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:29,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-11-09 10:24:29,988 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-11-09 10:24:29,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:29,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-11-09 10:24:29,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:30,259 INFO L124 PetriNetUnfolderBase]: 1187/2607 cut-off events. [2024-11-09 10:24:30,263 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2024-11-09 10:24:30,271 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-11-09 10:24:30,279 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 25 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-11-09 10:24:30,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 239 flow [2024-11-09 10:24:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-11-09 10:24:30,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2024-11-09 10:24:30,280 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 137 flow. Second operand 3 states and 153 transitions. [2024-11-09 10:24:30,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 239 flow [2024-11-09 10:24:30,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:30,282 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 152 flow [2024-11-09 10:24:30,283 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-11-09 10:24:30,283 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2024-11-09 10:24:30,283 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 152 flow [2024-11-09 10:24:30,283 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-11-09 10:24:30,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:30,284 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:30,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:24:30,284 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-11-09 10:24:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1203977249, now seen corresponding path program 1 times [2024-11-09 10:24:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541732732] [2024-11-09 10:24:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541732732] [2024-11-09 10:24:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541732732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:30,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:24:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798278715] [2024-11-09 10:24:30,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:24:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:24:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:24:30,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 97 [2024-11-09 10:24:30,341 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-11-09 10:24:30,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:30,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 97 [2024-11-09 10:24:30,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:30,668 INFO L124 PetriNetUnfolderBase]: 1731/3694 cut-off events. [2024-11-09 10:24:30,669 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2024-11-09 10:24:30,682 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-11-09 10:24:30,695 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 49 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2024-11-09 10:24:30,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 398 flow [2024-11-09 10:24:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:24:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:24:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2024-11-09 10:24:30,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5541237113402062 [2024-11-09 10:24:30,697 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 152 flow. Second operand 4 states and 215 transitions. [2024-11-09 10:24:30,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 398 flow [2024-11-09 10:24:30,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:30,701 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 194 flow [2024-11-09 10:24:30,701 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-11-09 10:24:30,702 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2024-11-09 10:24:30,702 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 194 flow [2024-11-09 10:24:30,702 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-11-09 10:24:30,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:30,702 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:30,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:24:30,703 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-11-09 10:24:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 360081993, now seen corresponding path program 1 times [2024-11-09 10:24:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:30,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985512739] [2024-11-09 10:24:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:30,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:30,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:30,721 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:30,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-09 10:24:30,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:24:30,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:24:30,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-09 10:24:30,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2024-11-09 10:24:30,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2024-11-09 10:24:30,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-11-09 10:24:30,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:24:30,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:24:30,723 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 10:24:30,723 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:30,723 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-09 10:24:30,751 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:30,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 119 transitions, 318 flow [2024-11-09 10:24:30,760 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2024-11-09 10:24:30,760 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 10:24:30,760 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-11-09 10:24:30,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 119 transitions, 318 flow [2024-11-09 10:24:30,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 58 transitions, 159 flow [2024-11-09 10:24:30,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:30,763 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;@11344014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:30,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 10:24:30,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:30,765 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-09 10:24:30,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:30,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:30,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:30,765 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-11-09 10:24:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash 536947283, now seen corresponding path program 1 times [2024-11-09 10:24:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619125548] [2024-11-09 10:24:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:30,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619125548] [2024-11-09 10:24:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619125548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985510226] [2024-11-09 10:24:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:30,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:30,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-11-09 10:24:30,777 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-11-09 10:24:30,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:30,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-11-09 10:24:30,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:38,357 INFO L124 PetriNetUnfolderBase]: 84655/108198 cut-off events. [2024-11-09 10:24:38,358 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2024-11-09 10:24:38,728 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-11-09 10:24:39,176 INFO L140 encePairwiseOnDemand]: 110/119 looper letters, 28 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2024-11-09 10:24:39,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 191 flow [2024-11-09 10:24:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 133 transitions. [2024-11-09 10:24:39,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2024-11-09 10:24:39,178 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 159 flow. Second operand 2 states and 133 transitions. [2024-11-09 10:24:39,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 191 flow [2024-11-09 10:24:39,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 178 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:39,192 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 122 flow [2024-11-09 10:24:39,192 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-11-09 10:24:39,192 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2024-11-09 10:24:39,192 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 122 flow [2024-11-09 10:24:39,193 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-11-09 10:24:39,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:39,193 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:39,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:24:39,194 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-11-09 10:24:39,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash -211440730, now seen corresponding path program 1 times [2024-11-09 10:24:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654667741] [2024-11-09 10:24:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:39,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654667741] [2024-11-09 10:24:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654667741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:39,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:39,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:39,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789617586] [2024-11-09 10:24:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:39,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:39,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:39,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-11-09 10:24:39,251 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-11-09 10:24:39,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:39,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-11-09 10:24:39,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:45,970 INFO L124 PetriNetUnfolderBase]: 87029/112963 cut-off events. [2024-11-09 10:24:45,971 INFO L125 PetriNetUnfolderBase]: For 5082/5082 co-relation queries the response was YES. [2024-11-09 10:24:46,409 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-11-09 10:24:46,861 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 40 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2024-11-09 10:24:46,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 270 flow [2024-11-09 10:24:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2024-11-09 10:24:46,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5350140056022409 [2024-11-09 10:24:46,862 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 122 flow. Second operand 3 states and 191 transitions. [2024-11-09 10:24:46,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 270 flow [2024-11-09 10:24:46,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:24:46,866 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 162 flow [2024-11-09 10:24:46,866 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-11-09 10:24:46,866 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2024-11-09 10:24:46,867 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 162 flow [2024-11-09 10:24:46,867 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-11-09 10:24:46,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:46,867 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:24:46,867 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-11-09 10:24:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2072609719, now seen corresponding path program 1 times [2024-11-09 10:24:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458929628] [2024-11-09 10:24:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458929628] [2024-11-09 10:24:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458929628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:46,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:24:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023139628] [2024-11-09 10:24:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:46,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-11-09 10:24:46,912 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-11-09 10:24:46,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:46,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-11-09 10:24:46,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:47,446 INFO L124 PetriNetUnfolderBase]: 2900/6135 cut-off events. [2024-11-09 10:24:47,447 INFO L125 PetriNetUnfolderBase]: For 1688/1688 co-relation queries the response was YES. [2024-11-09 10:24:47,469 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-11-09 10:24:47,489 INFO L140 encePairwiseOnDemand]: 107/119 looper letters, 29 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-11-09 10:24:47,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 283 flow [2024-11-09 10:24:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2024-11-09 10:24:47,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2024-11-09 10:24:47,491 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 162 flow. Second operand 3 states and 186 transitions. [2024-11-09 10:24:47,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 283 flow [2024-11-09 10:24:47,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:47,494 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 180 flow [2024-11-09 10:24:47,494 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-11-09 10:24:47,495 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2024-11-09 10:24:47,495 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 180 flow [2024-11-09 10:24:47,495 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-11-09 10:24:47,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:47,495 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:47,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:24:47,495 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-11-09 10:24:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -592232358, now seen corresponding path program 1 times [2024-11-09 10:24:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508759989] [2024-11-09 10:24:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508759989] [2024-11-09 10:24:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508759989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:47,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:47,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:24:47,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291190743] [2024-11-09 10:24:47,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:47,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:24:47,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:47,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:24:47,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:24:47,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-11-09 10:24:47,570 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-11-09 10:24:47,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:47,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-11-09 10:24:47,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:48,228 INFO L124 PetriNetUnfolderBase]: 4045/8235 cut-off events. [2024-11-09 10:24:48,228 INFO L125 PetriNetUnfolderBase]: For 2462/2462 co-relation queries the response was YES. [2024-11-09 10:24:48,265 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-11-09 10:24:48,298 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 58 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2024-11-09 10:24:48,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 478 flow [2024-11-09 10:24:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:24:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:24:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2024-11-09 10:24:48,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5504201680672269 [2024-11-09 10:24:48,299 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 180 flow. Second operand 4 states and 262 transitions. [2024-11-09 10:24:48,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 478 flow [2024-11-09 10:24:48,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:48,308 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 232 flow [2024-11-09 10:24:48,308 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-11-09 10:24:48,308 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2024-11-09 10:24:48,308 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 232 flow [2024-11-09 10:24:48,309 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-11-09 10:24:48,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:48,309 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:24:48,309 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-11-09 10:24:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -257833893, now seen corresponding path program 1 times [2024-11-09 10:24:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542476782] [2024-11-09 10:24:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:48,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542476782] [2024-11-09 10:24:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542476782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:24:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702456823] [2024-11-09 10:24:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:48,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:24:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:24:48,393 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-11-09 10:24:48,394 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-11-09 10:24:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:48,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:24:48,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:24:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:48,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:24:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702456823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:24:48,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:24:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-11-09 10:24:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348645817] [2024-11-09 10:24:48,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:24:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:24:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:24:48,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:24:48,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 119 [2024-11-09 10:24:48,772 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-11-09 10:24:48,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:48,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 119 [2024-11-09 10:24:48,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:50,352 INFO L124 PetriNetUnfolderBase]: 10055/20384 cut-off events. [2024-11-09 10:24:50,352 INFO L125 PetriNetUnfolderBase]: For 9525/9529 co-relation queries the response was YES. [2024-11-09 10:24:50,414 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-11-09 10:24:50,474 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 59 selfloop transitions, 26 changer transitions 0/103 dead transitions. [2024-11-09 10:24:50,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 103 transitions, 604 flow [2024-11-09 10:24:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:24:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:24:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2024-11-09 10:24:50,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5310924369747899 [2024-11-09 10:24:50,476 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 232 flow. Second operand 5 states and 316 transitions. [2024-11-09 10:24:50,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 103 transitions, 604 flow [2024-11-09 10:24:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 582 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-09 10:24:50,482 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 339 flow [2024-11-09 10:24:50,483 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-11-09 10:24:50,483 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2024-11-09 10:24:50,483 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 339 flow [2024-11-09 10:24:50,484 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-11-09 10:24:50,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:50,484 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:50,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:24:50,684 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-11-09 10:24:50,684 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-11-09 10:24:50,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1881147712, now seen corresponding path program 1 times [2024-11-09 10:24:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414730825] [2024-11-09 10:24:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:50,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:50,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:50,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:50,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2024-11-09 10:24:50,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-09 10:24:50,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:24:50,707 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 10:24:50,707 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:50,707 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-09 10:24:50,746 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:50,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 141 transitions, 390 flow [2024-11-09 10:24:50,753 INFO L124 PetriNetUnfolderBase]: 9/94 cut-off events. [2024-11-09 10:24:50,753 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-09 10:24:50,753 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-11-09 10:24:50,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 141 transitions, 390 flow [2024-11-09 10:24:50,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 65 transitions, 187 flow [2024-11-09 10:24:50,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:50,755 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;@11344014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:50,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 10:24:50,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:50,756 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:50,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:50,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:50,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:50,757 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-11-09 10:24:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 672129899, now seen corresponding path program 1 times [2024-11-09 10:24:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645604791] [2024-11-09 10:24:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645604791] [2024-11-09 10:24:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645604791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710571708] [2024-11-09 10:24:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:50,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:50,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:50,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:50,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 141 [2024-11-09 10:24:50,767 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-11-09 10:24:50,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:50,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 141 [2024-11-09 10:24:50,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand