./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/39_rand_lock_p0_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 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:49:15,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:49:15,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:49:15,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:49:15,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:49:15,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:49:15,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:49:15,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:49:15,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:49:15,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:49:15,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:49:15,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:49:15,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:49:15,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:49:15,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:49:15,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:49:15,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:49:15,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:49:15,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:49:15,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:49:15,409 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:49:15,412 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:49:15,412 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:49:15,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:49:15,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:49:15,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:49:15,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:49:15,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:49:15,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:49:15,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:49:15,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:49:15,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:49:15,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:49:15,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:49:15,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:49:15,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:49:15,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:49:15,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:49:15,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:49:15,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:49:15,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:49:15,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:49:15,419 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 -> 75a7e23d8671ab9c707059b5300300854f7697b51bd2252b1df4e0c45e5bbfed [2024-11-10 17:49:15,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:49:15,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:49:15,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:49:15,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:49:15,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:49:15,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2024-11-10 17:49:17,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:49:17,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:49:17,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/39_rand_lock_p0_vs.i [2024-11-10 17:49:17,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3b417f5/8211ec40e7924983b09343ae2e29af8c/FLAG3e331813f [2024-11-10 17:49:17,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3b417f5/8211ec40e7924983b09343ae2e29af8c [2024-11-10 17:49:17,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:49:17,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:49:17,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:49:17,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:49:17,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:49:17,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:49:17" (1/1) ... [2024-11-10 17:49:17,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e53d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:17, skipping insertion in model container [2024-11-10 17:49:17,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:49:17" (1/1) ... [2024-11-10 17:49:17,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:49:18,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:49:18,208 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:49:18,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:49:18,325 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:49:18,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18 WrapperNode [2024-11-10 17:49:18,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:49:18,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:49:18,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:49:18,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:49:18,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,378 INFO L138 Inliner]: procedures = 166, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2024-11-10 17:49:18,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:49:18,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:49:18,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:49:18,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:49:18,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,411 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-10 17:49:18,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:49:18,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:49:18,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:49:18,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:49:18,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (1/1) ... [2024-11-10 17:49:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:49:18,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:49:18,478 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-10 17:49:18,480 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-10 17:49:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 17:49:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 17:49:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 17:49:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:49:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:49:18,523 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:49:18,636 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:49:18,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:49:18,808 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:49:18,808 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:49:18,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:49:18,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:49:18,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:18 BoogieIcfgContainer [2024-11-10 17:49:18,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:49:18,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:49:18,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:49:18,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:49:18,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:49:17" (1/3) ... [2024-11-10 17:49:18,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edce5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:49:18, skipping insertion in model container [2024-11-10 17:49:18,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:49:18" (2/3) ... [2024-11-10 17:49:18,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edce5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:49:18, skipping insertion in model container [2024-11-10 17:49:18,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:49:18" (3/3) ... [2024-11-10 17:49:18,954 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs.i [2024-11-10 17:49:18,971 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:49:18,971 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 17:49:18,972 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:49:19,014 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:49:19,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 24 transitions, 52 flow [2024-11-10 17:49:19,070 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-11-10 17:49:19,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 31 events. 4/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2024-11-10 17:49:19,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 24 transitions, 52 flow [2024-11-10 17:49:19,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 24 transitions, 52 flow [2024-11-10 17:49:19,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:49:19,098 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;@641d0145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:49:19,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 17:49:19,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:49:19,104 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2024-11-10 17:49:19,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:19,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:19,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:49:19,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 17:49:19,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash 5858107, now seen corresponding path program 1 times [2024-11-10 17:49:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854371219] [2024-11-10 17:49:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:19,279 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-10 17:49:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854371219] [2024-11-10 17:49:19,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854371219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:19,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:19,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:49:19,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339412447] [2024-11-10 17:49:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:19,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:49:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:49:19,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:49:19,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2024-11-10 17:49:19,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 24 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-10 17:49:19,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:19,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2024-11-10 17:49:19,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:19,505 INFO L124 PetriNetUnfolderBase]: 23/64 cut-off events. [2024-11-10 17:49:19,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:19,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 64 events. 23/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 20 based on Foata normal form. 12/70 useless extension candidates. Maximal degree in co-relation 111. Up to 56 conditions per place. [2024-11-10 17:49:19,510 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 14 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2024-11-10 17:49:19,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 68 flow [2024-11-10 17:49:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:49:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 17:49:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2024-11-10 17:49:19,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-10 17:49:19,522 INFO L175 Difference]: Start difference. First operand has 24 places, 24 transitions, 52 flow. Second operand 2 states and 29 transitions. [2024-11-10 17:49:19,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 68 flow [2024-11-10 17:49:19,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 18 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:19,526 INFO L231 Difference]: Finished difference. Result has 21 places, 18 transitions, 40 flow [2024-11-10 17:49:19,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=18} [2024-11-10 17:49:19,531 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, -3 predicate places. [2024-11-10 17:49:19,531 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 40 flow [2024-11-10 17:49:19,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-10 17:49:19,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:19,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:49:19,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:49:19,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 17:49:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1333522344, now seen corresponding path program 1 times [2024-11-10 17:49:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660256418] [2024-11-10 17:49:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:19,701 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-10 17:49:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660256418] [2024-11-10 17:49:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660256418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:49:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091921549] [2024-11-10 17:49:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:19,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:49:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:49:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:49:19,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2024-11-10 17:49:19,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 17:49:19,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:19,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2024-11-10 17:49:19,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:19,770 INFO L124 PetriNetUnfolderBase]: 21/59 cut-off events. [2024-11-10 17:49:19,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:19,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 59 events. 21/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 12 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 111. Up to 35 conditions per place. [2024-11-10 17:49:19,775 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 13 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2024-11-10 17:49:19,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 19 transitions, 72 flow [2024-11-10 17:49:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:49:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:49:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2024-11-10 17:49:19,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-11-10 17:49:19,778 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 40 flow. Second operand 3 states and 34 transitions. [2024-11-10 17:49:19,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 19 transitions, 72 flow [2024-11-10 17:49:19,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:19,780 INFO L231 Difference]: Finished difference. Result has 22 places, 17 transitions, 42 flow [2024-11-10 17:49:19,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=22, PETRI_TRANSITIONS=17} [2024-11-10 17:49:19,782 INFO L277 CegarLoopForPetriNet]: 24 programPoint places, -2 predicate places. [2024-11-10 17:49:19,783 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 42 flow [2024-11-10 17:49:19,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 17:49:19,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:19,783 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-10 17:49:19,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:49:19,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 17:49:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1614470045, now seen corresponding path program 1 times [2024-11-10 17:49:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105925308] [2024-11-10 17:49:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:49:19,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:49:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:49:19,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:49:19,862 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:49:19,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 17:49:19,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-10 17:49:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-11-10 17:49:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-10 17:49:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:49:19,867 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 17:49:19,872 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 17:49:19,873 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 17:49:19,903 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:49:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 86 flow [2024-11-10 17:49:19,919 INFO L124 PetriNetUnfolderBase]: 7/53 cut-off events. [2024-11-10 17:49:19,921 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 17:49:19,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 53 events. 7/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 111 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 34. Up to 6 conditions per place. [2024-11-10 17:49:19,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 38 transitions, 86 flow [2024-11-10 17:49:19,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 38 transitions, 86 flow [2024-11-10 17:49:19,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:49:19,930 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;@641d0145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:49:19,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 17:49:19,935 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:49:19,935 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2024-11-10 17:49:19,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:19,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:19,936 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:49:19,936 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-10 17:49:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 7027899, now seen corresponding path program 1 times [2024-11-10 17:49:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838040027] [2024-11-10 17:49:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:19,971 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-10 17:49:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838040027] [2024-11-10 17:49:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838040027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:49:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288852348] [2024-11-10 17:49:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:19,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:49:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:49:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:49:19,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-11-10 17:49:19,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10 17:49:19,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:19,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-11-10 17:49:19,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:20,200 INFO L124 PetriNetUnfolderBase]: 606/1053 cut-off events. [2024-11-10 17:49:20,200 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-10 17:49:20,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1053 events. 606/1053 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4754 event pairs, 570 based on Foata normal form. 133/1072 useless extension candidates. Maximal degree in co-relation 1167. Up to 969 conditions per place. [2024-11-10 17:49:20,213 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 25 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2024-11-10 17:49:20,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 122 flow [2024-11-10 17:49:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:49:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 17:49:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2024-11-10 17:49:20,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2024-11-10 17:49:20,217 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 86 flow. Second operand 2 states and 45 transitions. [2024-11-10 17:49:20,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 122 flow [2024-11-10 17:49:20,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:20,219 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 72 flow [2024-11-10 17:49:20,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-11-10 17:49:20,221 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2024-11-10 17:49:20,221 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 72 flow [2024-11-10 17:49:20,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10 17:49:20,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:20,223 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:49:20,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:49:20,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 17:49:20,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1837260715, now seen corresponding path program 1 times [2024-11-10 17:49:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209392463] [2024-11-10 17:49:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:20,267 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-10 17:49:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209392463] [2024-11-10 17:49:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209392463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:49:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271886392] [2024-11-10 17:49:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:49:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:49:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:49:20,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-11-10 17:49:20,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10 17:49:20,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:20,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-11-10 17:49:20,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:20,423 INFO L124 PetriNetUnfolderBase]: 522/913 cut-off events. [2024-11-10 17:49:20,423 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 17:49:20,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 913 events. 522/913 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4012 event pairs, 252 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1787. Up to 451 conditions per place. [2024-11-10 17:49:20,431 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 39 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2024-11-10 17:49:20,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 195 flow [2024-11-10 17:49:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:49:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:49:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-10 17:49:20,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2024-11-10 17:49:20,434 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 72 flow. Second operand 3 states and 68 transitions. [2024-11-10 17:49:20,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 195 flow [2024-11-10 17:49:20,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:20,437 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 93 flow [2024-11-10 17:49:20,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-11-10 17:49:20,439 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-11-10 17:49:20,440 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 93 flow [2024-11-10 17:49:20,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10 17:49:20,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:20,440 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2024-11-10 17:49:20,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:49:20,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 17:49:20,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1586769372, now seen corresponding path program 1 times [2024-11-10 17:49:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66970087] [2024-11-10 17:49:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:49:20,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:49:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:49:20,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:49:20,479 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:49:20,479 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 17:49:20,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 17:49:20,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-11-10 17:49:20,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-11-10 17:49:20,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-10 17:49:20,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:49:20,480 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 17:49:20,481 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 17:49:20,481 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 17:49:20,514 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:49:20,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 122 flow [2024-11-10 17:49:20,523 INFO L124 PetriNetUnfolderBase]: 10/75 cut-off events. [2024-11-10 17:49:20,524 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 17:49:20,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 75 events. 10/75 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 60. Up to 8 conditions per place. [2024-11-10 17:49:20,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 52 transitions, 122 flow [2024-11-10 17:49:20,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 52 transitions, 122 flow [2024-11-10 17:49:20,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:49:20,530 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;@641d0145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:49:20,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 17:49:20,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:49:20,534 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2024-11-10 17:49:20,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:20,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:20,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:49:20,535 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-10 17:49:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 8628667, now seen corresponding path program 1 times [2024-11-10 17:49:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:20,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962866479] [2024-11-10 17:49:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:20,568 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-10 17:49:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962866479] [2024-11-10 17:49:20,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962866479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:20,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:20,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:49:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435626871] [2024-11-10 17:49:20,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:49:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:20,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:49:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:49:20,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-11-10 17:49:20,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-10 17:49:20,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:20,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-11-10 17:49:20,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:22,138 INFO L124 PetriNetUnfolderBase]: 10637/15502 cut-off events. [2024-11-10 17:49:22,139 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2024-11-10 17:49:22,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30667 conditions, 15502 events. 10637/15502 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 88437 event pairs, 10250 based on Foata normal form. 1464/15319 useless extension candidates. Maximal degree in co-relation 6027. Up to 14642 conditions per place. [2024-11-10 17:49:22,278 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 36 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2024-11-10 17:49:22,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 178 flow [2024-11-10 17:49:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:49:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 17:49:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2024-11-10 17:49:22,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5865384615384616 [2024-11-10 17:49:22,281 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 122 flow. Second operand 2 states and 61 transitions. [2024-11-10 17:49:22,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 178 flow [2024-11-10 17:49:22,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 176 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:22,285 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 104 flow [2024-11-10 17:49:22,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-11-10 17:49:22,288 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-10 17:49:22,288 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 104 flow [2024-11-10 17:49:22,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-10 17:49:22,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:22,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:49:22,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:49:22,290 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-10 17:49:22,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash -298908510, now seen corresponding path program 1 times [2024-11-10 17:49:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560658148] [2024-11-10 17:49:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:22,327 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-10 17:49:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:22,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560658148] [2024-11-10 17:49:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560658148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:49:22,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751561712] [2024-11-10 17:49:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:49:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:49:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:49:22,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2024-11-10 17:49:22,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:49:22,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:22,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2024-11-10 17:49:22,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:23,441 INFO L124 PetriNetUnfolderBase]: 9024/13141 cut-off events. [2024-11-10 17:49:23,445 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2024-11-10 17:49:23,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26138 conditions, 13141 events. 9024/13141 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 74298 event pairs, 3549 based on Foata normal form. 0/12364 useless extension candidates. Maximal degree in co-relation 26132. Up to 8869 conditions per place. [2024-11-10 17:49:23,538 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 57 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-10 17:49:23,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 286 flow [2024-11-10 17:49:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:49:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:49:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-10 17:49:23,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-11-10 17:49:23,542 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 104 flow. Second operand 3 states and 94 transitions. [2024-11-10 17:49:23,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 286 flow [2024-11-10 17:49:23,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:23,547 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 134 flow [2024-11-10 17:49:23,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-11-10 17:49:23,548 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-11-10 17:49:23,549 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 134 flow [2024-11-10 17:49:23,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:49:23,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:23,549 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2024-11-10 17:49:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:49:23,550 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-10 17:49:23,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1168307638, now seen corresponding path program 1 times [2024-11-10 17:49:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412764498] [2024-11-10 17:49:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:49:23,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:49:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:49:23,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:49:23,591 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:49:23,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 17:49:23,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-10 17:49:23,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-10 17:49:23,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-11-10 17:49:23,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-10 17:49:23,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-10 17:49:23,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:49:23,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 17:49:23,597 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 17:49:23,597 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 17:49:23,638 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:49:23,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 66 transitions, 160 flow [2024-11-10 17:49:23,655 INFO L124 PetriNetUnfolderBase]: 13/97 cut-off events. [2024-11-10 17:49:23,656 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-10 17:49:23,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 97 events. 13/97 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 261 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 87. Up to 10 conditions per place. [2024-11-10 17:49:23,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 66 transitions, 160 flow [2024-11-10 17:49:23,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 66 transitions, 160 flow [2024-11-10 17:49:23,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:49:23,662 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;@641d0145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:49:23,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:49:23,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:49:23,664 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2024-11-10 17:49:23,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:49:23,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:23,665 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 17:49:23,665 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-10 17:49:23,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 10660411, now seen corresponding path program 1 times [2024-11-10 17:49:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002129965] [2024-11-10 17:49:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:23,683 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-10 17:49:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002129965] [2024-11-10 17:49:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002129965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:49:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221605296] [2024-11-10 17:49:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:49:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:23,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:49:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:49:23,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2024-11-10 17:49:23,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 160 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10 17:49:23,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:23,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2024-11-10 17:49:23,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:39,138 INFO L124 PetriNetUnfolderBase]: 160908/214398 cut-off events. [2024-11-10 17:49:39,138 INFO L125 PetriNetUnfolderBase]: For 16530/16530 co-relation queries the response was YES. [2024-11-10 17:49:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426552 conditions, 214398 events. 160908/214398 cut-off events. For 16530/16530 co-relation queries the response was YES. Maximal size of possible extension queue 4339. Compared 1382519 event pairs, 156660 based on Foata normal form. 16105/208000 useless extension candidates. Maximal degree in co-relation 30795. Up to 204975 conditions per place. [2024-11-10 17:49:40,597 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 47 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2024-11-10 17:49:40,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 236 flow [2024-11-10 17:49:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:49:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 17:49:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2024-11-10 17:49:40,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-10 17:49:40,599 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 160 flow. Second operand 2 states and 77 transitions. [2024-11-10 17:49:40,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 236 flow [2024-11-10 17:49:40,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 230 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:40,636 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 136 flow [2024-11-10 17:49:40,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-11-10 17:49:40,637 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2024-11-10 17:49:40,638 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 136 flow [2024-11-10 17:49:40,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-10 17:49:40,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:40,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:49:40,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:49:40,639 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-10 17:49:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1653612495, now seen corresponding path program 1 times [2024-11-10 17:49:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718501934] [2024-11-10 17:49:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:40,676 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-10 17:49:40,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718501934] [2024-11-10 17:49:40,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718501934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:40,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:40,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:49:40,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782011788] [2024-11-10 17:49:40,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:40,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:49:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:49:40,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:49:40,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 66 [2024-11-10 17:49:40,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-10 17:49:40,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:40,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 66 [2024-11-10 17:49:40,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:49:51,824 INFO L124 PetriNetUnfolderBase]: 137943/182586 cut-off events. [2024-11-10 17:49:51,824 INFO L125 PetriNetUnfolderBase]: For 4942/4942 co-relation queries the response was YES. [2024-11-10 17:49:52,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365504 conditions, 182586 events. 137943/182586 cut-off events. For 4942/4942 co-relation queries the response was YES. Maximal size of possible extension queue 4076. Compared 1160532 event pairs, 45867 based on Foata normal form. 0/170445 useless extension candidates. Maximal degree in co-relation 365497. Up to 145462 conditions per place. [2024-11-10 17:49:53,169 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 75 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-11-10 17:49:53,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 377 flow [2024-11-10 17:49:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:49:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:49:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-11-10 17:49:53,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-10 17:49:53,172 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 136 flow. Second operand 3 states and 120 transitions. [2024-11-10 17:49:53,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 377 flow [2024-11-10 17:49:53,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 377 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:49:53,182 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 175 flow [2024-11-10 17:49:53,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-11-10 17:49:53,183 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-10 17:49:53,183 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 175 flow [2024-11-10 17:49:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-10 17:49:53,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:49:53,184 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:49:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:49:53,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 17:49:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:49:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1813641168, now seen corresponding path program 1 times [2024-11-10 17:49:53,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:49:53,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006678437] [2024-11-10 17:49:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:49:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:49:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:49:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 17:49:53,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:49:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006678437] [2024-11-10 17:49:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006678437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:49:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:49:53,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:49:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137294645] [2024-11-10 17:49:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:49:53,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:49:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:49:53,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:49:53,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:49:53,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 66 [2024-11-10 17:49:53,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-10 17:49:53,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:49:53,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 66 [2024-11-10 17:49:53,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand