./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix031.opt.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-wmm/mix031.opt.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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:02:32,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:02:32,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:02:32,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:02:32,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:02:32,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:02:32,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:02:32,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:02:32,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:02:32,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:02:32,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:02:32,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:02:32,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:02:32,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:02:32,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:02:32,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:02:32,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:02:32,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:02:32,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:02:32,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:02:32,143 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2025-03-09 01:02:32,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:02:32,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:02:32,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:02:32,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:02:32,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:02:32,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2025-03-09 01:02:33,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bdd629a/4f2eff866d91492988598ddd3d04401c/FLAGb49dcf95a [2025-03-09 01:02:33,927 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:02:33,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2025-03-09 01:02:33,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bdd629a/4f2eff866d91492988598ddd3d04401c/FLAGb49dcf95a [2025-03-09 01:02:33,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bdd629a/4f2eff866d91492988598ddd3d04401c [2025-03-09 01:02:33,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:02:33,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:02:33,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:02:33,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:02:33,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:02:33,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:02:33" (1/1) ... [2025-03-09 01:02:33,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4f9a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:33, skipping insertion in model container [2025-03-09 01:02:33,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:02:33" (1/1) ... [2025-03-09 01:02:34,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:02:34,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:02:34,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:02:34,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:02:34,384 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:02:34,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34 WrapperNode [2025-03-09 01:02:34,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:02:34,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:02:34,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:02:34,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:02:34,391 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:02:34" (1/1) ... [2025-03-09 01:02:34,406 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:02:34" (1/1) ... [2025-03-09 01:02:34,427 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2025-03-09 01:02:34,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:02:34,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:02:34,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:02:34,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:02:34,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,463 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:02:34,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:02:34,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:02:34,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:02:34,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:02:34,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (1/1) ... [2025-03-09 01:02:34,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:02:34,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:34,513 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:02:34,518 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:02:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:02:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:02:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:02:34,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:02:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:02:34,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:02:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:02:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:02:34,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:02:34,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:02:34,536 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:02:34,636 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:02:34,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:02:34,889 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:02:34,889 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:02:35,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:02:35,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:02:35,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:02:35 BoogieIcfgContainer [2025-03-09 01:02:35,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:02:35,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:02:35,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:02:35,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:02:35,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:02:33" (1/3) ... [2025-03-09 01:02:35,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7e6d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:02:35, skipping insertion in model container [2025-03-09 01:02:35,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:34" (2/3) ... [2025-03-09 01:02:35,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7e6d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:02:35, skipping insertion in model container [2025-03-09 01:02:35,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:02:35" (3/3) ... [2025-03-09 01:02:35,097 INFO L128 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2025-03-09 01:02:35,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:02:35,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix031.opt.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 01:02:35,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:02:35,156 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:02:35,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 86 flow [2025-03-09 01:02:35,214 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-03-09 01:02:35,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:02:35,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-09 01:02:35,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 86 flow [2025-03-09 01:02:35,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 37 transitions, 80 flow [2025-03-09 01:02:35,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:02:35,250 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;@547ca079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:02:35,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:02:35,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:02:35,254 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 01:02:35,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:02:35,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:35,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:02:35,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:35,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1593393513, now seen corresponding path program 1 times [2025-03-09 01:02:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929484803] [2025-03-09 01:02:35,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:35,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:35,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:02:35,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:02:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:35,658 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:02:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929484803] [2025-03-09 01:02:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929484803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:02:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041821601] [2025-03-09 01:02:35,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:35,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:02:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:35,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:02:35,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:02:35,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:35,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:02:35,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:35,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:35,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:36,070 INFO L124 PetriNetUnfolderBase]: 1071/1763 cut-off events. [2025-03-09 01:02:36,070 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:02:36,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1763 events. 1071/1763 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8626 event pairs, 77 based on Foata normal form. 128/1888 useless extension candidates. Maximal degree in co-relation 3503. Up to 1555 conditions per place. [2025-03-09 01:02:36,090 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2025-03-09 01:02:36,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 190 flow [2025-03-09 01:02:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:02:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:02:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:02:36,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-03-09 01:02:36,103 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 80 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:02:36,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 190 flow [2025-03-09 01:02:36,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:02:36,127 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2025-03-09 01:02:36,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-09 01:02:36,132 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-03-09 01:02:36,134 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2025-03-09 01:02:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:02:36,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:36,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:02:36,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -657755381, now seen corresponding path program 1 times [2025-03-09 01:02:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068799263] [2025-03-09 01:02:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:36,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:02:36,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:02:36,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:36,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:36,204 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:02:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:36,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068799263] [2025-03-09 01:02:36,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068799263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:36,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:36,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:02:36,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100589980] [2025-03-09 01:02:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:36,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:02:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:36,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:02:36,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:02:36,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:36,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:02:36,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:36,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:36,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:36,401 INFO L124 PetriNetUnfolderBase]: 959/1691 cut-off events. [2025-03-09 01:02:36,401 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:02:36,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 1691 events. 959/1691 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8818 event pairs, 959 based on Foata normal form. 64/1744 useless extension candidates. Maximal degree in co-relation 3327. Up to 1552 conditions per place. [2025-03-09 01:02:36,412 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 24 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-03-09 01:02:36,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 122 flow [2025-03-09 01:02:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:02:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:02:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-09 01:02:36,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2025-03-09 01:02:36,413 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 48 transitions. [2025-03-09 01:02:36,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 122 flow [2025-03-09 01:02:36,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:02:36,415 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 66 flow [2025-03-09 01:02:36,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-03-09 01:02:36,415 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-03-09 01:02:36,415 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 66 flow [2025-03-09 01:02:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:02:36,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:36,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:36,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:02:36,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:36,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -657754840, now seen corresponding path program 1 times [2025-03-09 01:02:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000213] [2025-03-09 01:02:36,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:36,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:02:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:02:36,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:36,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:36,692 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:02:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000213] [2025-03-09 01:02:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:36,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:36,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:02:36,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787309667] [2025-03-09 01:02:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:36,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:02:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:36,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:02:36,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:02:36,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:36,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:02:36,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:36,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:36,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:37,131 INFO L124 PetriNetUnfolderBase]: 1168/2030 cut-off events. [2025-03-09 01:02:37,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:02:37,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 2030 events. 1168/2030 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10708 event pairs, 423 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 3963. Up to 1188 conditions per place. [2025-03-09 01:02:37,145 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 34 selfloop transitions, 3 changer transitions 60/101 dead transitions. [2025-03-09 01:02:37,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 101 transitions, 404 flow [2025-03-09 01:02:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:02:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:02:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-03-09 01:02:37,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967948717948718 [2025-03-09 01:02:37,149 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 66 flow. Second operand 8 states and 155 transitions. [2025-03-09 01:02:37,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 101 transitions, 404 flow [2025-03-09 01:02:37,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 101 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:02:37,153 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 98 flow [2025-03-09 01:02:37,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2025-03-09 01:02:37,155 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-03-09 01:02:37,155 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 98 flow [2025-03-09 01:02:37,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:02:37,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:37,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:02:37,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1454081988, now seen corresponding path program 1 times [2025-03-09 01:02:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263171381] [2025-03-09 01:02:37,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:37,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:02:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:02:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:37,348 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:02:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263171381] [2025-03-09 01:02:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263171381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:02:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884450459] [2025-03-09 01:02:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:02:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:37,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:02:37,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:02:37,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:37,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:02:37,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:37,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:37,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:37,704 INFO L124 PetriNetUnfolderBase]: 821/1441 cut-off events. [2025-03-09 01:02:37,705 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2025-03-09 01:02:37,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 1441 events. 821/1441 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6870 event pairs, 272 based on Foata normal form. 40/1478 useless extension candidates. Maximal degree in co-relation 3399. Up to 857 conditions per place. [2025-03-09 01:02:37,713 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 34 selfloop transitions, 3 changer transitions 33/74 dead transitions. [2025-03-09 01:02:37,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 346 flow [2025-03-09 01:02:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:02:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:02:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2025-03-09 01:02:37,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2025-03-09 01:02:37,715 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 98 flow. Second operand 7 states and 120 transitions. [2025-03-09 01:02:37,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 346 flow [2025-03-09 01:02:37,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 329 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-09 01:02:37,724 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 108 flow [2025-03-09 01:02:37,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2025-03-09 01:02:37,726 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-03-09 01:02:37,726 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 108 flow [2025-03-09 01:02:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:02:37,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:37,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:37,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:02:37,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:37,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1274787049, now seen corresponding path program 1 times [2025-03-09 01:02:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:37,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903419880] [2025-03-09 01:02:37,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:02:37,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:02:37,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:37,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:37,914 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:02:37,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903419880] [2025-03-09 01:02:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903419880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:37,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:37,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:02:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828032841] [2025-03-09 01:02:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:37,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:02:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:37,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:02:37,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:02:37,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:37,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:02:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:38,207 INFO L124 PetriNetUnfolderBase]: 740/1285 cut-off events. [2025-03-09 01:02:38,207 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2025-03-09 01:02:38,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 1285 events. 740/1285 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5826 event pairs, 386 based on Foata normal form. 40/1322 useless extension candidates. Maximal degree in co-relation 3150. Up to 751 conditions per place. [2025-03-09 01:02:38,215 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 36 selfloop transitions, 3 changer transitions 33/76 dead transitions. [2025-03-09 01:02:38,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 372 flow [2025-03-09 01:02:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:02:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:02:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-03-09 01:02:38,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4468864468864469 [2025-03-09 01:02:38,217 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 108 flow. Second operand 7 states and 122 transitions. [2025-03-09 01:02:38,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 372 flow [2025-03-09 01:02:38,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 342 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-09 01:02:38,223 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 109 flow [2025-03-09 01:02:38,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2025-03-09 01:02:38,223 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-03-09 01:02:38,224 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 109 flow [2025-03-09 01:02:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:02:38,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:38,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:38,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:02:38,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:38,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 144567991, now seen corresponding path program 1 times [2025-03-09 01:02:38,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:38,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219426603] [2025-03-09 01:02:38,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:38,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:38,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:02:38,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:02:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:38,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:38,390 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:02:38,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:38,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219426603] [2025-03-09 01:02:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219426603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:02:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748019779] [2025-03-09 01:02:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:02:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:38,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:02:38,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:02:38,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:38,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:02:38,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:38,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:38,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:38,544 INFO L124 PetriNetUnfolderBase]: 445/821 cut-off events. [2025-03-09 01:02:38,544 INFO L125 PetriNetUnfolderBase]: For 301/301 co-relation queries the response was YES. [2025-03-09 01:02:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 821 events. 445/821 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3471 event pairs, 152 based on Foata normal form. 64/882 useless extension candidates. Maximal degree in co-relation 1944. Up to 319 conditions per place. [2025-03-09 01:02:38,550 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 52 selfloop transitions, 4 changer transitions 1/61 dead transitions. [2025-03-09 01:02:38,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 305 flow [2025-03-09 01:02:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:02:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:02:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-09 01:02:38,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2025-03-09 01:02:38,551 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 109 flow. Second operand 4 states and 89 transitions. [2025-03-09 01:02:38,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 305 flow [2025-03-09 01:02:38,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 277 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-09 01:02:38,553 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 115 flow [2025-03-09 01:02:38,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-03-09 01:02:38,554 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2025-03-09 01:02:38,554 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 115 flow [2025-03-09 01:02:38,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:02:38,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:38,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:38,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:02:38,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:38,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1140991458, now seen corresponding path program 1 times [2025-03-09 01:02:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:38,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100514955] [2025-03-09 01:02:38,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:38,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:02:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:02:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:38,748 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:02:38,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100514955] [2025-03-09 01:02:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100514955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:38,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:38,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:02:38,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769953518] [2025-03-09 01:02:38,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:38,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:02:38,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:38,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:02:38,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:02:38,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:38,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:02:38,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:38,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:38,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:38,867 INFO L124 PetriNetUnfolderBase]: 235/443 cut-off events. [2025-03-09 01:02:38,867 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-03-09 01:02:38,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 443 events. 235/443 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1533 event pairs, 101 based on Foata normal form. 28/468 useless extension candidates. Maximal degree in co-relation 1107. Up to 180 conditions per place. [2025-03-09 01:02:38,870 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 41 selfloop transitions, 6 changer transitions 1/52 dead transitions. [2025-03-09 01:02:38,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 260 flow [2025-03-09 01:02:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:02:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:02:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-09 01:02:38,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2025-03-09 01:02:38,871 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 115 flow. Second operand 5 states and 88 transitions. [2025-03-09 01:02:38,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 260 flow [2025-03-09 01:02:38,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 237 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 01:02:38,872 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 119 flow [2025-03-09 01:02:38,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-03-09 01:02:38,873 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-09 01:02:38,873 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 119 flow [2025-03-09 01:02:38,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:02:38,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:38,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:38,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:02:38,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 408368500, now seen corresponding path program 1 times [2025-03-09 01:02:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101391093] [2025-03-09 01:02:38,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:38,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:38,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:38,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:39,115 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:02:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101391093] [2025-03-09 01:02:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101391093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:02:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17615871] [2025-03-09 01:02:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:02:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:39,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:02:39,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:02:39,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:39,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:02:39,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:39,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:39,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:39,307 INFO L124 PetriNetUnfolderBase]: 281/536 cut-off events. [2025-03-09 01:02:39,307 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-09 01:02:39,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 536 events. 281/536 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2021 event pairs, 49 based on Foata normal form. 4/539 useless extension candidates. Maximal degree in co-relation 1328. Up to 328 conditions per place. [2025-03-09 01:02:39,309 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 30 selfloop transitions, 1 changer transitions 29/64 dead transitions. [2025-03-09 01:02:39,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 347 flow [2025-03-09 01:02:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:02:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:02:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-03-09 01:02:39,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41452991452991456 [2025-03-09 01:02:39,310 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 119 flow. Second operand 6 states and 97 transitions. [2025-03-09 01:02:39,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 347 flow [2025-03-09 01:02:39,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 290 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-09 01:02:39,312 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 94 flow [2025-03-09 01:02:39,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2025-03-09 01:02:39,315 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2025-03-09 01:02:39,315 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 94 flow [2025-03-09 01:02:39,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:02:39,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:39,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:39,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:02:39,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:39,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1436806726, now seen corresponding path program 2 times [2025-03-09 01:02:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617709568] [2025-03-09 01:02:39,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:02:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:39,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:39,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:39,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:02:39,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:39,806 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:02:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:02:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617709568] [2025-03-09 01:02:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617709568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:39,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:02:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114415064] [2025-03-09 01:02:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:39,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:02:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:02:39,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:02:39,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:02:39,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:39,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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:02:39,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:39,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:39,996 INFO L124 PetriNetUnfolderBase]: 172/356 cut-off events. [2025-03-09 01:02:39,997 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:02:39,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 356 events. 172/356 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1159 event pairs, 68 based on Foata normal form. 4/357 useless extension candidates. Maximal degree in co-relation 803. Up to 146 conditions per place. [2025-03-09 01:02:39,999 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 26 selfloop transitions, 2 changer transitions 29/61 dead transitions. [2025-03-09 01:02:39,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 291 flow [2025-03-09 01:02:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:02:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:02:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-09 01:02:40,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3525641025641026 [2025-03-09 01:02:40,000 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 94 flow. Second operand 8 states and 110 transitions. [2025-03-09 01:02:40,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 291 flow [2025-03-09 01:02:40,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 276 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-09 01:02:40,002 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 101 flow [2025-03-09 01:02:40,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=101, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2025-03-09 01:02:40,004 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2025-03-09 01:02:40,004 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 101 flow [2025-03-09 01:02:40,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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:02:40,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:40,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:02:40,006 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:40,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash -218436526, now seen corresponding path program 3 times [2025-03-09 01:02:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:02:40,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680559320] [2025-03-09 01:02:40,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:02:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:02:40,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:40,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:40,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:02:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:02:40,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:02:40,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:40,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:40,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:40,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:02:40,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:02:40,123 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:02:40,124 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-09 01:02:40,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-09 01:02:40,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-09 01:02:40,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-09 01:02:40,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-09 01:02:40,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-09 01:02:40,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:02:40,127 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:40,187 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:02:40,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:02:40,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:02:40 BasicIcfg [2025-03-09 01:02:40,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:02:40,191 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:02:40,191 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:02:40,191 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:02:40,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:02:35" (3/4) ... [2025-03-09 01:02:40,193 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:02:40,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:02:40,194 INFO L158 Benchmark]: Toolchain (without parser) took 6227.47ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 108.6MB in the beginning and 210.5MB in the end (delta: -101.9MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2025-03-09 01:02:40,194 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:40,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.20ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 86.4MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:02:40,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.41ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:40,194 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:40,194 INFO L158 Benchmark]: IcfgBuilder took 614.27ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 101.6MB in the end (delta: -20.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2025-03-09 01:02:40,194 INFO L158 Benchmark]: TraceAbstraction took 5101.09ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 101.0MB in the beginning and 210.6MB in the end (delta: -109.6MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2025-03-09 01:02:40,195 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 318.8MB. Free memory was 210.6MB in the beginning and 210.5MB in the end (delta: 63.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:02:40,195 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.20ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 86.4MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.41ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 614.27ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 101.6MB in the end (delta: -20.8MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5101.09ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 101.0MB in the beginning and 210.6MB in the end (delta: -109.6MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 318.8MB. Free memory was 210.6MB in the beginning and 210.5MB in the end (delta: 63.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835=0, t836=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=0, t836=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=0, t836=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=0, t836=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix031.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 826]: 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, 59 locations, 58 edges, 6 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: 4.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=7, InterpolantAutomatonStates: 51, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:02:40,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-wmm/mix031.opt.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 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:02:42,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:02:42,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 01:02:42,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:02:42,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:02:42,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:02:42,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:02:42,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:02:42,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:02:42,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:02:42,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:02:42,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:02:42,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:02:42,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:02:42,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:02:42,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:02:42,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:02:42,347 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2025-03-09 01:02:42,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:02:42,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:02:42,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:02:42,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:02:42,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:02:42,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2025-03-09 01:02:43,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53baf4b7e/e49afa9590ae4fa3b58bb36b58bf476c/FLAGebe202d90 [2025-03-09 01:02:44,139 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:02:44,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2025-03-09 01:02:44,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53baf4b7e/e49afa9590ae4fa3b58bb36b58bf476c/FLAGebe202d90 [2025-03-09 01:02:44,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53baf4b7e/e49afa9590ae4fa3b58bb36b58bf476c [2025-03-09 01:02:44,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:02:44,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:02:44,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:02:44,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:02:44,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:02:44,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef535b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44, skipping insertion in model container [2025-03-09 01:02:44,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:02:44,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:02:44,511 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:02:44,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:02:44,593 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:02:44,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44 WrapperNode [2025-03-09 01:02:44,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:02:44,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:02:44,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:02:44,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:02:44,600 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:02:44" (1/1) ... [2025-03-09 01:02:44,615 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:02:44" (1/1) ... [2025-03-09 01:02:44,638 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2025-03-09 01:02:44,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:02:44,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:02:44,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:02:44,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:02:44,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,666 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:02:44,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:02:44,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:02:44,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:02:44,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:02:44,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (1/1) ... [2025-03-09 01:02:44,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:02:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:44,718 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:02:44,720 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:02:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 01:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:02:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:02:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:02:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:02:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:02:44,742 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:02:44,863 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:02:44,864 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:02:45,156 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:02:45,156 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:02:45,386 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:02:45,386 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:02:45,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:02:45 BoogieIcfgContainer [2025-03-09 01:02:45,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:02:45,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:02:45,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:02:45,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:02:45,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:02:44" (1/3) ... [2025-03-09 01:02:45,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d036edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:02:45, skipping insertion in model container [2025-03-09 01:02:45,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:02:44" (2/3) ... [2025-03-09 01:02:45,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d036edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:02:45, skipping insertion in model container [2025-03-09 01:02:45,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:02:45" (3/3) ... [2025-03-09 01:02:45,393 INFO L128 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2025-03-09 01:02:45,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:02:45,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix031.opt.i that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 01:02:45,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:02:45,450 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:02:45,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 86 flow [2025-03-09 01:02:45,527 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-03-09 01:02:45,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:02:45,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 2/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-09 01:02:45,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 86 flow [2025-03-09 01:02:45,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 37 transitions, 80 flow [2025-03-09 01:02:45,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:02:45,552 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;@2d2610b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:02:45,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:02:45,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:02:45,561 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 01:02:45,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:02:45,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:45,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:02:45,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:45,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1652560425, now seen corresponding path program 1 times [2025-03-09 01:02:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518391434] [2025-03-09 01:02:45,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:45,581 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:02:45,583 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:02:45,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:02:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:02:45,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:45,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:45,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:02:45,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:45,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:02:45,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:45,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518391434] [2025-03-09 01:02:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518391434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:02:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893841376] [2025-03-09 01:02:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:45,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:02:45,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:45,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:02:45,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:02:45,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:45,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:02:45,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:45,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:45,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:46,100 INFO L124 PetriNetUnfolderBase]: 1071/1763 cut-off events. [2025-03-09 01:02:46,100 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:02:46,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1763 events. 1071/1763 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8626 event pairs, 77 based on Foata normal form. 128/1888 useless extension candidates. Maximal degree in co-relation 3503. Up to 1555 conditions per place. [2025-03-09 01:02:46,118 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2025-03-09 01:02:46,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 190 flow [2025-03-09 01:02:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:02:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:02:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:02:46,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-03-09 01:02:46,130 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 80 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:02:46,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 190 flow [2025-03-09 01:02:46,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:02:46,136 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2025-03-09 01:02:46,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-09 01:02:46,141 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-03-09 01:02:46,141 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2025-03-09 01:02:46,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:02:46,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:46,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:46,149 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:02:46,346 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:02:46,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:46,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:46,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1026527629, now seen corresponding path program 1 times [2025-03-09 01:02:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015318516] [2025-03-09 01:02:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:46,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:46,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:46,350 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:02:46,351 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:02:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:02:46,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:02:46,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:46,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:46,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:02:46,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:46,447 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:02:46,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:46,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015318516] [2025-03-09 01:02:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015318516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:02:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270006096] [2025-03-09 01:02:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:02:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:46,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:02:46,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:02:46,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-09 01:02:46,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:02:46,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:46,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-09 01:02:46,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:46,646 INFO L124 PetriNetUnfolderBase]: 959/1691 cut-off events. [2025-03-09 01:02:46,647 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:02:46,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 1691 events. 959/1691 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8760 event pairs, 959 based on Foata normal form. 64/1744 useless extension candidates. Maximal degree in co-relation 3327. Up to 1552 conditions per place. [2025-03-09 01:02:46,654 INFO L140 encePairwiseOnDemand]: 37/39 looper letters, 24 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-03-09 01:02:46,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 122 flow [2025-03-09 01:02:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:02:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:02:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-09 01:02:46,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2025-03-09 01:02:46,655 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 3 states and 48 transitions. [2025-03-09 01:02:46,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 122 flow [2025-03-09 01:02:46,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:02:46,658 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 66 flow [2025-03-09 01:02:46,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-03-09 01:02:46,659 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2025-03-09 01:02:46,659 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 66 flow [2025-03-09 01:02:46,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:02:46,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:46,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:46,666 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:02:46,859 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:02:46,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1026528170, now seen corresponding path program 1 times [2025-03-09 01:02:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645276407] [2025-03-09 01:02:46,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:46,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:46,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:46,863 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:02:46,864 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:02:46,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:02:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:02:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:02:46,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:46,975 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:02:46,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:46,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645276407] [2025-03-09 01:02:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645276407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:02:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114978551] [2025-03-09 01:02:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:02:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:02:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:02:46,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:46,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:02:46,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:46,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:46,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:47,136 INFO L124 PetriNetUnfolderBase]: 499/963 cut-off events. [2025-03-09 01:02:47,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:02:47,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 963 events. 499/963 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4534 event pairs, 161 based on Foata normal form. 64/1024 useless extension candidates. Maximal degree in co-relation 1855. Up to 409 conditions per place. [2025-03-09 01:02:47,140 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 50 selfloop transitions, 4 changer transitions 1/60 dead transitions. [2025-03-09 01:02:47,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 238 flow [2025-03-09 01:02:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:02:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:02:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-09 01:02:47,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2025-03-09 01:02:47,142 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 66 flow. Second operand 4 states and 89 transitions. [2025-03-09 01:02:47,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 238 flow [2025-03-09 01:02:47,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:02:47,143 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 91 flow [2025-03-09 01:02:47,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2025-03-09 01:02:47,144 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2025-03-09 01:02:47,144 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 91 flow [2025-03-09 01:02:47,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:02:47,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:47,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:47,151 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:02:47,349 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:02:47,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1205047891, now seen corresponding path program 1 times [2025-03-09 01:02:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521382135] [2025-03-09 01:02:47,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:47,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:47,353 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:02:47,363 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:02:47,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:02:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:02:47,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:47,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:47,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:02:47,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:47,467 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:02:47,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:47,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521382135] [2025-03-09 01:02:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521382135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:47,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:02:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919122588] [2025-03-09 01:02:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:47,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:02:47,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:47,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:02:47,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:02:47,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:47,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:02:47,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:47,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:47,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:47,608 INFO L124 PetriNetUnfolderBase]: 235/447 cut-off events. [2025-03-09 01:02:47,608 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-09 01:02:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 447 events. 235/447 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1564 event pairs, 107 based on Foata normal form. 28/472 useless extension candidates. Maximal degree in co-relation 1023. Up to 180 conditions per place. [2025-03-09 01:02:47,612 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 39 selfloop transitions, 6 changer transitions 1/51 dead transitions. [2025-03-09 01:02:47,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 226 flow [2025-03-09 01:02:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:02:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:02:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-09 01:02:47,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2025-03-09 01:02:47,614 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 91 flow. Second operand 5 states and 88 transitions. [2025-03-09 01:02:47,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 226 flow [2025-03-09 01:02:47,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 217 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:02:47,615 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 107 flow [2025-03-09 01:02:47,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2025-03-09 01:02:47,616 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2025-03-09 01:02:47,616 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 107 flow [2025-03-09 01:02:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:02:47,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:47,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:47,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:02:47,822 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:02:47,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2109372982, now seen corresponding path program 1 times [2025-03-09 01:02:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008142865] [2025-03-09 01:02:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:02:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:47,826 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:02:47,828 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:02:47,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:47,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:47,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:47,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:47,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:02:47,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:48,091 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:02:48,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:48,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:48,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008142865] [2025-03-09 01:02:48,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008142865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:48,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:48,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:02:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474137533] [2025-03-09 01:02:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:48,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:02:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:48,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:02:48,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:02:48,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:48,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 107 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:02:48,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:48,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:48,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:48,441 INFO L124 PetriNetUnfolderBase]: 281/544 cut-off events. [2025-03-09 01:02:48,446 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-09 01:02:48,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 544 events. 281/544 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2102 event pairs, 37 based on Foata normal form. 4/547 useless extension candidates. Maximal degree in co-relation 1294. Up to 189 conditions per place. [2025-03-09 01:02:48,449 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 43 selfloop transitions, 5 changer transitions 30/83 dead transitions. [2025-03-09 01:02:48,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 409 flow [2025-03-09 01:02:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:02:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:02:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2025-03-09 01:02:48,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4301994301994302 [2025-03-09 01:02:48,451 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 107 flow. Second operand 9 states and 151 transitions. [2025-03-09 01:02:48,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 409 flow [2025-03-09 01:02:48,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 352 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-09 01:02:48,455 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 113 flow [2025-03-09 01:02:48,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=113, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-09 01:02:48,455 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2025-03-09 01:02:48,455 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 113 flow [2025-03-09 01:02:48,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:02:48,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:48,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:48,466 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:02:48,656 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:02:48,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:48,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1904941578, now seen corresponding path program 2 times [2025-03-09 01:02:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152785867] [2025-03-09 01:02:48,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:02:48,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:48,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:48,660 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:48,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:02:48,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:48,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:48,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:02:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:48,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:02:48,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:48,956 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:02:48,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:48,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:48,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152785867] [2025-03-09 01:02:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152785867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:48,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:48,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:02:48,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51850572] [2025-03-09 01:02:48,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:02:48,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:48,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:02:48,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:02:48,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:48,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:02:48,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:48,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:48,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:49,254 INFO L124 PetriNetUnfolderBase]: 231/463 cut-off events. [2025-03-09 01:02:49,255 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-09 01:02:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 463 events. 231/463 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1655 event pairs, 33 based on Foata normal form. 4/464 useless extension candidates. Maximal degree in co-relation 1101. Up to 142 conditions per place. [2025-03-09 01:02:49,257 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 36 selfloop transitions, 4 changer transitions 27/72 dead transitions. [2025-03-09 01:02:49,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 362 flow [2025-03-09 01:02:49,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:02:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:02:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2025-03-09 01:02:49,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2025-03-09 01:02:49,258 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 113 flow. Second operand 10 states and 142 transitions. [2025-03-09 01:02:49,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 362 flow [2025-03-09 01:02:49,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 332 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-09 01:02:49,260 INFO L231 Difference]: Finished difference. Result has 56 places, 32 transitions, 108 flow [2025-03-09 01:02:49,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=108, PETRI_PLACES=56, PETRI_TRANSITIONS=32} [2025-03-09 01:02:49,260 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-03-09 01:02:49,261 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 32 transitions, 108 flow [2025-03-09 01:02:49,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:02:49,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:49,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:49,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:02:49,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:49,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:49,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1889647846, now seen corresponding path program 3 times [2025-03-09 01:02:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102235795] [2025-03-09 01:02:49,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:02:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:49,465 INFO L229 MonitoredProcess]: Starting monitored process 8 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:02:49,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:02:49,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:49,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:49,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:02:49,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:02:49,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:02:49,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:02:49,635 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:02:49,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:02:49,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:02:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102235795] [2025-03-09 01:02:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102235795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:02:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:02:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:02:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594301414] [2025-03-09 01:02:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:02:49,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:02:49,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:02:49,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:02:49,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:02:49,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-09 01:02:49,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 32 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:02:49,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:02:49,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-09 01:02:49,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:02:49,918 INFO L124 PetriNetUnfolderBase]: 209/428 cut-off events. [2025-03-09 01:02:49,919 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-09 01:02:49,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 428 events. 209/428 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1556 event pairs, 35 based on Foata normal form. 4/431 useless extension candidates. Maximal degree in co-relation 1040. Up to 170 conditions per place. [2025-03-09 01:02:49,920 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 27 selfloop transitions, 4 changer transitions 30/66 dead transitions. [2025-03-09 01:02:49,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 329 flow [2025-03-09 01:02:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:02:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:02:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-03-09 01:02:49,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3817663817663818 [2025-03-09 01:02:49,924 INFO L175 Difference]: Start difference. First operand has 56 places, 32 transitions, 108 flow. Second operand 9 states and 134 transitions. [2025-03-09 01:02:49,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 329 flow [2025-03-09 01:02:49,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 291 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-03-09 01:02:49,926 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 108 flow [2025-03-09 01:02:49,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2025-03-09 01:02:49,927 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-03-09 01:02:49,929 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 108 flow [2025-03-09 01:02:49,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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:02:49,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:02:49,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:02:49,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:02:50,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:50,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-09 01:02:50,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:02:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1265166530, now seen corresponding path program 4 times [2025-03-09 01:02:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:02:50,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709650626] [2025-03-09 01:02:50,132 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:02:50,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:02:50,135 INFO L229 MonitoredProcess]: Starting monitored process 9 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:02:50,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:02:50,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:02:50,212 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:50,212 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:02:50,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:02:50,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:02:50,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:02:50,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:02:50,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:02:50,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:02:50,272 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 01:02:50,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:02:50,273 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-09 01:02:50,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-09 01:02:50,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-09 01:02:50,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-09 01:02:50,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-09 01:02:50,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-09 01:02:50,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:02:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:02:50,476 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-03-09 01:02:50,545 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:02:50,546 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:02:50,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:02:50 BasicIcfg [2025-03-09 01:02:50,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:02:50,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:02:50,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:02:50,553 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:02:50,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:02:45" (3/4) ... [2025-03-09 01:02:50,555 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:02:50,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:02:50,556 INFO L158 Benchmark]: Toolchain (without parser) took 6381.86ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.6MB in the beginning and 92.2MB in the end (delta: -515.2kB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2025-03-09 01:02:50,556 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:50,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.70ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:02:50,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.96ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:50,556 INFO L158 Benchmark]: Boogie Preprocessor took 41.32ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:50,557 INFO L158 Benchmark]: IcfgBuilder took 705.35ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 52.8MB in the end (delta: 11.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-03-09 01:02:50,557 INFO L158 Benchmark]: TraceAbstraction took 5164.34ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 52.0MB in the beginning and 92.2MB in the end (delta: -40.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2025-03-09 01:02:50,557 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 92.2MB in the end (delta: 9.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:02:50,558 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.17ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.70ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 68.8MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.96ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 66.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.32ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 64.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 705.35ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 52.8MB in the end (delta: 11.4MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5164.34ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 52.0MB in the beginning and 92.2MB in the end (delta: -40.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 159.4MB. Free memory was 92.2MB in the beginning and 92.2MB in the end (delta: 9.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835=-1, t836=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=-1, t836=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=-1, t836=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835=-1, t836=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix031.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 826]: 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, 59 locations, 58 edges, 6 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: 5.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1249 IncrementalHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 1249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=5, InterpolantAutomatonStates: 43, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 569 SizeOfPredicates, 23 NumberOfNonLiveVariables, 628 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:02:50,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample