./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c --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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c -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 eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:16:47,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:16:47,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:16:47,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:16:47,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:16:47,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:16:47,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:16:47,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:16:47,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:16:47,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:16:47,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:16:47,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:16:47,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:16:47,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:16:47,865 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:16:47,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:16:47,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:16:47,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:16:47,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:16:47,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:16:47,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:47,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:47,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:47,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:47,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:16:47,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:47,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:16:47,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:16:47,868 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 -> eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 [2025-04-29 11:16:48,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:16:48,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:16:48,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:16:48,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:16:48,091 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:16:48,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:16:49,448 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d248a13/4d22be7da26b4090a865dfc1c45622a3/FLAG7b02f5ba7 [2025-04-29 11:16:49,660 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:49,660 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:16:49,675 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:49,675 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:49,687 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d248a13/4d22be7da26b4090a865dfc1c45622a3/FLAG7b02f5ba7 [2025-04-29 11:16:50,499 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d248a13/4d22be7da26b4090a865dfc1c45622a3 [2025-04-29 11:16:50,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:50,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:50,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:50,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:50,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:50,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bce994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50, skipping insertion in model container [2025-04-29 11:16:50,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:50,677 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:50,686 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:50,713 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:50,726 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:50,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50 WrapperNode [2025-04-29 11:16:50,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:50,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:50,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:50,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:50,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,762 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 106 [2025-04-29 11:16:50,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:50,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:50,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:50,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:50,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,789 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 3 writes are split as follows [3]. [2025-04-29 11:16:50,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:50,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:50,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:50,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:50,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (1/1) ... [2025-04-29 11:16:50,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:50,835 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-29 11:16:50,838 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-29 11:16:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:50,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:16:50,857 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-29 11:16:50,857 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-29 11:16:50,858 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:16:50,930 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:50,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:51,124 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:16:51,124 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:16:51,223 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:16:51,223 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:16:51,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:51 BoogieIcfgContainer [2025-04-29 11:16:51,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:16:51,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:16:51,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:16:51,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:16:51,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:50" (1/3) ... [2025-04-29 11:16:51,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f84363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:51, skipping insertion in model container [2025-04-29 11:16:51,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:50" (2/3) ... [2025-04-29 11:16:51,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f84363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:51, skipping insertion in model container [2025-04-29 11:16:51,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:51" (3/3) ... [2025-04-29 11:16:51,230 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:16:51,240 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:16:51,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c that has 2 procedures, 54 locations, 58 edges, 1 initial locations, 3 loop locations, and 21 error locations. [2025-04-29 11:16:51,241 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:16:51,285 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:16:51,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 122 flow [2025-04-29 11:16:51,333 INFO L116 PetriNetUnfolderBase]: 6/58 cut-off events. [2025-04-29 11:16:51,336 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:51,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 58 events. 6/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 167 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-04-29 11:16:51,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 59 transitions, 122 flow [2025-04-29 11:16:51,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 58 transitions, 119 flow [2025-04-29 11:16:51,348 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:16:51,359 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;@5fc0613e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:16:51,360 INFO L341 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-04-29 11:16:51,363 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:16:51,363 INFO L116 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-04-29 11:16:51,363 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:51,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:51,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:16:51,364 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:51,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 11570, now seen corresponding path program 1 times [2025-04-29 11:16:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:51,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549556417] [2025-04-29 11:16:51,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:51,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:16:51,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:16:51,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:51,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:51,512 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-29 11:16:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:51,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549556417] [2025-04-29 11:16:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549556417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312062491] [2025-04-29 11:16:51,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:51,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:51,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:51,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 59 [2025-04-29 11:16:51,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-29 11:16:51,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:51,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 59 [2025-04-29 11:16:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:51,746 INFO L116 PetriNetUnfolderBase]: 158/467 cut-off events. [2025-04-29 11:16:51,746 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:51,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 467 events. 158/467 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2704 event pairs, 107 based on Foata normal form. 12/335 useless extension candidates. Maximal degree in co-relation 736. Up to 276 conditions per place. [2025-04-29 11:16:51,756 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 24 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-04-29 11:16:51,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 165 flow [2025-04-29 11:16:51,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-04-29 11:16:51,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2025-04-29 11:16:51,768 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 119 flow. Second operand 3 states and 119 transitions. [2025-04-29 11:16:51,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 165 flow [2025-04-29 11:16:51,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:51,775 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 116 flow [2025-04-29 11:16:51,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2025-04-29 11:16:51,780 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2025-04-29 11:16:51,781 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 116 flow [2025-04-29 11:16:51,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-29 11:16:51,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:51,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-29 11:16:51,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:16:51,782 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:51,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 11571, now seen corresponding path program 1 times [2025-04-29 11:16:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:51,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306640484] [2025-04-29 11:16:51,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-29 11:16:51,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-29 11:16:51,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:51,868 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-29 11:16:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:51,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306640484] [2025-04-29 11:16:51,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306640484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:51,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:51,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307921595] [2025-04-29 11:16:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:51,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:51,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:51,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:51,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 59 [2025-04-29 11:16:51,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-29 11:16:51,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:51,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 59 [2025-04-29 11:16:51,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:51,996 INFO L116 PetriNetUnfolderBase]: 158/466 cut-off events. [2025-04-29 11:16:51,996 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:51,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 466 events. 158/466 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2710 event pairs, 107 based on Foata normal form. 1/323 useless extension candidates. Maximal degree in co-relation 740. Up to 276 conditions per place. [2025-04-29 11:16:52,002 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 24 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-04-29 11:16:52,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 166 flow [2025-04-29 11:16:52,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-04-29 11:16:52,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6610169491525424 [2025-04-29 11:16:52,005 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 116 flow. Second operand 3 states and 117 transitions. [2025-04-29 11:16:52,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 166 flow [2025-04-29 11:16:52,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:52,006 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 114 flow [2025-04-29 11:16:52,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2025-04-29 11:16:52,007 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-04-29 11:16:52,008 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 114 flow [2025-04-29 11:16:52,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-29 11:16:52,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:52,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:16:52,008 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:52,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2109040022, now seen corresponding path program 1 times [2025-04-29 11:16:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224930863] [2025-04-29 11:16:52,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:16:52,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:16:52,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,054 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-29 11:16:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224930863] [2025-04-29 11:16:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224930863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:16:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244959778] [2025-04-29 11:16:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:52,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:52,082 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 59 [2025-04-29 11:16:52,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-29 11:16:52,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:52,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 59 [2025-04-29 11:16:52,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:52,149 INFO L116 PetriNetUnfolderBase]: 158/464 cut-off events. [2025-04-29 11:16:52,150 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:52,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 464 events. 158/464 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2688 event pairs, 107 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 738. Up to 276 conditions per place. [2025-04-29 11:16:52,152 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 25 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2025-04-29 11:16:52,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 164 flow [2025-04-29 11:16:52,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-04-29 11:16:52,153 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6610169491525424 [2025-04-29 11:16:52,153 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 114 flow. Second operand 3 states and 117 transitions. [2025-04-29 11:16:52,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 164 flow [2025-04-29 11:16:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:52,155 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 110 flow [2025-04-29 11:16:52,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2025-04-29 11:16:52,156 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2025-04-29 11:16:52,157 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 110 flow [2025-04-29 11:16:52,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-29 11:16:52,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:52,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:16:52,157 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:52,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -437152565, now seen corresponding path program 1 times [2025-04-29 11:16:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610704549] [2025-04-29 11:16:52,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:16:52,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:16:52,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,243 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-29 11:16:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610704549] [2025-04-29 11:16:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610704549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032154317] [2025-04-29 11:16:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:52,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-04-29 11:16:52,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 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-29 11:16:52,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:52,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-04-29 11:16:52,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:52,420 INFO L116 PetriNetUnfolderBase]: 186/475 cut-off events. [2025-04-29 11:16:52,421 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:52,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 475 events. 186/475 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2624 event pairs, 41 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 808. Up to 223 conditions per place. [2025-04-29 11:16:52,423 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 37 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-04-29 11:16:52,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 212 flow [2025-04-29 11:16:52,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-04-29 11:16:52,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5898305084745763 [2025-04-29 11:16:52,425 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 110 flow. Second operand 5 states and 174 transitions. [2025-04-29 11:16:52,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 212 flow [2025-04-29 11:16:52,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:52,427 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 111 flow [2025-04-29 11:16:52,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-04-29 11:16:52,427 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2025-04-29 11:16:52,427 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 111 flow [2025-04-29 11:16:52,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 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-29 11:16:52,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:52,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:16:52,428 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:52,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash -437152564, now seen corresponding path program 1 times [2025-04-29 11:16:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294398234] [2025-04-29 11:16:52,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:16:52,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:16:52,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,559 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-29 11:16:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294398234] [2025-04-29 11:16:52,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294398234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078954864] [2025-04-29 11:16:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:52,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:52,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-04-29 11:16:52,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 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-29 11:16:52,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:52,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-04-29 11:16:52,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:52,781 INFO L116 PetriNetUnfolderBase]: 186/436 cut-off events. [2025-04-29 11:16:52,781 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-29 11:16:52,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 436 events. 186/436 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2251 event pairs, 41 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 797. Up to 223 conditions per place. [2025-04-29 11:16:52,783 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 37 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-04-29 11:16:52,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 213 flow [2025-04-29 11:16:52,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-04-29 11:16:52,785 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5898305084745763 [2025-04-29 11:16:52,785 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 111 flow. Second operand 5 states and 174 transitions. [2025-04-29 11:16:52,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 213 flow [2025-04-29 11:16:52,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 205 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:52,786 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 105 flow [2025-04-29 11:16:52,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-04-29 11:16:52,787 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2025-04-29 11:16:52,787 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 105 flow [2025-04-29 11:16:52,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 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-29 11:16:52,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:52,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:52,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:16:52,787 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:52,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash -394808905, now seen corresponding path program 1 times [2025-04-29 11:16:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:52,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721994327] [2025-04-29 11:16:52,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:52,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:16:52,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:16:52,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:52,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721994327] [2025-04-29 11:16:52,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721994327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:52,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478644050] [2025-04-29 11:16:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:52,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:52,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:52,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:52,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-04-29 11:16:52,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-29 11:16:52,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:52,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-04-29 11:16:52,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:53,007 INFO L116 PetriNetUnfolderBase]: 172/408 cut-off events. [2025-04-29 11:16:53,007 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-29 11:16:53,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 408 events. 172/408 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1969 event pairs, 8 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 750. Up to 279 conditions per place. [2025-04-29 11:16:53,008 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 34 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-04-29 11:16:53,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 193 flow [2025-04-29 11:16:53,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2025-04-29 11:16:53,009 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5389830508474577 [2025-04-29 11:16:53,009 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 105 flow. Second operand 5 states and 159 transitions. [2025-04-29 11:16:53,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 193 flow [2025-04-29 11:16:53,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:53,010 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 93 flow [2025-04-29 11:16:53,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-04-29 11:16:53,011 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -12 predicate places. [2025-04-29 11:16:53,011 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 93 flow [2025-04-29 11:16:53,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-29 11:16:53,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:53,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:53,011 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (and 31 more)] === [2025-04-29 11:16:53,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -394808904, now seen corresponding path program 1 times [2025-04-29 11:16:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:53,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619937274] [2025-04-29 11:16:53,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:53,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:16:53,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:16:53,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:53,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619937274] [2025-04-29 11:16:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619937274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947327046] [2025-04-29 11:16:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:53,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:53,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:53,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-04-29 11:16:53,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-29 11:16:53,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:53,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-04-29 11:16:53,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:53,308 INFO L116 PetriNetUnfolderBase]: 172/348 cut-off events. [2025-04-29 11:16:53,309 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-29 11:16:53,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 348 events. 172/348 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1399 event pairs, 8 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 689. Up to 279 conditions per place. [2025-04-29 11:16:53,310 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2025-04-29 11:16:53,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 177 flow [2025-04-29 11:16:53,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2025-04-29 11:16:53,311 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5389830508474577 [2025-04-29 11:16:53,311 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 93 flow. Second operand 5 states and 159 transitions. [2025-04-29 11:16:53,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 177 flow [2025-04-29 11:16:53,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 169 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:53,312 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-04-29 11:16:53,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2025-04-29 11:16:53,312 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -18 predicate places. [2025-04-29 11:16:53,312 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-04-29 11:16:53,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-29 11:16:53,314 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (31 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 34 remaining) [2025-04-29 11:16:53,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 34 remaining) [2025-04-29 11:16:53,316 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 34 remaining) [2025-04-29 11:16:53,317 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 34 remaining) [2025-04-29 11:16:53,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:53,317 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:53,321 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:16:53,321 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:16:53,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:16:53 BasicIcfg [2025-04-29 11:16:53,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:16:53,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:16:53,332 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:16:53,332 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:16:53,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:51" (3/4) ... [2025-04-29 11:16:53,333 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:16:53,335 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure worker [2025-04-29 11:16:53,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-04-29 11:16:53,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-04-29 11:16:53,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:16:53,338 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:16:53,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:16:53,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:16:53,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:16:53,383 INFO L158 Benchmark]: Toolchain (without parser) took 2880.75ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 89.3MB in the end (delta: 23.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2025-04-29 11:16:53,383 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:53,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.57ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:16:53,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.93ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:16:53,384 INFO L158 Benchmark]: Boogie Preprocessor took 43.45ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:53,384 INFO L158 Benchmark]: RCFGBuilder took 414.78ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 64.3MB in the end (delta: 29.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:16:53,384 INFO L158 Benchmark]: TraceAbstraction took 2106.16ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 94.4MB in the end (delta: -31.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-04-29 11:16:53,384 INFO L158 Benchmark]: Witness Printer took 51.11ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 89.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:16:53,385 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.57ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.93ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.45ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 414.78ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 64.3MB in the end (delta: 29.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2106.16ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 94.4MB in the end (delta: -31.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 51.11ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 89.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 65]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 85 locations, 93 edges, 34 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1017 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 52 mSDtfsCounter, 1017 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:16:53,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE