./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:45:45,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:45:45,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:45:45,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:45:45,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:45:45,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:45:45,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:45:45,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:45:45,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:45:45,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:45:45,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:45:45,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:45:45,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:45:45,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:45:45,634 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:45:45,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:45:45,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:45,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:45,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:45:45,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:45:45,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:45:45,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:45:45,637 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-04-30 10:45:45,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:45:45,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:45:45,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:45:45,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:45:45,877 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:45:45,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:45:47,229 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e6a0dce/9550b69e547c4ce79253b1562b4bb359/FLAG7891efacb [2025-04-30 10:45:47,471 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:45:47,471 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:45:47,486 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e6a0dce/9550b69e547c4ce79253b1562b4bb359/FLAG7891efacb [2025-04-30 10:45:48,230 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e6a0dce/9550b69e547c4ce79253b1562b4bb359 [2025-04-30 10:45:48,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:45:48,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:45:48,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:45:48,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:45:48,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:45:48,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab28f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48, skipping insertion in model container [2025-04-30 10:45:48,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:45:48,623 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:45:48,636 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:45:48,702 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:45:48,756 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:45:48,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48 WrapperNode [2025-04-30 10:45:48,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:45:48,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:45:48,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:45:48,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:45:48,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,803 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2025-04-30 10:45:48,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:45:48,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:45:48,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:45:48,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:45:48,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,836 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-04-30 10:45:48,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:45:48,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:45:48,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:45:48,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:45:48,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (1/1) ... [2025-04-30 10:45:48,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:48,877 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-04-30 10:45:48,880 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-04-30 10:45:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-30 10:45:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-30 10:45:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-30 10:45:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-30 10:45:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:45:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:45:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:45:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:45:48,900 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:45:49,007 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:45:49,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:45:49,147 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:45:49,147 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:45:49,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:45:49,404 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:45:49,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:45:49 BoogieIcfgContainer [2025-04-30 10:45:49,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:45:49,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:45:49,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:45:49,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:45:49,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:45:48" (1/3) ... [2025-04-30 10:45:49,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524fa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:45:49, skipping insertion in model container [2025-04-30 10:45:49,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:45:48" (2/3) ... [2025-04-30 10:45:49,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524fa837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:45:49, skipping insertion in model container [2025-04-30 10:45:49,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:45:49" (3/3) ... [2025-04-30 10:45:49,414 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-30 10:45:49,423 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:45:49,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 24 locations, 26 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-30 10:45:49,424 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:45:49,453 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:45:49,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2025-04-30 10:45:49,501 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-30 10:45:49,503 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:45:49,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-30 10:45:49,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2025-04-30 10:45:49,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2025-04-30 10:45:49,514 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:45:49,521 INFO L340 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;@7bfbd067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:45:49,521 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-30 10:45:49,529 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:45:49,529 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-30 10:45:49,529 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:45:49,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:49,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:49,530 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:49,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1263433444, now seen corresponding path program 1 times [2025-04-30 10:45:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:49,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010566747] [2025-04-30 10:45:49,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:49,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:45:49,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:45:49,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:49,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:45:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:49,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010566747] [2025-04-30 10:45:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010566747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311390004] [2025-04-30 10:45:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:49,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:45:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:49,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:45:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:45:49,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:45:49,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04-30 10:45:49,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:49,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:45:49,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:49,904 INFO L116 PetriNetUnfolderBase]: 17/57 cut-off events. [2025-04-30 10:45:49,905 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:45:49,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 57 events. 17/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 142 event pairs, 6 based on Foata normal form. 7/63 useless extension candidates. Maximal degree in co-relation 81. Up to 30 conditions per place. [2025-04-30 10:45:49,907 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 15 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2025-04-30 10:45:49,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 90 flow [2025-04-30 10:45:49,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:45:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:45:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-30 10:45:49,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-04-30 10:45:49,918 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2025-04-30 10:45:49,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 90 flow [2025-04-30 10:45:49,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:45:49,927 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2025-04-30 10:45:49,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-30 10:45:49,931 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-04-30 10:45:49,932 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2025-04-30 10:45:49,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04-30 10:45:49,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:49,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:49,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:45:49,932 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:49,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash 998010515, now seen corresponding path program 1 times [2025-04-30 10:45:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:49,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791198399] [2025-04-30 10:45:49,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:49,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:49,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:45:49,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:45:49,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:49,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:45:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:50,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791198399] [2025-04-30 10:45:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791198399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:45:50,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:45:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:45:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409569466] [2025-04-30 10:45:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:45:50,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:45:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:50,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:45:50,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:45:50,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2025-04-30 10:45:50,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:45:50,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:50,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2025-04-30 10:45:50,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:50,087 INFO L116 PetriNetUnfolderBase]: 19/66 cut-off events. [2025-04-30 10:45:50,087 INFO L117 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-04-30 10:45:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 66 events. 19/66 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 154 event pairs, 6 based on Foata normal form. 3/69 useless extension candidates. Maximal degree in co-relation 48. Up to 30 conditions per place. [2025-04-30 10:45:50,091 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2025-04-30 10:45:50,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 104 flow [2025-04-30 10:45:50,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:45:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:45:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-30 10:45:50,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2025-04-30 10:45:50,092 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 49 transitions. [2025-04-30 10:45:50,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 104 flow [2025-04-30 10:45:50,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:45:50,094 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2025-04-30 10:45:50,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2025-04-30 10:45:50,094 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-04-30 10:45:50,095 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2025-04-30 10:45:50,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:45:50,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:50,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:50,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:45:50,096 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:50,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 896757708, now seen corresponding path program 1 times [2025-04-30 10:45:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:50,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047304709] [2025-04-30 10:45:50,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:45:50,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:45:50,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:50,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:45:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:50,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047304709] [2025-04-30 10:45:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047304709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:50,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666016667] [2025-04-30 10:45:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:45:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:50,236 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-04-30 10:45:50,238 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-04-30 10:45:50,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:45:50,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:45:50,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:50,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:50,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:45:50,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:45:50,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:45:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666016667] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:50,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:50,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-30 10:45:50,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178297757] [2025-04-30 10:45:50,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:50,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:45:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:50,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:45:50,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:45:50,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-30 10:45:50,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-04-30 10:45:50,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:50,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-30 10:45:50,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:50,696 INFO L116 PetriNetUnfolderBase]: 89/252 cut-off events. [2025-04-30 10:45:50,697 INFO L117 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-04-30 10:45:50,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 252 events. 89/252 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 983 event pairs, 6 based on Foata normal form. 35/286 useless extension candidates. Maximal degree in co-relation 209. Up to 45 conditions per place. [2025-04-30 10:45:50,699 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 45 selfloop transitions, 33 changer transitions 0/84 dead transitions. [2025-04-30 10:45:50,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 84 transitions, 422 flow [2025-04-30 10:45:50,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:45:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:45:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 236 transitions. [2025-04-30 10:45:50,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-04-30 10:45:50,703 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 16 states and 236 transitions. [2025-04-30 10:45:50,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 84 transitions, 422 flow [2025-04-30 10:45:50,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 84 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:45:50,705 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 334 flow [2025-04-30 10:45:50,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-04-30 10:45:50,707 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2025-04-30 10:45:50,708 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 334 flow [2025-04-30 10:45:50,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-04-30 10:45:50,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:50,708 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:50,715 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-04-30 10:45:50,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:50,913 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:50,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash -979292263, now seen corresponding path program 2 times [2025-04-30 10:45:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:50,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741387551] [2025-04-30 10:45:50,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:50,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:45:50,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:45:50,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:50,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:45:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:51,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741387551] [2025-04-30 10:45:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741387551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:51,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071469513] [2025-04-30 10:45:51,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:45:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:51,043 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-04-30 10:45:51,044 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-04-30 10:45:51,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:45:51,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:45:51,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:45:51,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:51,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:45:51,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:45:51,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:45:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071469513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:51,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:51,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:45:51,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756338741] [2025-04-30 10:45:51,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:51,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:45:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:51,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:45:51,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:45:51,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:45:51,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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-04-30 10:45:51,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:51,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:45:51,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:51,423 INFO L116 PetriNetUnfolderBase]: 150/424 cut-off events. [2025-04-30 10:45:51,423 INFO L117 PetriNetUnfolderBase]: For 2509/2558 co-relation queries the response was YES. [2025-04-30 10:45:51,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 424 events. 150/424 cut-off events. For 2509/2558 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1763 event pairs, 35 based on Foata normal form. 45/434 useless extension candidates. Maximal degree in co-relation 1242. Up to 120 conditions per place. [2025-04-30 10:45:51,432 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 53 selfloop transitions, 20 changer transitions 0/83 dead transitions. [2025-04-30 10:45:51,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 696 flow [2025-04-30 10:45:51,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:45:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:45:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2025-04-30 10:45:51,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:45:51,435 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 334 flow. Second operand 8 states and 124 transitions. [2025-04-30 10:45:51,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 696 flow [2025-04-30 10:45:51,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 620 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-30 10:45:51,448 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2025-04-30 10:45:51,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-04-30 10:45:51,450 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 36 predicate places. [2025-04-30 10:45:51,451 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 404 flow [2025-04-30 10:45:51,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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-04-30 10:45:51,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:51,451 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:51,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:45:51,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:45:51,652 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:51,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 732018207, now seen corresponding path program 3 times [2025-04-30 10:45:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:51,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855399121] [2025-04-30 10:45:51,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:51,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 7 equivalence classes. [2025-04-30 10:45:51,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 43 of 53 statements. [2025-04-30 10:45:51,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:45:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-04-30 10:45:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:51,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855399121] [2025-04-30 10:45:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855399121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:51,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461793056] [2025-04-30 10:45:51,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:45:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:51,803 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-04-30 10:45:51,804 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-04-30 10:45:51,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 7 equivalence classes. [2025-04-30 10:45:51,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 43 of 53 statements. [2025-04-30 10:45:51,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:45:51,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:51,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:45:51,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-04-30 10:45:51,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-04-30 10:45:52,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461793056] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:52,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:52,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-30 10:45:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791549076] [2025-04-30 10:45:52,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:52,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:45:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:52,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:45:52,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:45:52,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-30 10:45:52,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 404 flow. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 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-04-30 10:45:52,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:52,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-30 10:45:52,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:52,199 INFO L116 PetriNetUnfolderBase]: 324/880 cut-off events. [2025-04-30 10:45:52,200 INFO L117 PetriNetUnfolderBase]: For 9275/9277 co-relation queries the response was YES. [2025-04-30 10:45:52,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 880 events. 324/880 cut-off events. For 9275/9277 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4846 event pairs, 29 based on Foata normal form. 92/965 useless extension candidates. Maximal degree in co-relation 2970. Up to 201 conditions per place. [2025-04-30 10:45:52,208 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 145 selfloop transitions, 36 changer transitions 0/188 dead transitions. [2025-04-30 10:45:52,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 188 transitions, 2302 flow [2025-04-30 10:45:52,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:45:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:45:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2025-04-30 10:45:52,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:45:52,210 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 404 flow. Second operand 12 states and 186 transitions. [2025-04-30 10:45:52,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 188 transitions, 2302 flow [2025-04-30 10:45:52,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 188 transitions, 2058 flow, removed 88 selfloop flow, removed 2 redundant places. [2025-04-30 10:45:52,223 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 632 flow [2025-04-30 10:45:52,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=632, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2025-04-30 10:45:52,224 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2025-04-30 10:45:52,224 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 632 flow [2025-04-30 10:45:52,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 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-04-30 10:45:52,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:52,225 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:52,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:45:52,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:52,425 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:52,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash -478974567, now seen corresponding path program 4 times [2025-04-30 10:45:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:52,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388769297] [2025-04-30 10:45:52,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:45:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:52,443 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-30 10:45:52,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:45:52,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:45:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:45:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:52,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388769297] [2025-04-30 10:45:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388769297] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:52,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929912863] [2025-04-30 10:45:52,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:45:52,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:52,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:52,596 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-04-30 10:45:52,597 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-04-30 10:45:52,687 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-30 10:45:52,709 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:45:52,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:45:52,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:52,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:45:52,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:45:52,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:45:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929912863] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:52,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:52,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-04-30 10:45:52,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322934344] [2025-04-30 10:45:52,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:52,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:45:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:52,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:45:52,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:45:52,921 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:45:52,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 632 flow. Second operand has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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-04-30 10:45:52,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:52,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:45:52,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:53,218 INFO L116 PetriNetUnfolderBase]: 584/1656 cut-off events. [2025-04-30 10:45:53,219 INFO L117 PetriNetUnfolderBase]: For 14441/14624 co-relation queries the response was YES. [2025-04-30 10:45:53,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6968 conditions, 1656 events. 584/1656 cut-off events. For 14441/14624 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9950 event pairs, 87 based on Foata normal form. 210/1734 useless extension candidates. Maximal degree in co-relation 6061. Up to 495 conditions per place. [2025-04-30 10:45:53,232 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 199 selfloop transitions, 28 changer transitions 0/240 dead transitions. [2025-04-30 10:45:53,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2516 flow [2025-04-30 10:45:53,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:45:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:45:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2025-04-30 10:45:53,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:45:53,234 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 632 flow. Second operand 16 states and 248 transitions. [2025-04-30 10:45:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2516 flow [2025-04-30 10:45:53,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 240 transitions, 2426 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:45:53,252 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 830 flow [2025-04-30 10:45:53,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=830, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2025-04-30 10:45:53,255 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 73 predicate places. [2025-04-30 10:45:53,255 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 830 flow [2025-04-30 10:45:53,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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-04-30 10:45:53,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:53,255 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:53,261 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-04-30 10:45:53,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:53,457 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:53,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash 841579743, now seen corresponding path program 5 times [2025-04-30 10:45:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:53,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960195671] [2025-04-30 10:45:53,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:45:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:53,483 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 111 statements into 15 equivalence classes. [2025-04-30 10:45:53,506 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 111 of 111 statements. [2025-04-30 10:45:53,506 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-04-30 10:45:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-04-30 10:45:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:53,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960195671] [2025-04-30 10:45:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960195671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:53,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110838484] [2025-04-30 10:45:53,732 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:45:53,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:53,734 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-04-30 10:45:53,736 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-04-30 10:45:53,824 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 111 statements into 15 equivalence classes. [2025-04-30 10:45:53,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 111 of 111 statements. [2025-04-30 10:45:53,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-04-30 10:45:53,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:53,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:45:53,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-04-30 10:45:53,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-04-30 10:45:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110838484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:54,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2025-04-30 10:45:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149024585] [2025-04-30 10:45:54,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:54,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:45:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:54,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:45:54,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:45:54,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-30 10:45:54,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 830 flow. Second operand has 22 states, 22 states have (on average 11.318181818181818) internal successors, (249), 22 states have internal predecessors, (249), 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-04-30 10:45:54,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:54,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-30 10:45:54,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:54,711 INFO L116 PetriNetUnfolderBase]: 1292/3360 cut-off events. [2025-04-30 10:45:54,711 INFO L117 PetriNetUnfolderBase]: For 62705/62707 co-relation queries the response was YES. [2025-04-30 10:45:54,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16567 conditions, 3360 events. 1292/3360 cut-off events. For 62705/62707 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 23314 event pairs, 61 based on Foata normal form. 312/3657 useless extension candidates. Maximal degree in co-relation 14862. Up to 739 conditions per place. [2025-04-30 10:45:54,744 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 463 selfloop transitions, 66 changer transitions 0/537 dead transitions. [2025-04-30 10:45:54,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 537 transitions, 8604 flow [2025-04-30 10:45:54,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:45:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:45:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2025-04-30 10:45:54,747 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2025-04-30 10:45:54,747 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 830 flow. Second operand 22 states and 340 transitions. [2025-04-30 10:45:54,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 537 transitions, 8604 flow [2025-04-30 10:45:54,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 537 transitions, 8314 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:45:54,811 INFO L231 Difference]: Finished difference. Result has 125 places, 116 transitions, 1360 flow [2025-04-30 10:45:54,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1360, PETRI_PLACES=125, PETRI_TRANSITIONS=116} [2025-04-30 10:45:54,811 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2025-04-30 10:45:54,811 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 116 transitions, 1360 flow [2025-04-30 10:45:54,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.318181818181818) internal successors, (249), 22 states have internal predecessors, (249), 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-04-30 10:45:54,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:54,812 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:54,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:45:55,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:55,012 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:55,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2591329, now seen corresponding path program 6 times [2025-04-30 10:45:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:55,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391144580] [2025-04-30 10:45:55,014 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:45:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:55,034 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 141 statements into 21 equivalence classes. [2025-04-30 10:45:55,086 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:45:55,086 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-30 10:45:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:45:55,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:45:55,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391144580] [2025-04-30 10:45:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391144580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:45:55,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299261777] [2025-04-30 10:45:55,440 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:45:55,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:45:55,442 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-04-30 10:45:55,444 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-04-30 10:45:55,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 141 statements into 21 equivalence classes. [2025-04-30 10:45:55,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:45:55,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-30 10:45:55,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:45:55,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:45:55,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:45:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:45:55,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:45:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:45:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299261777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:45:55,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:45:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:45:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525541980] [2025-04-30 10:45:55,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:45:55,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:45:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:45:55,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:45:55,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:45:56,000 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:45:56,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 1360 flow. Second operand has 23 states, 23 states have (on average 13.217391304347826) internal successors, (304), 23 states have internal predecessors, (304), 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-04-30 10:45:56,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:45:56,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:45:56,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:45:56,651 INFO L116 PetriNetUnfolderBase]: 1472/4088 cut-off events. [2025-04-30 10:45:56,651 INFO L117 PetriNetUnfolderBase]: For 64175/64679 co-relation queries the response was YES. [2025-04-30 10:45:56,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20873 conditions, 4088 events. 1472/4088 cut-off events. For 64175/64679 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 29302 event pairs, 137 based on Foata normal form. 452/4314 useless extension candidates. Maximal degree in co-relation 19164. Up to 1323 conditions per place. [2025-04-30 10:45:56,685 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 487 selfloop transitions, 34 changer transitions 0/537 dead transitions. [2025-04-30 10:45:56,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 537 transitions, 7364 flow [2025-04-30 10:45:56,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:45:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:45:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2025-04-30 10:45:56,687 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2025-04-30 10:45:56,687 INFO L175 Difference]: Start difference. First operand has 125 places, 116 transitions, 1360 flow. Second operand 22 states and 336 transitions. [2025-04-30 10:45:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 537 transitions, 7364 flow [2025-04-30 10:45:56,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 537 transitions, 6986 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-30 10:45:56,741 INFO L231 Difference]: Finished difference. Result has 144 places, 123 transitions, 1526 flow [2025-04-30 10:45:56,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1526, PETRI_PLACES=144, PETRI_TRANSITIONS=123} [2025-04-30 10:45:56,742 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 119 predicate places. [2025-04-30 10:45:56,742 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 123 transitions, 1526 flow [2025-04-30 10:45:56,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 13.217391304347826) internal successors, (304), 23 states have internal predecessors, (304), 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-04-30 10:45:56,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:45:56,742 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:45:56,748 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-04-30 10:45:56,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:45:56,943 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:45:56,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:45:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2039701825, now seen corresponding path program 7 times [2025-04-30 10:45:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:45:56,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319641368] [2025-04-30 10:45:56,944 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:45:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:45:56,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:45:57,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:45:57,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:57,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:45:57,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:45:57,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:45:57,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:45:57,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:45:57,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:45:57,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:45:57,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:45:57,104 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2025-04-30 10:45:57,105 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2025-04-30 10:45:57,105 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-30 10:45:57,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:45:57,106 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-04-30 10:45:57,244 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:45:57,244 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:45:57,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:45:57 BasicIcfg [2025-04-30 10:45:57,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:45:57,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:45:57,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:45:57,248 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:45:57,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:45:49" (3/4) ... [2025-04-30 10:45:57,250 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:45:57,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:45:57,251 INFO L158 Benchmark]: Toolchain (without parser) took 9018.47ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 114.0MB in the beginning and 392.0MB in the end (delta: -278.0MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. [2025-04-30 10:45:57,252 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:45:57,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.96ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 73.6MB in the end (delta: 39.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:45:57,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.22ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 70.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:45:57,252 INFO L158 Benchmark]: Boogie Preprocessor took 45.78ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 68.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:45:57,253 INFO L158 Benchmark]: RCFGBuilder took 552.36ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 78.9MB in the end (delta: -10.3MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2025-04-30 10:45:57,253 INFO L158 Benchmark]: TraceAbstraction took 7841.61ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 78.1MB in the beginning and 392.0MB in the end (delta: -313.9MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-04-30 10:45:57,253 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 578.8MB. Free memory was 392.0MB in the beginning and 392.0MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:45:57,254 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.72ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.96ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 73.6MB in the end (delta: 39.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.22ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 70.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.78ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 68.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 552.36ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 78.9MB in the end (delta: -10.3MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7841.61ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 78.1MB in the beginning and 392.0MB in the end (delta: -313.9MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 578.8MB. Free memory was 392.0MB in the beginning and 392.0MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\at(arg, Pre)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, j=20, myglobal=20] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=21, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=23, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=25, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=27, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=29, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=31, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=33, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=35, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=37, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=39, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1352] COND FALSE 0 !(i<20) VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] CALL 0 reach_error() [L12] COND FALSE 0 !(0) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, j=20, myglobal=40] [L12] 0 __assert_fail ("0", "pthread-demo-datarace-2.c", 25, __extension__ __PRETTY_FUNCTION__) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, i=20, j=20, myglobal=40] - UnprovableResult [Line: 1338]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1342]: 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 3 procedures, 32 locations, 36 edges, 3 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: 7.6s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 805 IncrementalHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 2 mSDtfsCounter, 805 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 921 GetRequests, 820 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1526occurred in iteration=8, InterpolantAutomatonStates: 102, 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.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 1289 ConstructedInterpolants, 0 QuantifiedInterpolants, 2935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1340 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 3925/6100 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-04-30 10:45:57,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:45:59,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:45:59,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-30 10:45:59,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:45:59,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:45:59,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:45:59,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:45:59,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:45:59,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:45:59,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:45:59,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:45:59,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:45:59,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:45:59,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:45:59,129 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:45:59,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:45:59,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:45:59,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:59,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:45:59,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:45:59,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:45:59,132 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-04-30 10:45:59,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:45:59,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:45:59,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:45:59,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:45:59,367 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:45:59,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:46:00,708 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a056179be/3dd8e7f23cd94771a263f77c9610d290/FLAG52609ee2f [2025-04-30 10:46:00,724 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-30 10:46:00,950 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:46:00,950 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:46:00,966 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a056179be/3dd8e7f23cd94771a263f77c9610d290/FLAG52609ee2f [2025-04-30 10:46:01,758 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a056179be/3dd8e7f23cd94771a263f77c9610d290 [2025-04-30 10:46:01,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:46:01,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:46:01,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:46:01,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:46:01,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:46:01,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:46:01" (1/1) ... [2025-04-30 10:46:01,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a091baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:01, skipping insertion in model container [2025-04-30 10:46:01,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:46:01" (1/1) ... [2025-04-30 10:46:01,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:46:02,172 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:46:02,188 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:46:02,248 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:46:02,318 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:46:02,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02 WrapperNode [2025-04-30 10:46:02,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:46:02,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:46:02,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:46:02,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:46:02,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,361 INFO L138 Inliner]: procedures = 365, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2025-04-30 10:46:02,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:46:02,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:46:02,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:46:02,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:46:02,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,388 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-04-30 10:46:02,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:46:02,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:46:02,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:46:02,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:46:02,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (1/1) ... [2025-04-30 10:46:02,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:46:02,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:02,427 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-04-30 10:46:02,429 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-04-30 10:46:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-30 10:46:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-30 10:46:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-30 10:46:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-30 10:46:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-30 10:46:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:46:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:46:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:46:02,446 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:46:02,543 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:46:02,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:46:02,698 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:46:02,699 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:46:03,008 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:46:03,008 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:46:03,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:03 BoogieIcfgContainer [2025-04-30 10:46:03,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:46:03,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:46:03,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:46:03,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:46:03,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:46:01" (1/3) ... [2025-04-30 10:46:03,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a76519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:46:03, skipping insertion in model container [2025-04-30 10:46:03,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:46:02" (2/3) ... [2025-04-30 10:46:03,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a76519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:46:03, skipping insertion in model container [2025-04-30 10:46:03,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:46:03" (3/3) ... [2025-04-30 10:46:03,015 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-30 10:46:03,025 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:46:03,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 24 locations, 26 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-30 10:46:03,026 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:46:03,055 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:46:03,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2025-04-30 10:46:03,106 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-30 10:46:03,108 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:46:03,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-30 10:46:03,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2025-04-30 10:46:03,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2025-04-30 10:46:03,117 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:46:03,124 INFO L340 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;@2e89ebb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:46:03,124 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-30 10:46:03,130 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:46:03,132 INFO L116 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-04-30 10:46:03,132 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:46:03,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:03,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:03,133 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:03,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1018610266, now seen corresponding path program 1 times [2025-04-30 10:46:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:03,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218667223] [2025-04-30 10:46:03,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:03,149 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-04-30 10:46:03,150 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-04-30 10:46:03,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:46:03,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:46:03,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:03,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:03,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-30 10:46:03,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:03,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:03,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:03,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218667223] [2025-04-30 10:46:03,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218667223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:03,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:03,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:46:03,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159489182] [2025-04-30 10:46:03,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:03,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:46:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:03,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:46:03,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:46:03,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2025-04-30 10:46:03,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:03,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:03,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2025-04-30 10:46:03,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:03,380 INFO L116 PetriNetUnfolderBase]: 9/36 cut-off events. [2025-04-30 10:46:03,380 INFO L117 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-04-30 10:46:03,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 36 events. 9/36 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 3 based on Foata normal form. 3/33 useless extension candidates. Maximal degree in co-relation 44. Up to 22 conditions per place. [2025-04-30 10:46:03,382 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 11 selfloop transitions, 0 changer transitions 1/20 dead transitions. [2025-04-30 10:46:03,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 68 flow [2025-04-30 10:46:03,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:46:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-30 10:46:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2025-04-30 10:46:03,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-30 10:46:03,395 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 2 states and 36 transitions. [2025-04-30 10:46:03,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 68 flow [2025-04-30 10:46:03,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:46:03,402 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 40 flow [2025-04-30 10:46:03,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-30 10:46:03,408 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2025-04-30 10:46:03,409 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 40 flow [2025-04-30 10:46:03,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:03,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:03,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:03,417 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-04-30 10:46:03,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:03,618 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:03,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1226712453, now seen corresponding path program 1 times [2025-04-30 10:46:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:03,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796801664] [2025-04-30 10:46:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:03,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:03,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:03,621 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-04-30 10:46:03,622 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-04-30 10:46:03,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:46:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:46:03,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:03,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:03,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:46:03,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:46:03,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:03,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:03,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796801664] [2025-04-30 10:46:03,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796801664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440186371] [2025-04-30 10:46:03,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:03,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:03,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:03,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:03,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:03,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2025-04-30 10:46:03,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04-30 10:46:03,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:03,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2025-04-30 10:46:03,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:03,824 INFO L116 PetriNetUnfolderBase]: 13/49 cut-off events. [2025-04-30 10:46:03,824 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:46:03,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 49 events. 13/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 3 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 79. Up to 22 conditions per place. [2025-04-30 10:46:03,826 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 13 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2025-04-30 10:46:03,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 23 transitions, 78 flow [2025-04-30 10:46:03,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:46:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-30 10:46:03,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2025-04-30 10:46:03,829 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 40 flow. Second operand 3 states and 49 transitions. [2025-04-30 10:46:03,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 23 transitions, 78 flow [2025-04-30 10:46:03,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 23 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:46:03,832 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2025-04-30 10:46:03,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-30 10:46:03,833 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-04-30 10:46:03,833 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2025-04-30 10:46:03,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04-30 10:46:03,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:03,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:03,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:46:04,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:04,034 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:04,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1259194598, now seen corresponding path program 1 times [2025-04-30 10:46:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:04,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390548936] [2025-04-30 10:46:04,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:04,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:04,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:04,037 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-04-30 10:46:04,037 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-04-30 10:46:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:46:04,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:46:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:04,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:46:04,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:46:04,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:46:04,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:04,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390548936] [2025-04-30 10:46:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390548936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:46:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:46:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:46:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230134631] [2025-04-30 10:46:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:46:04,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:46:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:04,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:46:04,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:46:04,160 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:46:04,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04-30 10:46:04,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:04,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:46:04,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:04,206 INFO L116 PetriNetUnfolderBase]: 25/81 cut-off events. [2025-04-30 10:46:04,206 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-30 10:46:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 81 events. 25/81 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 209 event pairs, 10 based on Foata normal form. 6/82 useless extension candidates. Maximal degree in co-relation 155. Up to 42 conditions per place. [2025-04-30 10:46:04,207 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-04-30 10:46:04,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 112 flow [2025-04-30 10:46:04,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:46:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:46:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-30 10:46:04,208 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-04-30 10:46:04,208 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2025-04-30 10:46:04,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 112 flow [2025-04-30 10:46:04,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:46:04,209 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 62 flow [2025-04-30 10:46:04,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-30 10:46:04,209 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-30 10:46:04,209 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 62 flow [2025-04-30 10:46:04,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-04-30 10:46:04,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:04,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:04,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:46:04,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:04,412 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:04,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash 12055380, now seen corresponding path program 1 times [2025-04-30 10:46:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:04,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732323414] [2025-04-30 10:46:04,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:46:04,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:04,416 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-04-30 10:46:04,418 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-04-30 10:46:04,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:46:04,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:46:04,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:04,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:04,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:46:04,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:46:04,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:46:04,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:04,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732323414] [2025-04-30 10:46:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732323414] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:04,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-04-30 10:46:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124934205] [2025-04-30 10:46:04,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:04,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:04,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:04,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:04,610 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-30 10:46:04,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:04,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:04,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-30 10:46:04,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:04,709 INFO L116 PetriNetUnfolderBase]: 67/174 cut-off events. [2025-04-30 10:46:04,711 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-30 10:46:04,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 174 events. 67/174 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 589 event pairs, 8 based on Foata normal form. 18/187 useless extension candidates. Maximal degree in co-relation 398. Up to 36 conditions per place. [2025-04-30 10:46:04,713 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2025-04-30 10:46:04,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 232 flow [2025-04-30 10:46:04,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:46:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-04-30 10:46:04,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:46:04,716 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 62 flow. Second operand 6 states and 93 transitions. [2025-04-30 10:46:04,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 232 flow [2025-04-30 10:46:04,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:46:04,718 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2025-04-30 10:46:04,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2025-04-30 10:46:04,718 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-04-30 10:46:04,718 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2025-04-30 10:46:04,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:46:04,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:04,719 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:04,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:46:04,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:04,919 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:04,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1469393142, now seen corresponding path program 2 times [2025-04-30 10:46:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:04,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962814496] [2025-04-30 10:46:04,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:46:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:04,922 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-04-30 10:46:04,923 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-04-30 10:46:05,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:46:05,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:46:05,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:46:05,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:05,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:46:05,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:46:05,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-30 10:46:05,133 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:05,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962814496] [2025-04-30 10:46:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962814496] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:05,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-04-30 10:46:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939389069] [2025-04-30 10:46:05,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:05,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:46:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:05,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:46:05,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:46:05,136 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:46:05,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-04-30 10:46:05,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:05,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:46:05,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:05,260 INFO L116 PetriNetUnfolderBase]: 78/240 cut-off events. [2025-04-30 10:46:05,260 INFO L117 PetriNetUnfolderBase]: For 479/489 co-relation queries the response was YES. [2025-04-30 10:46:05,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 240 events. 78/240 cut-off events. For 479/489 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 995 event pairs, 10 based on Foata normal form. 18/250 useless extension candidates. Maximal degree in co-relation 677. Up to 75 conditions per place. [2025-04-30 10:46:05,263 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 39 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-04-30 10:46:05,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 364 flow [2025-04-30 10:46:05,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:46:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:46:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-04-30 10:46:05,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:46:05,264 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 6 states and 93 transitions. [2025-04-30 10:46:05,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 364 flow [2025-04-30 10:46:05,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 324 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-30 10:46:05,267 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 132 flow [2025-04-30 10:46:05,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2025-04-30 10:46:05,268 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2025-04-30 10:46:05,268 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 132 flow [2025-04-30 10:46:05,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-04-30 10:46:05,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:05,268 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:05,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:46:05,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:05,469 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:05,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 677818497, now seen corresponding path program 3 times [2025-04-30 10:46:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:05,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677621328] [2025-04-30 10:46:05,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:46:05,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:05,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:05,472 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-04-30 10:46:05,474 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-04-30 10:46:05,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 5 equivalence classes. [2025-04-30 10:46:05,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:46:05,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-30 10:46:05,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:05,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:46:05,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:46:05,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:46:05,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:05,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677621328] [2025-04-30 10:46:05,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677621328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:05,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-04-30 10:46:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135786930] [2025-04-30 10:46:05,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:05,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:46:05,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:05,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:46:05,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:46:05,742 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-30 10:46:05,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 132 flow. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 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-04-30 10:46:05,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:05,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-30 10:46:05,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:06,066 INFO L116 PetriNetUnfolderBase]: 234/630 cut-off events. [2025-04-30 10:46:06,067 INFO L117 PetriNetUnfolderBase]: For 1473/1473 co-relation queries the response was YES. [2025-04-30 10:46:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 630 events. 234/630 cut-off events. For 1473/1473 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3214 event pairs, 16 based on Foata normal form. 66/685 useless extension candidates. Maximal degree in co-relation 2033. Up to 132 conditions per place. [2025-04-30 10:46:06,073 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 93 selfloop transitions, 12 changer transitions 0/112 dead transitions. [2025-04-30 10:46:06,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 112 transitions, 926 flow [2025-04-30 10:46:06,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:46:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:46:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2025-04-30 10:46:06,075 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:46:06,075 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 132 flow. Second operand 12 states and 186 transitions. [2025-04-30 10:46:06,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 112 transitions, 926 flow [2025-04-30 10:46:06,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 112 transitions, 838 flow, removed 33 selfloop flow, removed 1 redundant places. [2025-04-30 10:46:06,081 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 220 flow [2025-04-30 10:46:06,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=220, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2025-04-30 10:46:06,081 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 33 predicate places. [2025-04-30 10:46:06,081 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 220 flow [2025-04-30 10:46:06,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 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-04-30 10:46:06,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:06,082 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:06,090 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-04-30 10:46:06,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:06,282 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:06,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash -192559813, now seen corresponding path program 4 times [2025-04-30 10:46:06,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:06,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782213847] [2025-04-30 10:46:06,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:46:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:06,286 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-04-30 10:46:06,287 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-04-30 10:46:06,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-04-30 10:46:06,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-04-30 10:46:06,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:46:06,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:06,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:46:06,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:46:06,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:46:06,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:06,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782213847] [2025-04-30 10:46:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782213847] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:06,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:06,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-04-30 10:46:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545930622] [2025-04-30 10:46:06,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:06,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:46:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:06,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:46:06,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:46:06,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:46:06,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 220 flow. Second operand has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 states have internal predecessors, (157), 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-04-30 10:46:06,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:06,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:46:06,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:06,913 INFO L116 PetriNetUnfolderBase]: 366/1050 cut-off events. [2025-04-30 10:46:06,913 INFO L117 PetriNetUnfolderBase]: For 4079/4135 co-relation queries the response was YES. [2025-04-30 10:46:06,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 1050 events. 366/1050 cut-off events. For 4079/4135 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6246 event pairs, 22 based on Foata normal form. 72/1102 useless extension candidates. Maximal degree in co-relation 3735. Up to 363 conditions per place. [2025-04-30 10:46:06,920 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 147 selfloop transitions, 12 changer transitions 0/168 dead transitions. [2025-04-30 10:46:06,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 168 transitions, 1660 flow [2025-04-30 10:46:06,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:46:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:46:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2025-04-30 10:46:06,921 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-30 10:46:06,921 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 220 flow. Second operand 12 states and 186 transitions. [2025-04-30 10:46:06,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 168 transitions, 1660 flow [2025-04-30 10:46:06,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 168 transitions, 1594 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:46:06,928 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 310 flow [2025-04-30 10:46:06,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2025-04-30 10:46:06,929 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2025-04-30 10:46:06,929 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 310 flow [2025-04-30 10:46:06,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 12 states have internal predecessors, (157), 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-04-30 10:46:06,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:06,929 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:06,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:46:07,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:07,130 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:07,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 825664283, now seen corresponding path program 5 times [2025-04-30 10:46:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:07,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717454748] [2025-04-30 10:46:07,131 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:46:07,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:07,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:07,133 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-04-30 10:46:07,134 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-04-30 10:46:07,220 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 91 statements into 11 equivalence classes. [2025-04-30 10:46:07,265 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-30 10:46:07,266 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:46:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:07,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:46:07,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:46:07,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:46:07,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:07,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717454748] [2025-04-30 10:46:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717454748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:07,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-04-30 10:46:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216008896] [2025-04-30 10:46:07,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:07,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:46:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:07,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:46:07,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:46:07,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2025-04-30 10:46:07,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 310 flow. Second operand has 24 states, 24 states have (on average 13.041666666666666) internal successors, (313), 24 states have internal predecessors, (313), 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-04-30 10:46:07,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:07,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2025-04-30 10:46:07,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:08,711 INFO L116 PetriNetUnfolderBase]: 696/1980 cut-off events. [2025-04-30 10:46:08,711 INFO L117 PetriNetUnfolderBase]: For 12184/12300 co-relation queries the response was YES. [2025-04-30 10:46:08,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7737 conditions, 1980 events. 696/1980 cut-off events. For 12184/12300 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 12431 event pairs, 22 based on Foata normal form. 120/2080 useless extension candidates. Maximal degree in co-relation 7710. Up to 693 conditions per place. [2025-04-30 10:46:08,723 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 277 selfloop transitions, 22 changer transitions 0/308 dead transitions. [2025-04-30 10:46:08,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 308 transitions, 3118 flow [2025-04-30 10:46:08,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:46:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:46:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2025-04-30 10:46:08,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2025-04-30 10:46:08,725 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 310 flow. Second operand 22 states and 340 transitions. [2025-04-30 10:46:08,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 308 transitions, 3118 flow [2025-04-30 10:46:08,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 308 transitions, 3112 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:46:08,734 INFO L231 Difference]: Finished difference. Result has 102 places, 52 transitions, 504 flow [2025-04-30 10:46:08,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=504, PETRI_PLACES=102, PETRI_TRANSITIONS=52} [2025-04-30 10:46:08,735 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2025-04-30 10:46:08,735 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 52 transitions, 504 flow [2025-04-30 10:46:08,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.041666666666666) internal successors, (313), 24 states have internal predecessors, (313), 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-04-30 10:46:08,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:08,735 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:08,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:46:08,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:08,936 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:08,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2088922811, now seen corresponding path program 6 times [2025-04-30 10:46:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:08,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807218146] [2025-04-30 10:46:08,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:46:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:08,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:08,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:46:09,041 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 141 statements into 21 equivalence classes. [2025-04-30 10:46:09,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 141 of 141 statements. [2025-04-30 10:46:09,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-04-30 10:46:09,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:09,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:46:09,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-30 10:46:09,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-30 10:46:09,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:09,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807218146] [2025-04-30 10:46:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807218146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:09,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:09,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-04-30 10:46:09,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365818648] [2025-04-30 10:46:09,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:09,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:46:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:09,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:46:09,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:46:09,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-30 10:46:09,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 52 transitions, 504 flow. Second operand has 24 states, 24 states have (on average 11.25) internal successors, (270), 24 states have internal predecessors, (270), 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-04-30 10:46:09,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:09,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-30 10:46:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:46:10,864 INFO L116 PetriNetUnfolderBase]: 1811/4695 cut-off events. [2025-04-30 10:46:10,865 INFO L117 PetriNetUnfolderBase]: For 45751/45751 co-relation queries the response was YES. [2025-04-30 10:46:10,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20793 conditions, 4695 events. 1811/4695 cut-off events. For 45751/45751 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 33695 event pairs, 64 based on Foata normal form. 430/5073 useless extension candidates. Maximal degree in co-relation 20755. Up to 946 conditions per place. [2025-04-30 10:46:10,901 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 509 selfloop transitions, 22 changer transitions 0/540 dead transitions. [2025-04-30 10:46:10,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 540 transitions, 7898 flow [2025-04-30 10:46:10,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:46:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:46:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2025-04-30 10:46:10,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2025-04-30 10:46:10,906 INFO L175 Difference]: Start difference. First operand has 102 places, 52 transitions, 504 flow. Second operand 22 states and 340 transitions. [2025-04-30 10:46:10,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 540 transitions, 7898 flow [2025-04-30 10:46:10,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 540 transitions, 7520 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-30 10:46:10,953 INFO L231 Difference]: Finished difference. Result has 125 places, 63 transitions, 686 flow [2025-04-30 10:46:10,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=686, PETRI_PLACES=125, PETRI_TRANSITIONS=63} [2025-04-30 10:46:10,954 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2025-04-30 10:46:10,954 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 63 transitions, 686 flow [2025-04-30 10:46:10,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.25) internal successors, (270), 24 states have internal predecessors, (270), 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-04-30 10:46:10,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:46:10,954 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:46:10,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:46:11,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:11,155 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-30 10:46:11,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:46:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1678359143, now seen corresponding path program 7 times [2025-04-30 10:46:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:46:11,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448969212] [2025-04-30 10:46:11,157 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:46:11,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:46:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:46:11,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:46:11,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:46:11,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:46:11,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:46:11,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:46:11,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:46:11,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-30 10:46:11,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:46:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:46:12,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:46:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-04-30 10:46:14,089 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:46:14,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448969212] [2025-04-30 10:46:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448969212] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:46:14,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:46:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2025-04-30 10:46:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012337868] [2025-04-30 10:46:14,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:46:14,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-30 10:46:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:46:14,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-30 10:46:14,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1054, Invalid=6602, Unknown=0, NotChecked=0, Total=7656 [2025-04-30 10:46:14,116 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-04-30 10:46:14,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 63 transitions, 686 flow. Second operand has 88 states, 88 states have (on average 9.045454545454545) internal successors, (796), 88 states have internal predecessors, (796), 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-04-30 10:46:14,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:46:14,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-04-30 10:46:14,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15