./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-theta/unwind3-1.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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:32:49,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:32:50,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:32:50,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:32:50,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:32:50,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:32:50,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:32:50,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:32:50,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:32:50,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:32:50,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:32:50,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:32:50,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:32:50,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:32:50,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:32:50,069 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:32:50,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:32:50,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:50,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:32:50,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:32:50,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-03-09 01:32:50,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:32:50,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:32:50,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:32:50,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:32:50,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:32:50,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-03-09 01:32:51,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2d8ec9b/64643e70181845da9b7b2e1ad98fea0a/FLAGf9927e1f3 [2025-03-09 01:32:51,924 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:32:51,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-03-09 01:32:51,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2d8ec9b/64643e70181845da9b7b2e1ad98fea0a/FLAGf9927e1f3 [2025-03-09 01:32:51,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2d8ec9b/64643e70181845da9b7b2e1ad98fea0a [2025-03-09 01:32:51,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:32:51,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:32:51,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:51,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:32:51,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:32:51,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:51" (1/1) ... [2025-03-09 01:32:51,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bb9e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:51, skipping insertion in model container [2025-03-09 01:32:51,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:51" (1/1) ... [2025-03-09 01:32:51,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:32:52,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:52,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:32:52,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:52,313 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:32:52,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52 WrapperNode [2025-03-09 01:32:52,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:52,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:52,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:32:52,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:32:52,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,351 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-03-09 01:32:52,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:52,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:32:52,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:32:52,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:32:52,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,370 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]. [2025-03-09 01:32:52,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:32:52,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:32:52,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:32:52,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:32:52,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (1/1) ... [2025-03-09 01:32:52,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:52,406 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) [2025-03-09 01:32:52,412 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 [2025-03-09 01:32:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:32:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-09 01:32:52,427 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-09 01:32:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-09 01:32:52,428 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-09 01:32:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:32:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:32:52,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:32:52,428 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:32:52,532 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:32:52,533 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:32:52,635 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:32:52,636 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:32:52,704 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:32:52,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:32:52,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:52 BoogieIcfgContainer [2025-03-09 01:32:52,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:32:52,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:32:52,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:32:52,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:32:52,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:32:51" (1/3) ... [2025-03-09 01:32:52,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65420b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:52, skipping insertion in model container [2025-03-09 01:32:52,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:52" (2/3) ... [2025-03-09 01:32:52,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65420b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:52, skipping insertion in model container [2025-03-09 01:32:52,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:52" (3/3) ... [2025-03-09 01:32:52,712 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-03-09 01:32:52,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:32:52,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 01:32:52,727 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:32:52,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:32:52,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-03-09 01:32:52,820 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-03-09 01:32:52,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:52,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-03-09 01:32:52,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-03-09 01:32:52,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-03-09 01:32:52,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:52,853 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;@b39f4bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:52,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 01:32:52,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:52,866 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-09 01:32:52,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:52,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:52,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:52,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:52,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1525933431, now seen corresponding path program 1 times [2025-03-09 01:32:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:52,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004002550] [2025-03-09 01:32:52,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:32:52,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:32:52,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:52,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004002550] [2025-03-09 01:32:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004002550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:53,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872640699] [2025-03-09 01:32:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:53,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:53,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:53,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:32:53,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2025-03-09 01:32:53,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:53,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:32:53,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:53,238 INFO L124 PetriNetUnfolderBase]: 98/222 cut-off events. [2025-03-09 01:32:53,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:53,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 222 events. 98/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 833 event pairs, 32 based on Foata normal form. 24/230 useless extension candidates. Maximal degree in co-relation 394. Up to 172 conditions per place. [2025-03-09 01:32:53,243 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 19 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-09 01:32:53,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 105 flow [2025-03-09 01:32:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-03-09 01:32:53,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-03-09 01:32:53,257 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 49 transitions. [2025-03-09 01:32:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 105 flow [2025-03-09 01:32:53,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:53,263 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2025-03-09 01:32:53,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-03-09 01:32:53,269 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-03-09 01:32:53,269 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2025-03-09 01:32:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2025-03-09 01:32:53,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:53,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:53,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:32:53,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:53,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash -60284697, now seen corresponding path program 1 times [2025-03-09 01:32:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148078114] [2025-03-09 01:32:53,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:32:53,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:32:53,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:53,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:53,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148078114] [2025-03-09 01:32:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148078114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:53,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:32:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486682208] [2025-03-09 01:32:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:53,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:32:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:53,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:32:53,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:32:53,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:32:53,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2025-03-09 01:32:53,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:53,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:32:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:53,472 INFO L124 PetriNetUnfolderBase]: 95/211 cut-off events. [2025-03-09 01:32:53,472 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:32:53,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 211 events. 95/211 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 775 event pairs, 32 based on Foata normal form. 4/203 useless extension candidates. Maximal degree in co-relation 392. Up to 158 conditions per place. [2025-03-09 01:32:53,476 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 20 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-03-09 01:32:53,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 119 flow [2025-03-09 01:32:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:32:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:32:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-09 01:32:53,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-03-09 01:32:53,478 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 5 states and 55 transitions. [2025-03-09 01:32:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 119 flow [2025-03-09 01:32:53,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:32:53,479 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 64 flow [2025-03-09 01:32:53,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2025-03-09 01:32:53,480 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-03-09 01:32:53,480 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 64 flow [2025-03-09 01:32:53,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2025-03-09 01:32:53,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:53,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:53,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:32:53,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:53,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:53,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2098980906, now seen corresponding path program 1 times [2025-03-09 01:32:53,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:53,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087149621] [2025-03-09 01:32:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:53,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:53,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:32:53,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:32:53,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:53,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087149621] [2025-03-09 01:32:53,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087149621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:53,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:53,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622564629] [2025-03-09 01:32:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:53,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:53,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:53,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:53,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:32:53,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-03-09 01:32:53,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:53,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:32:53,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:53,575 INFO L124 PetriNetUnfolderBase]: 95/207 cut-off events. [2025-03-09 01:32:53,575 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 01:32:53,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 207 events. 95/207 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 731 event pairs, 83 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 396. Up to 170 conditions per place. [2025-03-09 01:32:53,576 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 15 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2025-03-09 01:32:53,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 96 flow [2025-03-09 01:32:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-03-09 01:32:53,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-09 01:32:53,578 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 64 flow. Second operand 3 states and 36 transitions. [2025-03-09 01:32:53,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 96 flow [2025-03-09 01:32:53,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 86 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:32:53,578 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 52 flow [2025-03-09 01:32:53,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2025-03-09 01:32:53,579 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2025-03-09 01:32:53,579 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 52 flow [2025-03-09 01:32:53,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-03-09 01:32:53,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:53,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:53,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:32:53,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:53,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -306693463, now seen corresponding path program 1 times [2025-03-09 01:32:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:53,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211087041] [2025-03-09 01:32:53,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:53,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:32:53,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:32:53,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:53,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:53,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:53,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211087041] [2025-03-09 01:32:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211087041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:32:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668356362] [2025-03-09 01:32:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:53,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:32:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:53,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:32:53,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:32:53,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:32:53,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2025-03-09 01:32:53,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:53,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:32:53,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:53,828 INFO L124 PetriNetUnfolderBase]: 146/282 cut-off events. [2025-03-09 01:32:53,828 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:32:53,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 282 events. 146/282 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1009 event pairs, 66 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 556. Up to 141 conditions per place. [2025-03-09 01:32:53,829 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 19 selfloop transitions, 3 changer transitions 13/38 dead transitions. [2025-03-09 01:32:53,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 158 flow [2025-03-09 01:32:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:32:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:32:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-03-09 01:32:53,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-09 01:32:53,831 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 52 flow. Second operand 6 states and 72 transitions. [2025-03-09 01:32:53,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 158 flow [2025-03-09 01:32:53,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:53,832 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 65 flow [2025-03-09 01:32:53,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2025-03-09 01:32:53,832 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-03-09 01:32:53,834 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 65 flow [2025-03-09 01:32:53,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2025-03-09 01:32:53,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:53,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:53,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:32:53,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash -918548657, now seen corresponding path program 1 times [2025-03-09 01:32:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309874002] [2025-03-09 01:32:53,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:32:53,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:32:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:53,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309874002] [2025-03-09 01:32:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309874002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889517891] [2025-03-09 01:32:53,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:53,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:53,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:53,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:53,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:32:53,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:32:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:32:53,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:53,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:53,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:32:53,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:54,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889517891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:54,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:32:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937981371] [2025-03-09 01:32:54,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:32:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:54,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:32:54,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:32:54,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:32:54,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 65 flow. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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) [2025-03-09 01:32:54,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:54,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:32:54,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:54,226 INFO L124 PetriNetUnfolderBase]: 129/253 cut-off events. [2025-03-09 01:32:54,226 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-09 01:32:54,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 253 events. 129/253 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 826 event pairs, 66 based on Foata normal form. 12/241 useless extension candidates. Maximal degree in co-relation 594. Up to 141 conditions per place. [2025-03-09 01:32:54,230 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 24 selfloop transitions, 4 changer transitions 6/37 dead transitions. [2025-03-09 01:32:54,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 171 flow [2025-03-09 01:32:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:32:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:32:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-03-09 01:32:54,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2025-03-09 01:32:54,236 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 65 flow. Second operand 6 states and 71 transitions. [2025-03-09 01:32:54,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 171 flow [2025-03-09 01:32:54,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 163 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:32:54,238 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 77 flow [2025-03-09 01:32:54,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2025-03-09 01:32:54,241 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-03-09 01:32:54,241 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 77 flow [2025-03-09 01:32:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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) [2025-03-09 01:32:54,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:54,242 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:54,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:32:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:54,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1588776809, now seen corresponding path program 2 times [2025-03-09 01:32:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806695888] [2025-03-09 01:32:54,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:32:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:54,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:32:54,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:32:54,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:32:54,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:54,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:54,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806695888] [2025-03-09 01:32:54,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806695888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:54,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990132376] [2025-03-09 01:32:54,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:32:54,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:54,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:54,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:54,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:32:54,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:32:54,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:32:54,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:32:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:54,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:32:54,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:54,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:32:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990132376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:32:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:32:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555088915] [2025-03-09 01:32:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:54,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:32:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:54,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:32:54,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:32:54,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-09 01:32:54,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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) [2025-03-09 01:32:54,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:54,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-09 01:32:54,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:54,711 INFO L124 PetriNetUnfolderBase]: 84/178 cut-off events. [2025-03-09 01:32:54,712 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-09 01:32:54,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 178 events. 84/178 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 533 event pairs, 20 based on Foata normal form. 12/184 useless extension candidates. Maximal degree in co-relation 450. Up to 93 conditions per place. [2025-03-09 01:32:54,714 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 21 selfloop transitions, 2 changer transitions 17/43 dead transitions. [2025-03-09 01:32:54,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 217 flow [2025-03-09 01:32:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:32:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:32:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-03-09 01:32:54,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-09 01:32:54,716 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 77 flow. Second operand 8 states and 96 transitions. [2025-03-09 01:32:54,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 217 flow [2025-03-09 01:32:54,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 201 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-09 01:32:54,717 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 81 flow [2025-03-09 01:32:54,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2025-03-09 01:32:54,718 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2025-03-09 01:32:54,718 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 81 flow [2025-03-09 01:32:54,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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) [2025-03-09 01:32:54,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:54,718 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:54,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:32:54,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:32:54,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:32:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 519945660, now seen corresponding path program 1 times [2025-03-09 01:32:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618559071] [2025-03-09 01:32:54,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:54,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:32:54,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:32:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:54,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:54,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:32:54,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:32:54,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:54,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:54,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:54,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-09 01:32:54,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-09 01:32:54,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-09 01:32:54,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-09 01:32:54,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-09 01:32:54,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:32:54,960 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-03-09 01:32:54,985 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:32:54,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:32:54,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:32:54 BasicIcfg [2025-03-09 01:32:54,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:32:54,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:32:54,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:32:54,990 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:32:54,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:52" (3/4) ... [2025-03-09 01:32:54,991 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:32:54,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:32:54,993 INFO L158 Benchmark]: Toolchain (without parser) took 3035.37ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 93.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2025-03-09 01:32:54,993 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:32:54,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.72ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 84.5MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:32:54,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.02ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:32:54,994 INFO L158 Benchmark]: Boogie Preprocessor took 24.21ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:32:54,994 INFO L158 Benchmark]: IcfgBuilder took 327.38ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 62.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:32:54,994 INFO L158 Benchmark]: TraceAbstraction took 2282.19ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 93.7MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:32:54,994 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:32:54,995 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.72ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 84.5MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.02ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 83.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.21ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.38ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 62.0MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2282.19ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 93.7MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.6MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 43 edges, 5 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: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 3 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, InterpolantAutomatonStates: 32, 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.6s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 319 SizeOfPredicates, 5 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 5/9 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:32:55,008 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-theta/unwind3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:32:56,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:32:56,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 01:32:56,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:32:56,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:32:56,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:32:56,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:32:56,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:32:56,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:32:56,994 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:32:56,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:32:56,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:32:56,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:32:56,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:32:56,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:32:56,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:56,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:32:56,996 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2025-03-09 01:32:57,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:32:57,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:32:57,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:32:57,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:32:57,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:32:57,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-03-09 01:32:58,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464fae242/b879d7948f194b568efc6f43e3cd6ccc/FLAGa27b50244 [2025-03-09 01:32:58,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:32:58,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2025-03-09 01:32:58,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464fae242/b879d7948f194b568efc6f43e3cd6ccc/FLAGa27b50244 [2025-03-09 01:32:59,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464fae242/b879d7948f194b568efc6f43e3cd6ccc [2025-03-09 01:32:59,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:32:59,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:32:59,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:59,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:32:59,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:32:59,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1165c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59, skipping insertion in model container [2025-03-09 01:32:59,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:32:59,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:59,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:32:59,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:59,440 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:32:59,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59 WrapperNode [2025-03-09 01:32:59,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:59,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:59,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:32:59,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:32:59,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,475 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-03-09 01:32:59,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:59,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:32:59,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:32:59,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:32:59,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,498 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]. [2025-03-09 01:32:59,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:32:59,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:32:59,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:32:59,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:32:59,509 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (1/1) ... [2025-03-09 01:32:59,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:59,538 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) [2025-03-09 01:32:59,540 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 [2025-03-09 01:32:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:32:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-09 01:32:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-09 01:32:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-09 01:32:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-09 01:32:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 01:32:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:32:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:32:59,556 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:32:59,642 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:32:59,643 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:32:59,782 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:32:59,782 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:32:59,878 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:32:59,878 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:32:59,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:59 BoogieIcfgContainer [2025-03-09 01:32:59,879 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:32:59,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:32:59,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:32:59,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:32:59,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:32:59" (1/3) ... [2025-03-09 01:32:59,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7b9a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:59, skipping insertion in model container [2025-03-09 01:32:59,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:59" (2/3) ... [2025-03-09 01:32:59,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7b9a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:59, skipping insertion in model container [2025-03-09 01:32:59,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:59" (3/3) ... [2025-03-09 01:32:59,887 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2025-03-09 01:32:59,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:32:59,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-1.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 01:32:59,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:32:59,956 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:32:59,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-03-09 01:33:00,004 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-03-09 01:33:00,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:33:00,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 93 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-03-09 01:33:00,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-03-09 01:33:00,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-03-09 01:33:00,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:33:00,025 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;@34494880, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:33:00,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 01:33:00,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:33:00,033 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-09 01:33:00,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:33:00,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:33:00,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:33:00,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:33:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:33:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash 308240843, now seen corresponding path program 1 times [2025-03-09 01:33:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:33:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236738228] [2025-03-09 01:33:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:33:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:00,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:33:00,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:33:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:33:00,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:33:00,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:33:00,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:00,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:33:00,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:33:00,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:33:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:33:00,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:33:00,159 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:33:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236738228] [2025-03-09 01:33:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236738228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:33:00,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:33:00,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:33:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422955824] [2025-03-09 01:33:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:33:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:33:00,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:33:00,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:33:00,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:33:00,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:33:00,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-09 01:33:00,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:33:00,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:33:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:33:00,247 INFO L124 PetriNetUnfolderBase]: 109/249 cut-off events. [2025-03-09 01:33:00,247 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:33:00,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 249 events. 109/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 987 event pairs, 94 based on Foata normal form. 30/256 useless extension candidates. Maximal degree in co-relation 387. Up to 204 conditions per place. [2025-03-09 01:33:00,252 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 15 selfloop transitions, 1 changer transitions 1/22 dead transitions. [2025-03-09 01:33:00,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 85 flow [2025-03-09 01:33:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:33:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:33:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-03-09 01:33:00,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-03-09 01:33:00,263 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 3 states and 38 transitions. [2025-03-09 01:33:00,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 85 flow [2025-03-09 01:33:00,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:33:00,270 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2025-03-09 01:33:00,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2025-03-09 01:33:00,275 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2025-03-09 01:33:00,275 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2025-03-09 01:33:00,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-09 01:33:00,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:33:00,275 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:33:00,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:33:00,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:00,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:33:00,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:33:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 964542951, now seen corresponding path program 1 times [2025-03-09 01:33:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:33:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917869770] [2025-03-09 01:33:00,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:33:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:33:00,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:33:00,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:33:00,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:33:00,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:33:00,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:00,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:33:00,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:33:00,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:33:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:33:00,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:33:00,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:33:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917869770] [2025-03-09 01:33:00,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917869770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:33:00,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:33:00,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:33:00,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171423195] [2025-03-09 01:33:00,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:33:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:33:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:33:00,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:33:00,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:33:00,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-09 01:33:00,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2025-03-09 01:33:00,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:33:00,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-09 01:33:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:33:00,669 INFO L124 PetriNetUnfolderBase]: 78/178 cut-off events. [2025-03-09 01:33:00,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:33:00,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 178 events. 78/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 609 event pairs, 24 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 328. Up to 129 conditions per place. [2025-03-09 01:33:00,670 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 19 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-03-09 01:33:00,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 105 flow [2025-03-09 01:33:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:33:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:33:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2025-03-09 01:33:00,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-03-09 01:33:00,671 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 5 states and 55 transitions. [2025-03-09 01:33:00,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 105 flow [2025-03-09 01:33:00,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 103 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:33:00,675 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 57 flow [2025-03-09 01:33:00,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=57, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2025-03-09 01:33:00,676 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2025-03-09 01:33:00,676 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 57 flow [2025-03-09 01:33:00,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2025-03-09 01:33:00,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:33:00,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:33:00,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:33:00,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:00,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:33:00,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:33:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1377589547, now seen corresponding path program 1 times [2025-03-09 01:33:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:33:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246677776] [2025-03-09 01:33:00,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:33:00,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:33:00,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:33:00,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:33:00,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:33:00,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:33:00,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:00,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:33:00,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:33:00,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:33:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:33:00,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:33:00,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:33:00,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246677776] [2025-03-09 01:33:00,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246677776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:33:00,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:33:00,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:33:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658258354] [2025-03-09 01:33:00,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:33:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:33:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:33:00,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:33:00,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:33:00,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-09 01:33:00,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2025-03-09 01:33:00,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:33:00,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-09 01:33:00,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:33:01,114 INFO L124 PetriNetUnfolderBase]: 95/207 cut-off events. [2025-03-09 01:33:01,114 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:33:01,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 207 events. 95/207 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 745 event pairs, 35 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 399. Up to 83 conditions per place. [2025-03-09 01:33:01,116 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-03-09 01:33:01,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 169 flow [2025-03-09 01:33:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:33:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:33:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-03-09 01:33:01,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-09 01:33:01,119 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 57 flow. Second operand 6 states and 78 transitions. [2025-03-09 01:33:01,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 169 flow [2025-03-09 01:33:01,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:33:01,120 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 92 flow [2025-03-09 01:33:01,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2025-03-09 01:33:01,121 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-03-09 01:33:01,121 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 92 flow [2025-03-09 01:33:01,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2025-03-09 01:33:01,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:33:01,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:33:01,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:33:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:01,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:33:01,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:33:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -245382897, now seen corresponding path program 1 times [2025-03-09 01:33:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:33:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604642895] [2025-03-09 01:33:01,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:33:01,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:01,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:33:01,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:33:01,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:33:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:33:01,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:33:01,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:01,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:33:01,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:33:01,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:33:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:33:01,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:33:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:33:01,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:33:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604642895] [2025-03-09 01:33:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604642895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:33:01,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:33:01,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2025-03-09 01:33:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531779686] [2025-03-09 01:33:01,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:33:01,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:33:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:33:01,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:33:01,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:33:01,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-09 01:33:01,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 92 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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) [2025-03-09 01:33:01,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:33:01,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-09 01:33:01,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:33:01,935 INFO L124 PetriNetUnfolderBase]: 153/301 cut-off events. [2025-03-09 01:33:01,935 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-09 01:33:01,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 301 events. 153/301 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1100 event pairs, 9 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 782. Up to 68 conditions per place. [2025-03-09 01:33:01,939 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 23 selfloop transitions, 11 changer transitions 42/78 dead transitions. [2025-03-09 01:33:01,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 394 flow [2025-03-09 01:33:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:33:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:33:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2025-03-09 01:33:01,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3638344226579521 [2025-03-09 01:33:01,942 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 92 flow. Second operand 17 states and 167 transitions. [2025-03-09 01:33:01,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 394 flow [2025-03-09 01:33:01,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 381 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:33:01,944 INFO L231 Difference]: Finished difference. Result has 58 places, 25 transitions, 145 flow [2025-03-09 01:33:01,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=25} [2025-03-09 01:33:01,945 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2025-03-09 01:33:01,945 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 25 transitions, 145 flow [2025-03-09 01:33:01,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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) [2025-03-09 01:33:01,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:33:01,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:33:01,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:33:02,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:02,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:33:02,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:33:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1598798782, now seen corresponding path program 1 times [2025-03-09 01:33:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:33:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101875010] [2025-03-09 01:33:02,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:33:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:33:02,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:33:02,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:33:02,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:33:02,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:33:02,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:02,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:33:02,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:33:02,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:33:02,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:33:02,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:33:02,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:33:02,232 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 01:33:02,234 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:33:02,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-09 01:33:02,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-09 01:33:02,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-09 01:33:02,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-09 01:33:02,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-03-09 01:33:02,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:33:02,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:33:02,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-09 01:33:02,456 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:33:02,456 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:33:02,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:33:02 BasicIcfg [2025-03-09 01:33:02,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:33:02,460 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:33:02,460 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:33:02,460 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:33:02,461 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:59" (3/4) ... [2025-03-09 01:33:02,462 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:33:02,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:33:02,463 INFO L158 Benchmark]: Toolchain (without parser) took 3409.43ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 51.5MB in the end (delta: 39.7MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2025-03-09 01:33:02,463 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:33:02,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.95ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 70.5MB in the end (delta: 20.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:33:02,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.84ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:33:02,464 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 67.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:33:02,464 INFO L158 Benchmark]: IcfgBuilder took 370.54ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 41.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:33:02,464 INFO L158 Benchmark]: TraceAbstraction took 2579.56ms. Allocated memory is still 117.4MB. Free memory was 41.0MB in the beginning and 51.5MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:33:02,464 INFO L158 Benchmark]: Witness Printer took 2.13ms. Allocated memory is still 117.4MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:33:02,465 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.93ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.95ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 70.5MB in the end (delta: 20.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.84ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 67.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 370.54ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 41.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2579.56ms. Allocated memory is still 117.4MB. Free memory was 41.0MB in the beginning and 51.5MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.13ms. Allocated memory is still 117.4MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 43 edges, 5 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.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 31, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 7 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 0/2 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:33:02,476 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: UNKNOWN: Overapproximated counterexample