./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.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-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:22:50,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:50,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:22:50,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:50,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:50,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:50,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:50,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:50,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:50,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:50,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:50,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:50,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:50,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:50,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:50,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:50,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:50,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:50,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:50,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:50,211 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:50,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:50,212 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:50,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:50,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:50,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:50,213 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:50,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:50,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:50,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:50,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:50,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:50,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:50,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:50,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:50,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:50,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:22:50,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:22:50,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:50,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:50,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:50,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:50,217 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2024-11-09 10:22:50,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:50,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:50,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:50,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:50,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:50,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-09 10:22:51,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:52,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:52,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-09 10:22:52,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4f14d21/32dbefafdbd14336a8ac4f7eab0991fa/FLAGde7aca9fb [2024-11-09 10:22:52,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4f14d21/32dbefafdbd14336a8ac4f7eab0991fa [2024-11-09 10:22:52,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:52,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:52,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:52,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:52,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:52,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735eea8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52, skipping insertion in model container [2024-11-09 10:22:52,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:52,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:52,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:52,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:52,493 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:52,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52 WrapperNode [2024-11-09 10:22:52,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:52,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:52,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:52,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:52,501 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:22:52" (1/1) ... [2024-11-09 10:22:52,517 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:22:52" (1/1) ... [2024-11-09 10:22:52,536 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-09 10:22:52,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:52,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:52,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:52,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:52,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,566 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-11-09 10:22:52,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:52,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:52,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:52,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:52,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (1/1) ... [2024-11-09 10:22:52,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:52,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:52,620 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:22:52,622 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:22:52,663 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-09 10:22:52,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-09 10:22:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 10:22:52,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 10:22:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:22:52,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:52,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:52,666 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:22:52,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:52,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:52,936 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:52,936 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:52,989 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:52,991 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 10:22:52,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:52 BoogieIcfgContainer [2024-11-09 10:22:52,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:52,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:52,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:52,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:52,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:52" (1/3) ... [2024-11-09 10:22:52,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cae9bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:52, skipping insertion in model container [2024-11-09 10:22:52,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:52" (2/3) ... [2024-11-09 10:22:52,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cae9bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:52, skipping insertion in model container [2024-11-09 10:22:52,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:52" (3/3) ... [2024-11-09 10:22:53,001 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-11-09 10:22:53,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:53,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:22:53,016 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:53,075 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:22:53,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 78 transitions, 170 flow [2024-11-09 10:22:53,133 INFO L124 PetriNetUnfolderBase]: 20/76 cut-off events. [2024-11-09 10:22:53,133 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:22:53,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 76 events. 20/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 193 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 71. Up to 4 conditions per place. [2024-11-09 10:22:53,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 78 transitions, 170 flow [2024-11-09 10:22:53,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 75 transitions, 162 flow [2024-11-09 10:22:53,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:53,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;@590beb8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:53,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:22:53,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:53,174 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 10:22:53,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:53,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:53,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:53,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash -466669316, now seen corresponding path program 1 times [2024-11-09 10:22:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203552753] [2024-11-09 10:22:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:53,344 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:22:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203552753] [2024-11-09 10:22:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203552753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:53,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455183400] [2024-11-09 10:22:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:22:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:22:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:22:53,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 78 [2024-11-09 10:22:53,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 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:22:53,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:53,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 78 [2024-11-09 10:22:53,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:53,461 INFO L124 PetriNetUnfolderBase]: 186/447 cut-off events. [2024-11-09 10:22:53,462 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 10:22:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 447 events. 186/447 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2262 event pairs, 58 based on Foata normal form. 84/443 useless extension candidates. Maximal degree in co-relation 632. Up to 212 conditions per place. [2024-11-09 10:22:53,470 INFO L140 encePairwiseOnDemand]: 70/78 looper letters, 17 selfloop transitions, 0 changer transitions 0/65 dead transitions. [2024-11-09 10:22:53,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 176 flow [2024-11-09 10:22:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:22:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:22:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2024-11-09 10:22:53,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2024-11-09 10:22:53,488 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 162 flow. Second operand 2 states and 129 transitions. [2024-11-09 10:22:53,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 176 flow [2024-11-09 10:22:53,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:53,493 INFO L231 Difference]: Finished difference. Result has 57 places, 65 transitions, 134 flow [2024-11-09 10:22:53,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=57, PETRI_TRANSITIONS=65} [2024-11-09 10:22:53,498 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2024-11-09 10:22:53,498 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 65 transitions, 134 flow [2024-11-09 10:22:53,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 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:22:53,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:53,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:53,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:22:53,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -694881973, now seen corresponding path program 1 times [2024-11-09 10:22:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709238311] [2024-11-09 10:22:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:53,590 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:22:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709238311] [2024-11-09 10:22:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709238311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320822341] [2024-11-09 10:22:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:53,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:53,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:53,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:53,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 78 [2024-11-09 10:22:53,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 65 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:22:53,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:53,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 78 [2024-11-09 10:22:53,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:53,750 INFO L124 PetriNetUnfolderBase]: 234/563 cut-off events. [2024-11-09 10:22:53,752 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 10:22:53,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 563 events. 234/563 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3167 event pairs, 44 based on Foata normal form. 15/484 useless extension candidates. Maximal degree in co-relation 879. Up to 169 conditions per place. [2024-11-09 10:22:53,761 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 27 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2024-11-09 10:22:53,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 216 flow [2024-11-09 10:22:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-09 10:22:53,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7649572649572649 [2024-11-09 10:22:53,765 INFO L175 Difference]: Start difference. First operand has 57 places, 65 transitions, 134 flow. Second operand 3 states and 179 transitions. [2024-11-09 10:22:53,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 216 flow [2024-11-09 10:22:53,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:22:53,769 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 154 flow [2024-11-09 10:22:53,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2024-11-09 10:22:53,771 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-09 10:22:53,772 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 154 flow [2024-11-09 10:22:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:22:53,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:53,773 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:53,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:22:53,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1579381939, now seen corresponding path program 1 times [2024-11-09 10:22:53,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:53,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096534489] [2024-11-09 10:22:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:53,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096534489] [2024-11-09 10:22:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096534489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:53,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647168117] [2024-11-09 10:22:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:53,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:53,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 78 [2024-11-09 10:22:53,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:53,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:53,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 78 [2024-11-09 10:22:53,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:53,941 INFO L124 PetriNetUnfolderBase]: 217/546 cut-off events. [2024-11-09 10:22:53,941 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-09 10:22:53,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 546 events. 217/546 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3034 event pairs, 61 based on Foata normal form. 19/475 useless extension candidates. Maximal degree in co-relation 949. Up to 208 conditions per place. [2024-11-09 10:22:53,944 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 27 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2024-11-09 10:22:53,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 230 flow [2024-11-09 10:22:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2024-11-09 10:22:53,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7606837606837606 [2024-11-09 10:22:53,946 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 154 flow. Second operand 3 states and 178 transitions. [2024-11-09 10:22:53,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 230 flow [2024-11-09 10:22:53,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:53,948 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 158 flow [2024-11-09 10:22:53,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2024-11-09 10:22:53,949 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2024-11-09 10:22:53,949 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 158 flow [2024-11-09 10:22:53,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:53,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:53,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:53,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:22:53,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:53,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -264967604, now seen corresponding path program 1 times [2024-11-09 10:22:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045069469] [2024-11-09 10:22:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:54,006 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:22:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045069469] [2024-11-09 10:22:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045069469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:54,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:54,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918662864] [2024-11-09 10:22:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:54,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:54,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:54,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2024-11-09 10:22:54,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:22:54,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:54,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2024-11-09 10:22:54,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:54,130 INFO L124 PetriNetUnfolderBase]: 431/985 cut-off events. [2024-11-09 10:22:54,131 INFO L125 PetriNetUnfolderBase]: For 112/116 co-relation queries the response was YES. [2024-11-09 10:22:54,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 985 events. 431/985 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6042 event pairs, 150 based on Foata normal form. 19/929 useless extension candidates. Maximal degree in co-relation 1738. Up to 471 conditions per place. [2024-11-09 10:22:54,137 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 33 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-11-09 10:22:54,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 263 flow [2024-11-09 10:22:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2024-11-09 10:22:54,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7350427350427351 [2024-11-09 10:22:54,142 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 158 flow. Second operand 3 states and 172 transitions. [2024-11-09 10:22:54,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 263 flow [2024-11-09 10:22:54,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:54,146 INFO L231 Difference]: Finished difference. Result has 65 places, 70 transitions, 202 flow [2024-11-09 10:22:54,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2024-11-09 10:22:54,147 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-11-09 10:22:54,148 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 202 flow [2024-11-09 10:22:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:22:54,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:54,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:54,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:22:54,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:54,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1922975346, now seen corresponding path program 2 times [2024-11-09 10:22:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514511172] [2024-11-09 10:22:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:54,216 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:22:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:54,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514511172] [2024-11-09 10:22:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514511172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:54,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:54,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:54,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528570251] [2024-11-09 10:22:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:54,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:54,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 78 [2024-11-09 10:22:54,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:22:54,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:54,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 78 [2024-11-09 10:22:54,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:54,368 INFO L124 PetriNetUnfolderBase]: 589/1499 cut-off events. [2024-11-09 10:22:54,369 INFO L125 PetriNetUnfolderBase]: For 224/256 co-relation queries the response was YES. [2024-11-09 10:22:54,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 1499 events. 589/1499 cut-off events. For 224/256 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10996 event pairs, 165 based on Foata normal form. 35/1366 useless extension candidates. Maximal degree in co-relation 2827. Up to 391 conditions per place. [2024-11-09 10:22:54,376 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 33 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2024-11-09 10:22:54,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 310 flow [2024-11-09 10:22:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-09 10:22:54,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7649572649572649 [2024-11-09 10:22:54,378 INFO L175 Difference]: Start difference. First operand has 65 places, 70 transitions, 202 flow. Second operand 3 states and 179 transitions. [2024-11-09 10:22:54,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 310 flow [2024-11-09 10:22:54,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:54,409 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 220 flow [2024-11-09 10:22:54,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2024-11-09 10:22:54,410 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-09 10:22:54,410 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 220 flow [2024-11-09 10:22:54,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:22:54,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:54,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:54,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:22:54,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:54,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash -921894616, now seen corresponding path program 3 times [2024-11-09 10:22:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530348057] [2024-11-09 10:22:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:54,457 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:22:54,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530348057] [2024-11-09 10:22:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530348057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614986972] [2024-11-09 10:22:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:54,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:54,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2024-11-09 10:22:54,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:22:54,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:54,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2024-11-09 10:22:54,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:54,602 INFO L124 PetriNetUnfolderBase]: 648/1653 cut-off events. [2024-11-09 10:22:54,602 INFO L125 PetriNetUnfolderBase]: For 418/492 co-relation queries the response was YES. [2024-11-09 10:22:54,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3460 conditions, 1653 events. 648/1653 cut-off events. For 418/492 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12187 event pairs, 265 based on Foata normal form. 81/1656 useless extension candidates. Maximal degree in co-relation 3452. Up to 774 conditions per place. [2024-11-09 10:22:54,611 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 35 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2024-11-09 10:22:54,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 337 flow [2024-11-09 10:22:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2024-11-09 10:22:54,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2024-11-09 10:22:54,613 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 220 flow. Second operand 3 states and 171 transitions. [2024-11-09 10:22:54,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 337 flow [2024-11-09 10:22:54,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:54,619 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 272 flow [2024-11-09 10:22:54,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2024-11-09 10:22:54,620 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-09 10:22:54,621 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 272 flow [2024-11-09 10:22:54,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:22:54,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:54,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:54,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:22:54,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:54,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1986973752, now seen corresponding path program 4 times [2024-11-09 10:22:54,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:54,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185953128] [2024-11-09 10:22:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:54,673 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:22:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185953128] [2024-11-09 10:22:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185953128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659652348] [2024-11-09 10:22:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:54,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:54,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:54,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:54,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 78 [2024-11-09 10:22:54,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 77 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:22:54,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:54,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 78 [2024-11-09 10:22:54,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:54,804 INFO L124 PetriNetUnfolderBase]: 426/1283 cut-off events. [2024-11-09 10:22:54,804 INFO L125 PetriNetUnfolderBase]: For 473/552 co-relation queries the response was YES. [2024-11-09 10:22:54,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1283 events. 426/1283 cut-off events. For 473/552 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9752 event pairs, 135 based on Foata normal form. 69/1254 useless extension candidates. Maximal degree in co-relation 2727. Up to 302 conditions per place. [2024-11-09 10:22:54,809 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 34 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2024-11-09 10:22:54,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 383 flow [2024-11-09 10:22:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2024-11-09 10:22:54,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7606837606837606 [2024-11-09 10:22:54,811 INFO L175 Difference]: Start difference. First operand has 69 places, 77 transitions, 272 flow. Second operand 3 states and 178 transitions. [2024-11-09 10:22:54,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 383 flow [2024-11-09 10:22:54,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:54,815 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 282 flow [2024-11-09 10:22:54,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2024-11-09 10:22:54,816 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2024-11-09 10:22:54,817 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 282 flow [2024-11-09 10:22:54,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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:22:54,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:54,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:54,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:22:54,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:54,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -383460188, now seen corresponding path program 1 times [2024-11-09 10:22:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320521868] [2024-11-09 10:22:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320521868] [2024-11-09 10:22:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320521868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:54,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910430369] [2024-11-09 10:22:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:54,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:54,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:54,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 78 [2024-11-09 10:22:54,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:22:54,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:54,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 78 [2024-11-09 10:22:54,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:54,954 INFO L124 PetriNetUnfolderBase]: 379/1158 cut-off events. [2024-11-09 10:22:54,955 INFO L125 PetriNetUnfolderBase]: For 302/362 co-relation queries the response was YES. [2024-11-09 10:22:54,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 1158 events. 379/1158 cut-off events. For 302/362 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8578 event pairs, 137 based on Foata normal form. 30/1122 useless extension candidates. Maximal degree in co-relation 2436. Up to 414 conditions per place. [2024-11-09 10:22:54,961 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 22 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2024-11-09 10:22:54,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 83 transitions, 347 flow [2024-11-09 10:22:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2024-11-09 10:22:54,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2024-11-09 10:22:54,962 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 282 flow. Second operand 3 states and 171 transitions. [2024-11-09 10:22:54,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 83 transitions, 347 flow [2024-11-09 10:22:54,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 331 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:54,967 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 284 flow [2024-11-09 10:22:54,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2024-11-09 10:22:54,969 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2024-11-09 10:22:54,969 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 79 transitions, 284 flow [2024-11-09 10:22:54,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:22:54,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:54,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:54,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:22:54,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1845121335, now seen corresponding path program 1 times [2024-11-09 10:22:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:54,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702633541] [2024-11-09 10:22:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:55,012 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:22:55,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702633541] [2024-11-09 10:22:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702633541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:55,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:55,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228672356] [2024-11-09 10:22:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:55,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 78 [2024-11-09 10:22:55,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 79 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:22:55,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:55,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 78 [2024-11-09 10:22:55,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:55,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_1|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_#res#1.base][48], [Black: 94#true, 99#true, Black: 101#(= ~b2~0 1), 77#(= ~X~0 1), 3#L790true, 41#thr2EXITtrue, Black: 72#(= ~X~0 0), 57#L740-1true, Black: 81#(= ~y~0 1), Black: 86#(= 2 ~x~0), 103#true, Black: 91#(= 2 ~y~0), 68#true]) [2024-11-09 10:22:55,103 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-09 10:22:55,103 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:22:55,103 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:22:55,103 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-09 10:22:55,108 INFO L124 PetriNetUnfolderBase]: 327/1028 cut-off events. [2024-11-09 10:22:55,108 INFO L125 PetriNetUnfolderBase]: For 177/211 co-relation queries the response was YES. [2024-11-09 10:22:55,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 1028 events. 327/1028 cut-off events. For 177/211 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6980 event pairs, 128 based on Foata normal form. 22/994 useless extension candidates. Maximal degree in co-relation 2204. Up to 353 conditions per place. [2024-11-09 10:22:55,114 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 21 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-11-09 10:22:55,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 321 flow [2024-11-09 10:22:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2024-11-09 10:22:55,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7264957264957265 [2024-11-09 10:22:55,115 INFO L175 Difference]: Start difference. First operand has 72 places, 79 transitions, 284 flow. Second operand 3 states and 170 transitions. [2024-11-09 10:22:55,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 321 flow [2024-11-09 10:22:55,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 307 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:55,118 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 260 flow [2024-11-09 10:22:55,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2024-11-09 10:22:55,119 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-09 10:22:55,119 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 260 flow [2024-11-09 10:22:55,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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:22:55,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:55,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:55,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:22:55,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:22:55,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -199245501, now seen corresponding path program 1 times [2024-11-09 10:22:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506148693] [2024-11-09 10:22:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:55,183 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:22:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506148693] [2024-11-09 10:22:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506148693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:22:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339799924] [2024-11-09 10:22:55,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:55,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 78 [2024-11-09 10:22:55,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:22:55,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:55,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 78 [2024-11-09 10:22:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:55,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([355] L783-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_1|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_#res#1.base][44], [Black: 94#true, Black: 101#(= ~b2~0 1), 77#(= ~X~0 1), 41#thr2EXITtrue, 3#L790true, Black: 72#(= ~X~0 0), Black: 105#(= ~b1~0 1), 109#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 81#(= ~y~0 1), Black: 86#(= 2 ~x~0), 22#L748-3true, 103#true, Black: 91#(= 2 ~y~0), 68#true]) [2024-11-09 10:22:55,260 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 10:22:55,260 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:22:55,260 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:22:55,260 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-09 10:22:55,264 INFO L124 PetriNetUnfolderBase]: 222/760 cut-off events. [2024-11-09 10:22:55,264 INFO L125 PetriNetUnfolderBase]: For 140/163 co-relation queries the response was YES. [2024-11-09 10:22:55,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 760 events. 222/760 cut-off events. For 140/163 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5003 event pairs, 95 based on Foata normal form. 5/683 useless extension candidates. Maximal degree in co-relation 1587. Up to 272 conditions per place. [2024-11-09 10:22:55,267 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 0 selfloop transitions, 0 changer transitions 71/71 dead transitions. [2024-11-09 10:22:55,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 288 flow [2024-11-09 10:22:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-11-09 10:22:55,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-11-09 10:22:55,269 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 260 flow. Second operand 3 states and 169 transitions. [2024-11-09 10:22:55,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 288 flow [2024-11-09 10:22:55,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:55,271 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2024-11-09 10:22:55,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2024-11-09 10:22:55,271 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-09 10:22:55,272 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2024-11-09 10:22:55,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:22:55,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:22:55,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:22:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:22:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:22:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:22:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:22:55,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:22:55,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:22:55,275 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:55,282 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:22:55,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:22:55,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:22:55 BasicIcfg [2024-11-09 10:22:55,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:22:55,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:22:55,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:22:55,289 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:22:55,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:52" (3/4) ... [2024-11-09 10:22:55,291 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 10:22:55,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-09 10:22:55,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-09 10:22:55,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2024-11-09 10:22:55,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 10:22:55,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 10:22:55,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 10:22:55,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 10:22:55,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 10:22:55,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:22:55,368 INFO L158 Benchmark]: Toolchain (without parser) took 3332.29ms. Allocated memory was 155.2MB in the beginning and 266.3MB in the end (delta: 111.1MB). Free memory was 81.5MB in the beginning and 202.8MB in the end (delta: -121.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:55,369 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:55,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.70ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 81.3MB in the beginning and 176.2MB in the end (delta: -94.9MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:55,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.40ms. Allocated memory is still 207.6MB. Free memory was 176.2MB in the beginning and 174.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:55,369 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 207.6MB. Free memory was 174.1MB in the beginning and 172.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:55,369 INFO L158 Benchmark]: RCFGBuilder took 413.16ms. Allocated memory is still 207.6MB. Free memory was 172.0MB in the beginning and 152.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:22:55,369 INFO L158 Benchmark]: TraceAbstraction took 2294.76ms. Allocated memory was 207.6MB in the beginning and 266.3MB in the end (delta: 58.7MB). Free memory was 152.1MB in the beginning and 207.0MB in the end (delta: -54.9MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:55,370 INFO L158 Benchmark]: Witness Printer took 77.97ms. Allocated memory is still 266.3MB. Free memory was 207.0MB in the beginning and 202.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:55,372 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.70ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 81.3MB in the beginning and 176.2MB in the end (delta: -94.9MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.40ms. Allocated memory is still 207.6MB. Free memory was 176.2MB in the beginning and 174.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 207.6MB. Free memory was 174.1MB in the beginning and 172.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.16ms. Allocated memory is still 207.6MB. Free memory was 172.0MB in the beginning and 152.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2294.76ms. Allocated memory was 207.6MB in the beginning and 266.3MB in the end (delta: 58.7MB). Free memory was 152.1MB in the beginning and 207.0MB in the end (delta: -54.9MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Witness Printer took 77.97ms. Allocated memory is still 266.3MB. Free memory was 207.0MB in the beginning and 202.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 786]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 36 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 10:22:55,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE