./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_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 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:12:31,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:12:31,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:12:31,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:12:31,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:12:31,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:12:31,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:12:31,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:12:31,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:12:31,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:12:31,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:12:31,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:12:31,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:12:31,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:12:31,618 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:12:31,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:12:31,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:12:31,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:12:31,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:12:31,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:12:31,621 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:12:31,621 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:12:31,621 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:12:31,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:12:31,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:12:31,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:12:31,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:12:31,622 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:12:31,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:12:31,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:12:31,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:12:31,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:12:31,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:12:31,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:12:31,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:12:31,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:12:31,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:12:31,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:12:31,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:12:31,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:12:31,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:12:31,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:12:31,625 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2024-10-13 12:12:31,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:12:31,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:12:31,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:12:31,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:12:31,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:12:31,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2024-10-13 12:12:33,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:12:33,303 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:12:33,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2024-10-13 12:12:33,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5d2b00a/b45958cb8a4b4951940a45efaba2ed47/FLAG789805f5b [2024-10-13 12:12:33,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5d2b00a/b45958cb8a4b4951940a45efaba2ed47 [2024-10-13 12:12:33,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:12:33,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:12:33,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:12:33,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:12:33,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:12:33,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:12:33" (1/1) ... [2024-10-13 12:12:33,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5cb47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:33, skipping insertion in model container [2024-10-13 12:12:33,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:12:33" (1/1) ... [2024-10-13 12:12:33,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:12:34,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:12:34,085 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:12:34,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:12:34,168 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:12:34,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34 WrapperNode [2024-10-13 12:12:34,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:12:34,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:12:34,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:12:34,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:12:34,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,210 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-10-13 12:12:34,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:12:34,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:12:34,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:12:34,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:12:34,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,239 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:12:34,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:12:34,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:12:34,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:12:34,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:12:34,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (1/1) ... [2024-10-13 12:12:34,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:12:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:12:34,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:12:34,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:12:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-13 12:12:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-13 12:12:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:12:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:12:34,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:12:34,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:12:34,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:12:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:12:34,341 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:12:34,444 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:12:34,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:12:34,526 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:12:34,526 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:12:34,602 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:12:34,602 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 12:12:34,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:34 BoogieIcfgContainer [2024-10-13 12:12:34,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:12:34,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:12:34,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:12:34,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:12:34,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:12:33" (1/3) ... [2024-10-13 12:12:34,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3884aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:12:34, skipping insertion in model container [2024-10-13 12:12:34,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:34" (2/3) ... [2024-10-13 12:12:34,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3884aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:12:34, skipping insertion in model container [2024-10-13 12:12:34,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:34" (3/3) ... [2024-10-13 12:12:34,610 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2024-10-13 12:12:34,624 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:12:34,625 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:12:34,626 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:12:34,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:12:34,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 12 transitions, 28 flow [2024-10-13 12:12:34,712 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-13 12:12:34,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:34,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-10-13 12:12:34,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 12 transitions, 28 flow [2024-10-13 12:12:34,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 12 transitions, 28 flow [2024-10-13 12:12:34,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:12:34,731 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;@843c12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:12:34,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 12:12:34,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:12:34,736 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:12:34,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:34,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:34,737 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:12:34,738 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-10-13 12:12:34,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 140143, now seen corresponding path program 1 times [2024-10-13 12:12:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066985998] [2024-10-13 12:12:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066985998] [2024-10-13 12:12:34,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066985998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:34,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:34,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361088224] [2024-10-13 12:12:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:34,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:12:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:12:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:12:34,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 12 [2024-10-13 12:12:34,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:34,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:34,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 12 [2024-10-13 12:12:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:34,962 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2024-10-13 12:12:34,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:34,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 28. Up to 17 conditions per place. [2024-10-13 12:12:34,966 INFO L140 encePairwiseOnDemand]: 11/12 looper letters, 7 selfloop transitions, 0 changer transitions 0/9 dead transitions. [2024-10-13 12:12:34,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 9 transitions, 36 flow [2024-10-13 12:12:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:12:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:12:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2024-10-13 12:12:35,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-13 12:12:35,002 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 2 states and 14 transitions. [2024-10-13 12:12:35,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 9 transitions, 36 flow [2024-10-13 12:12:35,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 9 transitions, 36 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:35,010 INFO L231 Difference]: Finished difference. Result has 13 places, 9 transitions, 22 flow [2024-10-13 12:12:35,013 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=22, PETRI_PLACES=13, PETRI_TRANSITIONS=9} [2024-10-13 12:12:35,016 INFO L277 CegarLoopForPetriNet]: 15 programPoint places, -2 predicate places. [2024-10-13 12:12:35,016 INFO L471 AbstractCegarLoop]: Abstraction has has 13 places, 9 transitions, 22 flow [2024-10-13 12:12:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,022 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-10-13 12:12:35,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:12:35,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-13 12:12:35,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 134658977, now seen corresponding path program 1 times [2024-10-13 12:12:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85317746] [2024-10-13 12:12:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:35,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:12:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:35,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:12:35,120 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:12:35,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-13 12:12:35,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-10-13 12:12:35,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2024-10-13 12:12:35,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-10-13 12:12:35,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:12:35,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 12:12:35,129 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:12:35,129 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 12:12:35,142 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:12:35,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2024-10-13 12:12:35,155 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-13 12:12:35,159 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:12:35,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 26 events. 0/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 69 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-10-13 12:12:35,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2024-10-13 12:12:35,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2024-10-13 12:12:35,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:12:35,161 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;@843c12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:12:35,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-13 12:12:35,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:12:35,164 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:12:35,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:35,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:12:35,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-13 12:12:35,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,167 INFO L85 PathProgramCache]: Analyzing trace with hash 158017, now seen corresponding path program 1 times [2024-10-13 12:12:35,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921579504] [2024-10-13 12:12:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:35,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921579504] [2024-10-13 12:12:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921579504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940362007] [2024-10-13 12:12:35,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:12:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:35,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:12:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:12:35,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2024-10-13 12:12:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:35,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2024-10-13 12:12:35,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:35,257 INFO L124 PetriNetUnfolderBase]: 64/140 cut-off events. [2024-10-13 12:12:35,260 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-13 12:12:35,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 140 events. 64/140 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 549 event pairs, 64 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 74. Up to 127 conditions per place. [2024-10-13 12:12:35,263 INFO L140 encePairwiseOnDemand]: 17/18 looper letters, 12 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2024-10-13 12:12:35,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 64 flow [2024-10-13 12:12:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:12:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:12:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2024-10-13 12:12:35,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-13 12:12:35,266 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 2 states and 21 transitions. [2024-10-13 12:12:35,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 64 flow [2024-10-13 12:12:35,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:35,268 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 40 flow [2024-10-13 12:12:35,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2024-10-13 12:12:35,269 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2024-10-13 12:12:35,270 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 40 flow [2024-10-13 12:12:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,270 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:12:35,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:12:35,271 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-10-13 12:12:35,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash 412120959, now seen corresponding path program 1 times [2024-10-13 12:12:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138680630] [2024-10-13 12:12:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:35,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:35,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138680630] [2024-10-13 12:12:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138680630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:35,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520818862] [2024-10-13 12:12:35,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:35,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:35,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:35,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:35,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2024-10-13 12:12:35,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:35,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2024-10-13 12:12:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:35,408 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2024-10-13 12:12:35,408 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-13 12:12:35,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 792 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 445. Up to 116 conditions per place. [2024-10-13 12:12:35,412 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2024-10-13 12:12:35,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 109 flow [2024-10-13 12:12:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2024-10-13 12:12:35,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-10-13 12:12:35,414 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 40 flow. Second operand 3 states and 30 transitions. [2024-10-13 12:12:35,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 109 flow [2024-10-13 12:12:35,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:35,417 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 62 flow [2024-10-13 12:12:35,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2024-10-13 12:12:35,418 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-10-13 12:12:35,418 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2024-10-13 12:12:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,419 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-10-13 12:12:35,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:12:35,419 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-10-13 12:12:35,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -109414707, now seen corresponding path program 1 times [2024-10-13 12:12:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883976637] [2024-10-13 12:12:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:35,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:12:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:35,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:12:35,458 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:12:35,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-13 12:12:35,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-10-13 12:12:35,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-10-13 12:12:35,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2024-10-13 12:12:35,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-10-13 12:12:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:12:35,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 12:12:35,460 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:12:35,460 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 12:12:35,479 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:12:35,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 66 flow [2024-10-13 12:12:35,486 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2024-10-13 12:12:35,486 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 12:12:35,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-10-13 12:12:35,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 24 transitions, 66 flow [2024-10-13 12:12:35,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 66 flow [2024-10-13 12:12:35,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:12:35,490 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;@843c12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:12:35,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 12:12:35,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:12:35,492 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:12:35,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:35,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,492 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:12:35,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:12:35,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash 181849, now seen corresponding path program 1 times [2024-10-13 12:12:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344379457] [2024-10-13 12:12:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344379457] [2024-10-13 12:12:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344379457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727674661] [2024-10-13 12:12:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:35,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:12:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:12:35,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:12:35,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-13 12:12:35,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:35,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-13 12:12:35,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:35,637 INFO L124 PetriNetUnfolderBase]: 564/942 cut-off events. [2024-10-13 12:12:35,637 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-10-13 12:12:35,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1940 conditions, 942 events. 564/942 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4912 event pairs, 564 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 287. Up to 877 conditions per place. [2024-10-13 12:12:35,645 INFO L140 encePairwiseOnDemand]: 23/24 looper letters, 17 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2024-10-13 12:12:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 94 flow [2024-10-13 12:12:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:12:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:12:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 28 transitions. [2024-10-13 12:12:35,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-13 12:12:35,647 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 2 states and 28 transitions. [2024-10-13 12:12:35,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 94 flow [2024-10-13 12:12:35,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:35,653 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2024-10-13 12:12:35,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2024-10-13 12:12:35,653 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2024-10-13 12:12:35,654 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2024-10-13 12:12:35,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:12:35,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:12:35,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:12:35,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1122272858, now seen corresponding path program 1 times [2024-10-13 12:12:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332691181] [2024-10-13 12:12:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:35,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332691181] [2024-10-13 12:12:35,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332691181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:35,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:35,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367386104] [2024-10-13 12:12:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:35,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:35,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:35,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:35,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:35,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2024-10-13 12:12:35,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:35,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2024-10-13 12:12:35,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:35,857 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2024-10-13 12:12:35,857 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-10-13 12:12:35,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4294 conditions, 2070 events. 1343/2070 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10029 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 4288. Up to 1272 conditions per place. [2024-10-13 12:12:35,874 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2024-10-13 12:12:35,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 168 flow [2024-10-13 12:12:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-10-13 12:12:35,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-13 12:12:35,877 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 58 flow. Second operand 3 states and 42 transitions. [2024-10-13 12:12:35,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 168 flow [2024-10-13 12:12:35,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:35,879 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 88 flow [2024-10-13 12:12:35,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2024-10-13 12:12:35,879 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2024-10-13 12:12:35,880 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 88 flow [2024-10-13 12:12:35,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:35,880 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:35,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:12:35,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:12:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 459449610, now seen corresponding path program 1 times [2024-10-13 12:12:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820554431] [2024-10-13 12:12:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:12:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820554431] [2024-10-13 12:12:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820554431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:35,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466404891] [2024-10-13 12:12:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:35,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:35,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:35,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2024-10-13 12:12:35,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:35,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:35,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2024-10-13 12:12:35,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:36,128 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2024-10-13 12:12:36,128 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2024-10-13 12:12:36,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13553 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 6311. Up to 1546 conditions per place. [2024-10-13 12:12:36,144 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2024-10-13 12:12:36,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 221 flow [2024-10-13 12:12:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-10-13 12:12:36,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-10-13 12:12:36,147 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 88 flow. Second operand 3 states and 41 transitions. [2024-10-13 12:12:36,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 221 flow [2024-10-13 12:12:36,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:12:36,155 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2024-10-13 12:12:36,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-10-13 12:12:36,156 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-10-13 12:12:36,157 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2024-10-13 12:12:36,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:36,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:36,157 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-10-13 12:12:36,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:12:36,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:12:36,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1357625354, now seen corresponding path program 1 times [2024-10-13 12:12:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061146075] [2024-10-13 12:12:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:36,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:12:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:36,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:12:36,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:12:36,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-13 12:12:36,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-13 12:12:36,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-13 12:12:36,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2024-10-13 12:12:36,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-10-13 12:12:36,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-13 12:12:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:12:36,188 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 12:12:36,189 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:12:36,189 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-13 12:12:36,211 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:12:36,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 88 flow [2024-10-13 12:12:36,215 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2024-10-13 12:12:36,215 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-13 12:12:36,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 0/46 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-10-13 12:12:36,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 30 transitions, 88 flow [2024-10-13 12:12:36,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 88 flow [2024-10-13 12:12:36,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:12:36,219 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;@843c12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:12:36,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-13 12:12:36,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:12:36,222 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:12:36,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:36,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:36,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:12:36,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:12:36,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash 211639, now seen corresponding path program 1 times [2024-10-13 12:12:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:36,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669451572] [2024-10-13 12:12:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669451572] [2024-10-13 12:12:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669451572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606316719] [2024-10-13 12:12:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:36,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:12:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:36,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:12:36,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:12:36,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-10-13 12:12:36,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 88 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-10-13 12:12:36,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:36,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-10-13 12:12:36,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:36,629 INFO L124 PetriNetUnfolderBase]: 4064/5956 cut-off events. [2024-10-13 12:12:36,630 INFO L125 PetriNetUnfolderBase]: For 1817/1817 co-relation queries the response was YES. [2024-10-13 12:12:36,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 5956 events. 4064/5956 cut-off events. For 1817/1817 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 34997 event pairs, 4064 based on Foata normal form. 0/4759 useless extension candidates. Maximal degree in co-relation 1964. Up to 5627 conditions per place. [2024-10-13 12:12:36,663 INFO L140 encePairwiseOnDemand]: 29/30 looper letters, 22 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2024-10-13 12:12:36,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 126 flow [2024-10-13 12:12:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:12:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:12:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2024-10-13 12:12:36,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-13 12:12:36,665 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 88 flow. Second operand 2 states and 35 transitions. [2024-10-13 12:12:36,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 126 flow [2024-10-13 12:12:36,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:36,667 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 76 flow [2024-10-13 12:12:36,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2024-10-13 12:12:36,667 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-10-13 12:12:36,667 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 76 flow [2024-10-13 12:12:36,667 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-10-13 12:12:36,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:36,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:12:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:12:36,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:12:36,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2009930458, now seen corresponding path program 1 times [2024-10-13 12:12:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707162812] [2024-10-13 12:12:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:36,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707162812] [2024-10-13 12:12:36,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707162812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:36,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:36,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894798576] [2024-10-13 12:12:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:36,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:36,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2024-10-13 12:12:36,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:36,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:36,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2024-10-13 12:12:36,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:37,564 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2024-10-13 12:12:37,564 INFO L125 PetriNetUnfolderBase]: For 1375/1375 co-relation queries the response was YES. [2024-10-13 12:12:37,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34713 conditions, 16840 events. 12243/16840 cut-off events. For 1375/1375 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90139 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 34706. Up to 10936 conditions per place. [2024-10-13 12:12:37,660 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-10-13 12:12:37,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 227 flow [2024-10-13 12:12:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-10-13 12:12:37,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-10-13 12:12:37,662 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 76 flow. Second operand 3 states and 54 transitions. [2024-10-13 12:12:37,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 227 flow [2024-10-13 12:12:37,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:37,665 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 114 flow [2024-10-13 12:12:37,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-10-13 12:12:37,665 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-10-13 12:12:37,666 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 114 flow [2024-10-13 12:12:37,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:37,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:37,666 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:37,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 12:12:37,666 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-10-13 12:12:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1204705179, now seen corresponding path program 1 times [2024-10-13 12:12:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327633939] [2024-10-13 12:12:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:12:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327633939] [2024-10-13 12:12:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327633939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704057423] [2024-10-13 12:12:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:37,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2024-10-13 12:12:37,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:37,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:37,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2024-10-13 12:12:37,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:39,171 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2024-10-13 12:12:39,173 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2024-10-13 12:12:39,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55877 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 133519 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 55868. Up to 15062 conditions per place. [2024-10-13 12:12:39,327 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-10-13 12:12:39,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 300 flow [2024-10-13 12:12:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-10-13 12:12:39,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-10-13 12:12:39,330 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 114 flow. Second operand 3 states and 53 transitions. [2024-10-13 12:12:39,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 300 flow [2024-10-13 12:12:39,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:12:39,384 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 172 flow [2024-10-13 12:12:39,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-10-13 12:12:39,385 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-10-13 12:12:39,385 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 172 flow [2024-10-13 12:12:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:39,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:39,386 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:39,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 12:12:39,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:12:39,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:39,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1902144315, now seen corresponding path program 1 times [2024-10-13 12:12:39,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402082500] [2024-10-13 12:12:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:12:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402082500] [2024-10-13 12:12:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402082500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905326101] [2024-10-13 12:12:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:39,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:39,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:39,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2024-10-13 12:12:39,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-13 12:12:39,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:39,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2024-10-13 12:12:39,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:41,026 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2024-10-13 12:12:41,026 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2024-10-13 12:12:41,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79821 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185298 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 79811. Up to 19502 conditions per place. [2024-10-13 12:12:41,222 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-10-13 12:12:41,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 409 flow [2024-10-13 12:12:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-10-13 12:12:41,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-10-13 12:12:41,223 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 172 flow. Second operand 3 states and 52 transitions. [2024-10-13 12:12:41,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 409 flow [2024-10-13 12:12:41,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:12:41,282 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 278 flow [2024-10-13 12:12:41,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2024-10-13 12:12:41,283 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2024-10-13 12:12:41,283 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 278 flow [2024-10-13 12:12:41,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-13 12:12:41,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:41,284 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:12:41,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:12:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1582263447, now seen corresponding path program 1 times [2024-10-13 12:12:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744373313] [2024-10-13 12:12:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:12:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744373313] [2024-10-13 12:12:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744373313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:12:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096335099] [2024-10-13 12:12:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:41,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:12:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:12:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:12:41,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2024-10-13 12:12:41,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:41,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:41,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2024-10-13 12:12:41,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:44,386 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2024-10-13 12:12:44,386 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2024-10-13 12:12:44,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150160 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2350. Compared 356782 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150149. Up to 16776 conditions per place. [2024-10-13 12:12:44,715 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2024-10-13 12:12:44,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 147 transitions, 1084 flow [2024-10-13 12:12:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:12:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:12:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-10-13 12:12:44,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-10-13 12:12:44,717 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 278 flow. Second operand 6 states and 120 transitions. [2024-10-13 12:12:44,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 147 transitions, 1084 flow [2024-10-13 12:12:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:12:44,872 INFO L231 Difference]: Finished difference. Result has 52 places, 70 transitions, 575 flow [2024-10-13 12:12:44,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=52, PETRI_TRANSITIONS=70} [2024-10-13 12:12:44,873 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2024-10-13 12:12:44,873 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 70 transitions, 575 flow [2024-10-13 12:12:44,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:44,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:44,873 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:44,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:12:44,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:12:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1919314977, now seen corresponding path program 2 times [2024-10-13 12:12:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:44,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875354191] [2024-10-13 12:12:44,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:44,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:12:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875354191] [2024-10-13 12:12:44,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875354191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:44,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:44,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:12:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642930380] [2024-10-13 12:12:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:12:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:12:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:12:44,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2024-10-13 12:12:44,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:44,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:44,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2024-10-13 12:12:44,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:48,508 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2024-10-13 12:12:48,508 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2024-10-13 12:12:48,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183312 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404898 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 183297. Up to 19534 conditions per place. [2024-10-13 12:12:48,955 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2024-10-13 12:12:48,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 179 transitions, 1515 flow [2024-10-13 12:12:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:12:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:12:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-10-13 12:12:48,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-13 12:12:48,956 INFO L175 Difference]: Start difference. First operand has 52 places, 70 transitions, 575 flow. Second operand 7 states and 135 transitions. [2024-10-13 12:12:48,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 179 transitions, 1515 flow [2024-10-13 12:12:49,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:49,476 INFO L231 Difference]: Finished difference. Result has 62 places, 95 transitions, 1039 flow [2024-10-13 12:12:49,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=62, PETRI_TRANSITIONS=95} [2024-10-13 12:12:49,476 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2024-10-13 12:12:49,477 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 95 transitions, 1039 flow [2024-10-13 12:12:49,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:49,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:49,477 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 12:12:49,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-13 12:12:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1163165416, now seen corresponding path program 1 times [2024-10-13 12:12:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503885669] [2024-10-13 12:12:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:49,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:12:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:12:49,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:12:49,492 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:12:49,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-13 12:12:49,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-13 12:12:49,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-13 12:12:49,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2024-10-13 12:12:49,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-10-13 12:12:49,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-10-13 12:12:49,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-13 12:12:49,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:12:49,494 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-13 12:12:49,494 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 12:12:49,494 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-13 12:12:49,516 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:12:49,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 112 flow [2024-10-13 12:12:49,524 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2024-10-13 12:12:49,524 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-13 12:12:49,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 56 events. 0/56 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 155 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-10-13 12:12:49,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 36 transitions, 112 flow [2024-10-13 12:12:49,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 112 flow [2024-10-13 12:12:49,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:12:49,526 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;@843c12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:12:49,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:12:49,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:12:49,527 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:12:49,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:12:49,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:49,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:12:49,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:12:49,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 247387, now seen corresponding path program 1 times [2024-10-13 12:12:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:49,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13370892] [2024-10-13 12:12:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13370892] [2024-10-13 12:12:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13370892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:49,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:49,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618817574] [2024-10-13 12:12:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:12:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:49,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:12:49,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:12:49,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-10-13 12:12:49,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:49,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:49,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-10-13 12:12:49,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:51,353 INFO L124 PetriNetUnfolderBase]: 26564/36026 cut-off events. [2024-10-13 12:12:51,354 INFO L125 PetriNetUnfolderBase]: For 14312/14312 co-relation queries the response was YES. [2024-10-13 12:12:51,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74901 conditions, 36026 events. 26564/36026 cut-off events. For 14312/14312 co-relation queries the response was YES. Maximal size of possible extension queue 1834. Compared 226782 event pairs, 26564 based on Foata normal form. 0/28479 useless extension candidates. Maximal degree in co-relation 12478. Up to 34377 conditions per place. [2024-10-13 12:12:51,561 INFO L140 encePairwiseOnDemand]: 35/36 looper letters, 27 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2024-10-13 12:12:51,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 160 flow [2024-10-13 12:12:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:12:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:12:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2024-10-13 12:12:51,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-13 12:12:51,562 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 112 flow. Second operand 2 states and 42 transitions. [2024-10-13 12:12:51,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 160 flow [2024-10-13 12:12:51,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 33 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:51,566 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 94 flow [2024-10-13 12:12:51,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-10-13 12:12:51,567 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-10-13 12:12:51,567 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 94 flow [2024-10-13 12:12:51,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:51,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:51,567 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:12:51,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:12:51,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:12:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1219888432, now seen corresponding path program 1 times [2024-10-13 12:12:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:51,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813901177] [2024-10-13 12:12:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:51,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:12:51,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:51,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813901177] [2024-10-13 12:12:51,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813901177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:51,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:51,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150210538] [2024-10-13 12:12:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:51,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:51,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:51,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2024-10-13 12:12:51,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:51,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:51,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2024-10-13 12:12:51,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:12:57,680 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2024-10-13 12:12:57,685 INFO L125 PetriNetUnfolderBase]: For 11167/11167 co-relation queries the response was YES. [2024-10-13 12:12:58,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258461 conditions, 126043 events. 97851/126043 cut-off events. For 11167/11167 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 716049 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 258453. Up to 84136 conditions per place. [2024-10-13 12:12:58,653 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-10-13 12:12:58,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 286 flow [2024-10-13 12:12:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:12:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:12:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-10-13 12:12:58,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-10-13 12:12:58,654 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 94 flow. Second operand 3 states and 66 transitions. [2024-10-13 12:12:58,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 286 flow [2024-10-13 12:12:58,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:12:58,666 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 140 flow [2024-10-13 12:12:58,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-10-13 12:12:58,666 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-10-13 12:12:58,666 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 140 flow [2024-10-13 12:12:58,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:58,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:12:58,666 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 12:12:58,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 12:12:58,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:12:58,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:12:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash 205603116, now seen corresponding path program 1 times [2024-10-13 12:12:58,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:12:58,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668846422] [2024-10-13 12:12:58,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:12:58,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:12:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:12:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:12:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:12:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668846422] [2024-10-13 12:12:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668846422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:12:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:12:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:12:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218639271] [2024-10-13 12:12:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:12:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:12:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:12:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:12:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:12:58,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2024-10-13 12:12:58,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:12:58,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:12:58,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2024-10-13 12:12:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:13:08,031 INFO L124 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2024-10-13 12:13:08,031 INFO L125 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2024-10-13 12:13:08,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429057 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083778 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 429047. Up to 121118 conditions per place. [2024-10-13 12:13:09,189 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-10-13 12:13:09,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 379 flow [2024-10-13 12:13:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:13:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:13:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-10-13 12:13:09,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-10-13 12:13:09,190 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 140 flow. Second operand 3 states and 65 transitions. [2024-10-13 12:13:09,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 379 flow [2024-10-13 12:13:10,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:13:10,686 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 216 flow [2024-10-13 12:13:10,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-10-13 12:13:10,686 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-10-13 12:13:10,686 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 216 flow [2024-10-13 12:13:10,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:13:10,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:13:10,687 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:13:10,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 12:13:10,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:13:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:13:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 13224406, now seen corresponding path program 1 times [2024-10-13 12:13:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:13:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948188235] [2024-10-13 12:13:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:13:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:13:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:13:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 12:13:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:13:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948188235] [2024-10-13 12:13:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948188235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:13:10,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:13:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:13:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979738588] [2024-10-13 12:13:10,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:13:10,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:13:10,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:13:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:13:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:13:10,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2024-10-13 12:13:10,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-13 12:13:10,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:13:10,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2024-10-13 12:13:10,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand