./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/35_double_lock_p3_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 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:24:26,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:24:26,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:24:26,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:24:26,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:24:26,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:24:26,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:24:26,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:24:26,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:24:26,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:24:26,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:24:26,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:24:26,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:24:26,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:24:26,200 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:24:26,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:24:26,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:24:26,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:24:26,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:24:26,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:24:26,201 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:24:26,203 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:24:26,205 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:24:26,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:24:26,205 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:24:26,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:24:26,206 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:24:26,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:24:26,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:24:26,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:24:26,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:24:26,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:24:26,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:24:26,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:24:26,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:24:26,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:24:26,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:24:26,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:24:26,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:24:26,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:24:26,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:24:26,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:24:26,211 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 -> 22ba795826618dfa50b90a88d5a4c30adee7dfead438325f939eb97a379da897 [2024-11-09 10:24:26,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:24:26,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:24:26,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:24:26,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:24:26,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:24:26,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2024-11-09 10:24:28,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:24:28,364 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:24:28,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/35_double_lock_p3_vs.i [2024-11-09 10:24:28,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19855df35/f7b035c04d5249f2b0d1e46c0eaa7a87/FLAGc32e4d92a [2024-11-09 10:24:28,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19855df35/f7b035c04d5249f2b0d1e46c0eaa7a87 [2024-11-09 10:24:28,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:24:28,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:24:28,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:24:28,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:24:28,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:24:28,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:24:28" (1/1) ... [2024-11-09 10:24:28,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746137d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:28, skipping insertion in model container [2024-11-09 10:24:28,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:24:28" (1/1) ... [2024-11-09 10:24:28,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:24:28,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:24:28,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:24:28,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:24:29,017 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:24:29,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29 WrapperNode [2024-11-09 10:24:29,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:24:29,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:24:29,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:24:29,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:24:29,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,125 INFO L138 Inliner]: procedures = 164, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2024-11-09 10:24:29,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:24:29,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:24:29,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:24:29,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:24:29,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,165 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-11-09 10:24:29,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:24:29,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:24:29,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:24:29,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:24:29,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (1/1) ... [2024-11-09 10:24:29,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:24:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:24:29,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:24:29,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:24:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-09 10:24:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-09 10:24:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 10:24:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 10:24:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:24:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:24:29,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:24:29,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:24:29,271 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:24:29,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:24:29,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:24:29,273 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:24:29,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:24:29,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:24:29,613 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:24:29,614 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:24:29,734 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:24:29,734 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:24:29,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:24:29 BoogieIcfgContainer [2024-11-09 10:24:29,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:24:29,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:24:29,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:24:29,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:24:29,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:24:28" (1/3) ... [2024-11-09 10:24:29,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad0c793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:24:29, skipping insertion in model container [2024-11-09 10:24:29,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:24:29" (2/3) ... [2024-11-09 10:24:29,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad0c793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:24:29, skipping insertion in model container [2024-11-09 10:24:29,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:24:29" (3/3) ... [2024-11-09 10:24:29,747 INFO L112 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2024-11-09 10:24:29,763 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:24:29,763 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:24:29,763 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:24:29,814 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:29,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 82 flow [2024-11-09 10:24:29,879 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-11-09 10:24:29,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:29,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 40 events. 4/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-11-09 10:24:29,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 82 flow [2024-11-09 10:24:29,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 36 transitions, 79 flow [2024-11-09 10:24:29,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:29,910 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;@8ed1ebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:29,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 10:24:29,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:29,916 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-11-09 10:24:29,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:29,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:29,917 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:29,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:24:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 250028329, now seen corresponding path program 1 times [2024-11-09 10:24:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006340853] [2024-11-09 10:24:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:30,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:30,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006340853] [2024-11-09 10:24:30,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006340853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:30,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053662699] [2024-11-09 10:24:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:30,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:30,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:30,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:30,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-09 10:24:30,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:30,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:30,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-09 10:24:30,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:30,271 INFO L124 PetriNetUnfolderBase]: 198/365 cut-off events. [2024-11-09 10:24:30,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:30,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 365 events. 198/365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1800 event pairs, 185 based on Foata normal form. 106/454 useless extension candidates. Maximal degree in co-relation 711. Up to 343 conditions per place. [2024-11-09 10:24:30,282 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 20 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2024-11-09 10:24:30,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 105 flow [2024-11-09 10:24:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2024-11-09 10:24:30,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-11-09 10:24:30,298 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 79 flow. Second operand 2 states and 46 transitions. [2024-11-09 10:24:30,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 105 flow [2024-11-09 10:24:30,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:30,302 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 64 flow [2024-11-09 10:24:30,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2024-11-09 10:24:30,307 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2024-11-09 10:24:30,308 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 64 flow [2024-11-09 10:24:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:30,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:30,310 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:24:30,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 10:24:30,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1121329882, now seen corresponding path program 1 times [2024-11-09 10:24:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:30,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695521047] [2024-11-09 10:24:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:30,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:30,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:30,427 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:30,429 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-09 10:24:30,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-09 10:24:30,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2024-11-09 10:24:30,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-09 10:24:30,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-09 10:24:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:24:30,433 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 10:24:30,435 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:30,436 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 10:24:30,473 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:30,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 150 flow [2024-11-09 10:24:30,495 INFO L124 PetriNetUnfolderBase]: 5/58 cut-off events. [2024-11-09 10:24:30,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:24:30,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 58 events. 5/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 161 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2024-11-09 10:24:30,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 65 transitions, 150 flow [2024-11-09 10:24:30,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 49 transitions, 111 flow [2024-11-09 10:24:30,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:30,500 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;@8ed1ebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:30,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:24:30,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:30,506 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:30,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:30,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:30,506 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:30,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:24:30,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 312862511, now seen corresponding path program 1 times [2024-11-09 10:24:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:30,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126367503] [2024-11-09 10:24:30,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:30,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126367503] [2024-11-09 10:24:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126367503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719434574] [2024-11-09 10:24:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:30,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:30,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2024-11-09 10:24:30,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:30,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:30,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2024-11-09 10:24:30,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:31,224 INFO L124 PetriNetUnfolderBase]: 3751/5538 cut-off events. [2024-11-09 10:24:31,225 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-11-09 10:24:31,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11032 conditions, 5538 events. 3751/5538 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32624 event pairs, 3474 based on Foata normal form. 1196/6418 useless extension candidates. Maximal degree in co-relation 11021. Up to 5348 conditions per place. [2024-11-09 10:24:31,281 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2024-11-09 10:24:31,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 161 flow [2024-11-09 10:24:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2024-11-09 10:24:31,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2024-11-09 10:24:31,285 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 111 flow. Second operand 2 states and 74 transitions. [2024-11-09 10:24:31,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 161 flow [2024-11-09 10:24:31,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:31,292 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 96 flow [2024-11-09 10:24:31,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-09 10:24:31,293 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-09 10:24:31,294 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 96 flow [2024-11-09 10:24:31,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:31,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:31,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:31,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:24:31,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:24:31,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash 153112686, now seen corresponding path program 1 times [2024-11-09 10:24:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:31,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534452554] [2024-11-09 10:24:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:31,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:31,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534452554] [2024-11-09 10:24:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534452554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:31,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920230349] [2024-11-09 10:24:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:31,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2024-11-09 10:24:31,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:31,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:31,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2024-11-09 10:24:31,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:31,878 INFO L124 PetriNetUnfolderBase]: 2714/4054 cut-off events. [2024-11-09 10:24:31,879 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2024-11-09 10:24:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 4054 events. 2714/4054 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23104 event pairs, 2506 based on Foata normal form. 398/4215 useless extension candidates. Maximal degree in co-relation 8072. Up to 3911 conditions per place. [2024-11-09 10:24:31,908 INFO L140 encePairwiseOnDemand]: 63/65 looper letters, 30 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2024-11-09 10:24:31,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 152 flow [2024-11-09 10:24:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:24:31,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4564102564102564 [2024-11-09 10:24:31,913 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 96 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:24:31,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 152 flow [2024-11-09 10:24:31,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:24:31,916 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 92 flow [2024-11-09 10:24:31,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-11-09 10:24:31,918 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2024-11-09 10:24:31,918 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 92 flow [2024-11-09 10:24:31,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:31,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:31,920 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:31,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:24:31,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:24:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1278669066, now seen corresponding path program 1 times [2024-11-09 10:24:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:31,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749641333] [2024-11-09 10:24:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:31,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:31,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:31,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:31,978 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:31,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-09 10:24:31,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:24:31,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:24:31,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 10:24:31,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-11-09 10:24:31,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-09 10:24:31,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:24:31,980 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:24:31,984 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:31,984 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 10:24:32,020 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:32,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 222 flow [2024-11-09 10:24:32,033 INFO L124 PetriNetUnfolderBase]: 6/76 cut-off events. [2024-11-09 10:24:32,034 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 10:24:32,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 76 events. 6/76 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 233 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2024-11-09 10:24:32,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 93 transitions, 222 flow [2024-11-09 10:24:32,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 145 flow [2024-11-09 10:24:32,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:32,042 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;@8ed1ebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:32,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:24:32,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:32,047 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:32,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:32,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:32,048 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:32,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:24:32,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 402417233, now seen corresponding path program 1 times [2024-11-09 10:24:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200207800] [2024-11-09 10:24:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:32,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200207800] [2024-11-09 10:24:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200207800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:32,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129124124] [2024-11-09 10:24:32,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:32,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:32,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 93 [2024-11-09 10:24:32,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 145 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:32,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:32,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 93 [2024-11-09 10:24:32,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:38,751 INFO L124 PetriNetUnfolderBase]: 58806/78313 cut-off events. [2024-11-09 10:24:38,751 INFO L125 PetriNetUnfolderBase]: For 3412/3412 co-relation queries the response was YES. [2024-11-09 10:24:38,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156771 conditions, 78313 events. 58806/78313 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 2927. Compared 506464 event pairs, 54173 based on Foata normal form. 13175/86404 useless extension candidates. Maximal degree in co-relation 156759. Up to 76375 conditions per place. [2024-11-09 10:24:39,374 INFO L140 encePairwiseOnDemand]: 89/93 looper letters, 44 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2024-11-09 10:24:39,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 219 flow [2024-11-09 10:24:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:24:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:24:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2024-11-09 10:24:39,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-11-09 10:24:39,381 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 145 flow. Second operand 2 states and 102 transitions. [2024-11-09 10:24:39,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 219 flow [2024-11-09 10:24:39,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 216 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:24:39,396 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 128 flow [2024-11-09 10:24:39,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-11-09 10:24:39,398 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2024-11-09 10:24:39,399 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 128 flow [2024-11-09 10:24:39,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:39,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:39,399 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:39,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:24:39,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:24:39,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash 6601770, now seen corresponding path program 1 times [2024-11-09 10:24:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:39,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994046753] [2024-11-09 10:24:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994046753] [2024-11-09 10:24:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994046753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466828779] [2024-11-09 10:24:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:24:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:39,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:24:39,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:24:39,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 93 [2024-11-09 10:24:39,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:39,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:39,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 93 [2024-11-09 10:24:39,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:24:43,123 INFO L124 PetriNetUnfolderBase]: 43007/57637 cut-off events. [2024-11-09 10:24:43,124 INFO L125 PetriNetUnfolderBase]: For 1482/1482 co-relation queries the response was YES. [2024-11-09 10:24:43,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115022 conditions, 57637 events. 43007/57637 cut-off events. For 1482/1482 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 365457 event pairs, 39532 based on Foata normal form. 4391/58215 useless extension candidates. Maximal degree in co-relation 115016. Up to 56183 conditions per place. [2024-11-09 10:24:43,496 INFO L140 encePairwiseOnDemand]: 91/93 looper letters, 42 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2024-11-09 10:24:43,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 208 flow [2024-11-09 10:24:43,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:24:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:24:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-09 10:24:43,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2024-11-09 10:24:43,499 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 128 flow. Second operand 3 states and 125 transitions. [2024-11-09 10:24:43,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 208 flow [2024-11-09 10:24:43,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:24:43,503 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 124 flow [2024-11-09 10:24:43,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-11-09 10:24:43,504 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-11-09 10:24:43,504 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 124 flow [2024-11-09 10:24:43,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:43,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:43,505 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:24:43,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:24:43,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 10:24:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash -220161489, now seen corresponding path program 1 times [2024-11-09 10:24:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009353224] [2024-11-09 10:24:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:43,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:24:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:24:43,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:24:43,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:24:43,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-09 10:24:43,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:24:43,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:24:43,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:24:43,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-09 10:24:43,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:24:43,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:24:43,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:24:43,543 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 10:24:43,543 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 10:24:43,544 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 10:24:43,580 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:24:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 121 transitions, 298 flow [2024-11-09 10:24:43,590 INFO L124 PetriNetUnfolderBase]: 7/94 cut-off events. [2024-11-09 10:24:43,591 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:24:43,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 94 events. 7/94 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 308 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 110. Up to 5 conditions per place. [2024-11-09 10:24:43,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 121 transitions, 298 flow [2024-11-09 10:24:43,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 75 transitions, 181 flow [2024-11-09 10:24:43,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:24:43,594 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;@8ed1ebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:24:43,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:24:43,596 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:24:43,596 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-09 10:24:43,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:24:43,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:43,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:24:43,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-09 10:24:43,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 518692495, now seen corresponding path program 1 times [2024-11-09 10:24:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:24:43,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485335573] [2024-11-09 10:24:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:24:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:24:43,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485335573] [2024-11-09 10:24:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485335573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:24:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780709750] [2024-11-09 10:24:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:43,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:24:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:24:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:24:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:24:43,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 121 [2024-11-09 10:24:43,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 181 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:24:43,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:43,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 121 [2024-11-09 10:24:43,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand