./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:25,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:25,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:25,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:25,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:25,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:25,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:25,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:25,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:25,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:25,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:25,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:25,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:25,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:25,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:25,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:25,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:25,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:25,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:25,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:25,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:25,288 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-04-30 10:35:25,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:25,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:25,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:25,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:25,528 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:25,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2025-04-30 10:35:26,835 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfe8868c/e78b8d098bd04bd7bea53b9b962050d1/FLAG1447955f5 [2025-04-30 10:35:27,129 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:27,130 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2025-04-30 10:35:27,143 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfe8868c/e78b8d098bd04bd7bea53b9b962050d1/FLAG1447955f5 [2025-04-30 10:35:27,885 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cfe8868c/e78b8d098bd04bd7bea53b9b962050d1 [2025-04-30 10:35:27,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:27,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:27,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:27,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:27,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:27,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:27" (1/1) ... [2025-04-30 10:35:27,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3afb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:27, skipping insertion in model container [2025-04-30 10:35:27,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:27" (1/1) ... [2025-04-30 10:35:27,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:28,322 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:28,339 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:28,406 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:28,464 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:28,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28 WrapperNode [2025-04-30 10:35:28,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:28,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:28,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:28,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:28,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,512 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-04-30 10:35:28,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:28,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:28,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:28,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:28,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,539 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [5, 12]. 71 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0]. The 9 writes are split as follows [0, 9]. [2025-04-30 10:35:28,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:28,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:28,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:28,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:28,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (1/1) ... [2025-04-30 10:35:28,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:28,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:35:28,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:35:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:28,609 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:28,728 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:28,729 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:28,961 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:28,961 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:29,128 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:29,129 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:29,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:29 BoogieIcfgContainer [2025-04-30 10:35:29,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:29,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:29,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:29,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:29,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:27" (1/3) ... [2025-04-30 10:35:29,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d7a702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:29, skipping insertion in model container [2025-04-30 10:35:29,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:28" (2/3) ... [2025-04-30 10:35:29,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d7a702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:29, skipping insertion in model container [2025-04-30 10:35:29,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:29" (3/3) ... [2025-04-30 10:35:29,137 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-04-30 10:35:29,147 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:29,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 52 locations, 50 edges, 1 initial locations, 0 loop locations, and 25 error locations. [2025-04-30 10:35:29,148 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:29,192 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:29,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-04-30 10:35:29,243 INFO L116 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-04-30 10:35:29,245 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:29,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-30 10:35:29,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-04-30 10:35:29,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-04-30 10:35:29,258 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:29,271 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;@6e2e936e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:29,271 INFO L341 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-04-30 10:35:29,274 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:29,275 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-30 10:35:29,275 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:29,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:29,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:29,276 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:29,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash 11213, now seen corresponding path program 1 times [2025-04-30 10:35:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:29,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494661622] [2025-04-30 10:35:29,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:29,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:29,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:29,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:29,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494661622] [2025-04-30 10:35:29,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494661622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:29,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799253410] [2025-04-30 10:35:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:29,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:29,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:29,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:29,673 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-04-30 10:35:29,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:29,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:29,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-04-30 10:35:29,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:29,767 INFO L116 PetriNetUnfolderBase]: 42/177 cut-off events. [2025-04-30 10:35:29,768 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:29,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 177 events. 42/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 778 event pairs, 42 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 261. Up to 101 conditions per place. [2025-04-30 10:35:29,772 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-30 10:35:29,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-04-30 10:35:29,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-30 10:35:29,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-04-30 10:35:29,784 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-04-30 10:35:29,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-04-30 10:35:29,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:29,791 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-04-30 10:35:29,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-04-30 10:35:29,796 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-30 10:35:29,797 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-04-30 10:35:29,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:29,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:29,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:29,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:29,797 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:29,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash 11214, now seen corresponding path program 1 times [2025-04-30 10:35:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:29,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952379758] [2025-04-30 10:35:29,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:29,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:29,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:29,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:29,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:29,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952379758] [2025-04-30 10:35:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952379758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:29,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181294674] [2025-04-30 10:35:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:29,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:30,002 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-30 10:35:30,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:30,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-30 10:35:30,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:30,067 INFO L116 PetriNetUnfolderBase]: 42/173 cut-off events. [2025-04-30 10:35:30,067 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:30,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 173 events. 42/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 777 event pairs, 42 based on Foata normal form. 3/139 useless extension candidates. Maximal degree in co-relation 269. Up to 101 conditions per place. [2025-04-30 10:35:30,073 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-04-30 10:35:30,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-04-30 10:35:30,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-30 10:35:30,075 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-30 10:35:30,075 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-04-30 10:35:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-04-30 10:35:30,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:30,076 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-04-30 10:35:30,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-30 10:35:30,076 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-04-30 10:35:30,076 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-04-30 10:35:30,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:30,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:35:30,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:35:30,077 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:30,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1774899415, now seen corresponding path program 1 times [2025-04-30 10:35:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:30,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813447220] [2025-04-30 10:35:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:30,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:35:30,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:35:30,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:30,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:30,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813447220] [2025-04-30 10:35:30,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813447220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:30,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:30,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:30,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628877066] [2025-04-30 10:35:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:30,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:30,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:30,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:30,297 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-04-30 10:35:30,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:30,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-04-30 10:35:30,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:30,370 INFO L116 PetriNetUnfolderBase]: 49/180 cut-off events. [2025-04-30 10:35:30,370 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:30,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 180 events. 49/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 756 event pairs, 49 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 291. Up to 115 conditions per place. [2025-04-30 10:35:30,371 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 19 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-04-30 10:35:30,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 124 flow [2025-04-30 10:35:30,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-30 10:35:30,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-04-30 10:35:30,374 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-04-30 10:35:30,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 124 flow [2025-04-30 10:35:30,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:30,375 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 82 flow [2025-04-30 10:35:30,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-04-30 10:35:30,376 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-04-30 10:35:30,376 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 82 flow [2025-04-30 10:35:30,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:30,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:35:30,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:30,376 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:30,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1774899416, now seen corresponding path program 1 times [2025-04-30 10:35:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:30,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006996367] [2025-04-30 10:35:30,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:30,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:35:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:35:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:30,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:30,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006996367] [2025-04-30 10:35:30,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006996367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:30,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:30,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761722350] [2025-04-30 10:35:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:30,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:35:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:30,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:35:30,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:35:30,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-30 10:35:30,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:30,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-30 10:35:30,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:30,641 INFO L116 PetriNetUnfolderBase]: 42/149 cut-off events. [2025-04-30 10:35:30,641 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:30,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 149 events. 42/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 583 event pairs, 42 based on Foata normal form. 8/136 useless extension candidates. Maximal degree in co-relation 245. Up to 100 conditions per place. [2025-04-30 10:35:30,643 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-04-30 10:35:30,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 110 flow [2025-04-30 10:35:30,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-04-30 10:35:30,644 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-30 10:35:30,644 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 4 states and 138 transitions. [2025-04-30 10:35:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 110 flow [2025-04-30 10:35:30,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:30,645 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 75 flow [2025-04-30 10:35:30,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-04-30 10:35:30,645 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2025-04-30 10:35:30,645 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 75 flow [2025-04-30 10:35:30,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:30,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:30,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:35:30,646 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:30,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 686521503, now seen corresponding path program 1 times [2025-04-30 10:35:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:30,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539987126] [2025-04-30 10:35:30,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:30,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:35:30,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:35:30,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:30,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:30,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539987126] [2025-04-30 10:35:30,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539987126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:30,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:30,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430901575] [2025-04-30 10:35:30,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:30,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:30,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:30,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:30,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-04-30 10:35:30,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:30,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-04-30 10:35:30,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:30,808 INFO L116 PetriNetUnfolderBase]: 49/160 cut-off events. [2025-04-30 10:35:30,808 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:30,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 160 events. 49/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 613 event pairs, 31 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 271. Up to 88 conditions per place. [2025-04-30 10:35:30,812 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-04-30 10:35:30,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 137 flow [2025-04-30 10:35:30,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-04-30 10:35:30,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-04-30 10:35:30,815 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 75 flow. Second operand 3 states and 118 transitions. [2025-04-30 10:35:30,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 137 flow [2025-04-30 10:35:30,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:30,816 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-04-30 10:35:30,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-04-30 10:35:30,816 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-04-30 10:35:30,816 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-04-30 10:35:30,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:30,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:30,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:30,817 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:30,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash 686521504, now seen corresponding path program 1 times [2025-04-30 10:35:30,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:30,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219176865] [2025-04-30 10:35:30,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:30,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:35:30,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:35:30,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:30,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:30,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219176865] [2025-04-30 10:35:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219176865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:30,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597762643] [2025-04-30 10:35:30,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:30,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:30,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:30,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:30,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:30,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-04-30 10:35:30,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:30,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-04-30 10:35:30,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:30,995 INFO L116 PetriNetUnfolderBase]: 42/139 cut-off events. [2025-04-30 10:35:30,995 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:35:30,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 139 events. 42/139 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 514 event pairs, 26 based on Foata normal form. 16/142 useless extension candidates. Maximal degree in co-relation 251. Up to 88 conditions per place. [2025-04-30 10:35:30,996 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-04-30 10:35:30,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-04-30 10:35:30,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-04-30 10:35:30,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-04-30 10:35:30,997 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-04-30 10:35:30,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-04-30 10:35:30,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:30,998 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-04-30 10:35:30,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-04-30 10:35:30,998 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-04-30 10:35:30,998 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-04-30 10:35:30,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:30,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:30,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:30,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:35:30,999 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:30,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash -511232776, now seen corresponding path program 1 times [2025-04-30 10:35:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:30,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136852417] [2025-04-30 10:35:30,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:31,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:35:31,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:35:31,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:31,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:31,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136852417] [2025-04-30 10:35:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136852417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263892378] [2025-04-30 10:35:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:31,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:31,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:31,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:31,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-04-30 10:35:31,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:31,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:31,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-04-30 10:35:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:31,414 INFO L116 PetriNetUnfolderBase]: 77/214 cut-off events. [2025-04-30 10:35:31,414 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-30 10:35:31,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 214 events. 77/214 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 836 event pairs, 6 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 403. Up to 107 conditions per place. [2025-04-30 10:35:31,415 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 32 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2025-04-30 10:35:31,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 188 flow [2025-04-30 10:35:31,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:35:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:35:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-30 10:35:31,416 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5915032679738562 [2025-04-30 10:35:31,416 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 6 states and 181 transitions. [2025-04-30 10:35:31,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 188 flow [2025-04-30 10:35:31,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:31,419 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 112 flow [2025-04-30 10:35:31,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-04-30 10:35:31,420 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-04-30 10:35:31,420 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 112 flow [2025-04-30 10:35:31,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:31,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:31,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:31,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:35:31,420 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:31,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash -511232775, now seen corresponding path program 1 times [2025-04-30 10:35:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:31,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741787645] [2025-04-30 10:35:31,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:31,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:35:31,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:35:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:31,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741787645] [2025-04-30 10:35:31,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741787645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:31,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292558966] [2025-04-30 10:35:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:31,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:35:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:31,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:35:31,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:35:31,722 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-04-30 10:35:31,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:31,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:31,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-04-30 10:35:31,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:31,823 INFO L116 PetriNetUnfolderBase]: 98/265 cut-off events. [2025-04-30 10:35:31,823 INFO L117 PetriNetUnfolderBase]: For 82/84 co-relation queries the response was YES. [2025-04-30 10:35:31,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 265 events. 98/265 cut-off events. For 82/84 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1142 event pairs, 6 based on Foata normal form. 12/270 useless extension candidates. Maximal degree in co-relation 594. Up to 101 conditions per place. [2025-04-30 10:35:31,825 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 37 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-04-30 10:35:31,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 238 flow [2025-04-30 10:35:31,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-04-30 10:35:31,826 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7098039215686275 [2025-04-30 10:35:31,826 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 112 flow. Second operand 5 states and 181 transitions. [2025-04-30 10:35:31,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 238 flow [2025-04-30 10:35:31,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:31,827 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 144 flow [2025-04-30 10:35:31,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-04-30 10:35:31,828 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-04-30 10:35:31,828 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 144 flow [2025-04-30 10:35:31,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:31,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:31,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:31,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:35:31,828 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:31,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash -281142214, now seen corresponding path program 1 times [2025-04-30 10:35:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:31,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715300710] [2025-04-30 10:35:31,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:31,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:35:31,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:35:31,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:31,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:32,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:32,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715300710] [2025-04-30 10:35:32,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715300710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:32,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:32,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:35:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482934346] [2025-04-30 10:35:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:32,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:35:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:32,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:35:32,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:35:32,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-30 10:35:32,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 144 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:32,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:32,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-30 10:35:32,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:32,622 INFO L116 PetriNetUnfolderBase]: 106/293 cut-off events. [2025-04-30 10:35:32,623 INFO L117 PetriNetUnfolderBase]: For 248/254 co-relation queries the response was YES. [2025-04-30 10:35:32,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 293 events. 106/293 cut-off events. For 248/254 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1310 event pairs, 19 based on Foata normal form. 8/289 useless extension candidates. Maximal degree in co-relation 725. Up to 77 conditions per place. [2025-04-30 10:35:32,624 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 42 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2025-04-30 10:35:32,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 400 flow [2025-04-30 10:35:32,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:35:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:35:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-04-30 10:35:32,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-30 10:35:32,625 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 144 flow. Second operand 9 states and 207 transitions. [2025-04-30 10:35:32,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 400 flow [2025-04-30 10:35:32,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:35:32,628 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 261 flow [2025-04-30 10:35:32,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-04-30 10:35:32,630 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-04-30 10:35:32,630 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 261 flow [2025-04-30 10:35:32,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:32,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:32,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:32,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:35:32,630 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:32,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1666337225, now seen corresponding path program 1 times [2025-04-30 10:35:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:32,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371002361] [2025-04-30 10:35:32,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:35:32,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:35:32,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:32,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371002361] [2025-04-30 10:35:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371002361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:35:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617344538] [2025-04-30 10:35:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:32,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:35:32,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:32,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:35:32,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:35:33,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-04-30 10:35:33,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 261 flow. Second operand has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 11 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:33,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:33,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-04-30 10:35:33,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:33,286 INFO L116 PetriNetUnfolderBase]: 106/292 cut-off events. [2025-04-30 10:35:33,286 INFO L117 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-04-30 10:35:33,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 292 events. 106/292 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1293 event pairs, 19 based on Foata normal form. 8/288 useless extension candidates. Maximal degree in co-relation 829. Up to 77 conditions per place. [2025-04-30 10:35:33,288 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 43 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2025-04-30 10:35:33,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 465 flow [2025-04-30 10:35:33,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:35:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:35:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2025-04-30 10:35:33,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44509803921568625 [2025-04-30 10:35:33,291 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 261 flow. Second operand 10 states and 227 transitions. [2025-04-30 10:35:33,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 465 flow [2025-04-30 10:35:33,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:33,294 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 338 flow [2025-04-30 10:35:33,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=338, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-04-30 10:35:33,299 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-04-30 10:35:33,299 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 338 flow [2025-04-30 10:35:33,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.181818181818183) internal successors, (200), 11 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:33,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:33,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:35:33,299 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:33,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash -181198757, now seen corresponding path program 1 times [2025-04-30 10:35:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447010059] [2025-04-30 10:35:33,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:33,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:35:33,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:35:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:33,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:33,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:35:33,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:35:33,351 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:35:33,352 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-04-30 10:35:33,353 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-04-30 10:35:33,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-04-30 10:35:33,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:35:33,355 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:33,391 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:35:33,391 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:35:33,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:35:33 BasicIcfg [2025-04-30 10:35:33,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:35:33,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:35:33,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:35:33,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:35:33,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:29" (3/4) ... [2025-04-30 10:35:33,397 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:35:33,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:35:33,398 INFO L158 Benchmark]: Toolchain (without parser) took 5509.97ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 130.8MB in the beginning and 77.1MB in the end (delta: 53.7MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2025-04-30 10:35:33,398 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:33,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.86ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 89.7MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:35:33,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.30ms. Allocated memory is still 167.8MB. Free memory was 89.7MB in the beginning and 86.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:33,399 INFO L158 Benchmark]: Boogie Preprocessor took 42.74ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 84.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:35:33,399 INFO L158 Benchmark]: RCFGBuilder took 572.75ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 114.5MB in the end (delta: -30.5MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2025-04-30 10:35:33,399 INFO L158 Benchmark]: TraceAbstraction took 4264.18ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 114.5MB in the beginning and 77.1MB in the end (delta: 37.4MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2025-04-30 10:35:33,399 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 201.3MB. Free memory was 77.1MB in the beginning and 77.1MB in the end (delta: 39.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:33,400 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.30ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.86ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 89.7MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.30ms. Allocated memory is still 167.8MB. Free memory was 89.7MB in the beginning and 86.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.74ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 84.0MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 572.75ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 114.5MB in the end (delta: -30.5MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4264.18ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 114.5MB in the beginning and 77.1MB in the end (delta: 37.4MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 201.3MB. Free memory was 77.1MB in the beginning and 77.1MB in the end (delta: 39.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1244. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, p={-2:0}, t1=-1] [L1253] EXPR 0 A->next [L1253] 0 p = A->next [L1254] 0 p->datum [L1256] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, \result=0, p={-2:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 72 edges, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1182 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2069 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 5 mSDtfsCounter, 2069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=10, InterpolantAutomatonStates: 50, 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, 1.7s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:35:33,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:35,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:35,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-30 10:35:35,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:35,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:35,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:35,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:35,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:35,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:35,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:35,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:35,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:35,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:35,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:35,389 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:35,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:35,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:35,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:35,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:35,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:35,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:35,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:35,391 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-04-30 10:35:35,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:35,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:35,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:35,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:35,637 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:35,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2025-04-30 10:35:36,947 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2dfc972f/346df257d66549d6981b60c8e7c0f5ce/FLAG5170f9287 [2025-04-30 10:35:37,233 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:37,233 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_02-list_nr.i [2025-04-30 10:35:37,251 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2dfc972f/346df257d66549d6981b60c8e7c0f5ce/FLAG5170f9287 [2025-04-30 10:35:37,998 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2dfc972f/346df257d66549d6981b60c8e7c0f5ce [2025-04-30 10:35:38,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:38,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:38,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:38,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:38,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:38,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:37" (1/1) ... [2025-04-30 10:35:38,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e1e944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38, skipping insertion in model container [2025-04-30 10:35:38,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:37" (1/1) ... [2025-04-30 10:35:38,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:38,448 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:38,467 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:38,549 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:38,626 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:38,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38 WrapperNode [2025-04-30 10:35:38,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:38,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:38,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:38,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:38,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,681 INFO L138 Inliner]: procedures = 369, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-04-30 10:35:38,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:38,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:38,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:38,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:38,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,714 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [5, 12]. 71 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0]. The 9 writes are split as follows [0, 9]. [2025-04-30 10:35:38,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:38,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:38,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:38,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:38,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (1/1) ... [2025-04-30 10:35:38,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:38,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:35:38,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:38,782 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:38,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:38,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:38,783 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:38,917 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:38,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:39,189 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:39,189 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:39,384 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:39,385 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:39,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:39 BoogieIcfgContainer [2025-04-30 10:35:39,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:39,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:39,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:39,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:39,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:37" (1/3) ... [2025-04-30 10:35:39,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c646e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:39, skipping insertion in model container [2025-04-30 10:35:39,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:38" (2/3) ... [2025-04-30 10:35:39,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c646e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:39, skipping insertion in model container [2025-04-30 10:35:39,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:39" (3/3) ... [2025-04-30 10:35:39,394 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-04-30 10:35:39,403 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:39,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 52 locations, 50 edges, 1 initial locations, 0 loop locations, and 25 error locations. [2025-04-30 10:35:39,404 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:39,451 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:39,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-04-30 10:35:39,501 INFO L116 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-04-30 10:35:39,516 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:39,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-30 10:35:39,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-04-30 10:35:39,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-04-30 10:35:39,531 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:39,541 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;@1d54abc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:39,541 INFO L341 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-04-30 10:35:39,547 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:39,547 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-30 10:35:39,547 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:39,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:39,548 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:39,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 11277, now seen corresponding path program 1 times [2025-04-30 10:35:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:39,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765657212] [2025-04-30 10:35:39,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:39,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:39,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:35:39,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:39,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:39,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:35:39,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:39,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:35:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:39,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:39,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:39,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765657212] [2025-04-30 10:35:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765657212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:39,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547412138] [2025-04-30 10:35:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:39,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:39,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:39,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:39,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-04-30 10:35:39,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:39,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:39,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-04-30 10:35:39,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,976 INFO L116 PetriNetUnfolderBase]: 42/177 cut-off events. [2025-04-30 10:35:39,976 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:39,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 177 events. 42/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 778 event pairs, 42 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 261. Up to 101 conditions per place. [2025-04-30 10:35:39,979 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-30 10:35:39,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-04-30 10:35:39,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-30 10:35:39,989 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-04-30 10:35:39,990 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-04-30 10:35:39,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-04-30 10:35:39,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:39,997 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-04-30 10:35:40,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-04-30 10:35:40,002 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-30 10:35:40,002 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-04-30 10:35:40,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:40,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:40,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:35:40,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:40,208 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:40,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 11278, now seen corresponding path program 1 times [2025-04-30 10:35:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:40,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528554197] [2025-04-30 10:35:40,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:40,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:40,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:40,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:40,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:35:40,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:40,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:40,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:40,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:40,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:35:40,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:40,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:40,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:40,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:40,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528554197] [2025-04-30 10:35:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528554197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:40,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:40,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278818924] [2025-04-30 10:35:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:40,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:40,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:40,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:40,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-30 10:35:40,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:40,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-30 10:35:40,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:40,522 INFO L116 PetriNetUnfolderBase]: 42/173 cut-off events. [2025-04-30 10:35:40,522 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:40,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 173 events. 42/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 777 event pairs, 42 based on Foata normal form. 3/139 useless extension candidates. Maximal degree in co-relation 269. Up to 101 conditions per place. [2025-04-30 10:35:40,523 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-04-30 10:35:40,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-04-30 10:35:40,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-30 10:35:40,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-30 10:35:40,528 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-04-30 10:35:40,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-04-30 10:35:40,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:40,529 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-04-30 10:35:40,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-30 10:35:40,530 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-04-30 10:35:40,530 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-04-30 10:35:40,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:40,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:35:40,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:35:40,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:40,731 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:40,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:40,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1834066327, now seen corresponding path program 1 times [2025-04-30 10:35:40,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:40,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168577946] [2025-04-30 10:35:40,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:40,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:40,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:40,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:40,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:35:40,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:35:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:35:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:40,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:35:40,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:40,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:35:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:40,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:40,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:40,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168577946] [2025-04-30 10:35:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168577946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:40,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756849370] [2025-04-30 10:35:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:40,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:40,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:40,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:40,914 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2025-04-30 10:35:40,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:40,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2025-04-30 10:35:40,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,008 INFO L116 PetriNetUnfolderBase]: 49/180 cut-off events. [2025-04-30 10:35:41,009 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:41,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 180 events. 49/180 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 755 event pairs, 49 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 291. Up to 116 conditions per place. [2025-04-30 10:35:41,010 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-04-30 10:35:41,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 120 flow [2025-04-30 10:35:41,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-04-30 10:35:41,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2025-04-30 10:35:41,011 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 107 transitions. [2025-04-30 10:35:41,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 120 flow [2025-04-30 10:35:41,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:41,012 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 80 flow [2025-04-30 10:35:41,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-04-30 10:35:41,012 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-04-30 10:35:41,012 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 80 flow [2025-04-30 10:35:41,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:35:41,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:41,213 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:41,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1834066328, now seen corresponding path program 1 times [2025-04-30 10:35:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:41,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391092313] [2025-04-30 10:35:41,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:41,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:41,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:41,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:35:41,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:35:41,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:35:41,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:35:41,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:41,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:41,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:41,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:41,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391092313] [2025-04-30 10:35:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391092313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086772838] [2025-04-30 10:35:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:41,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:41,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:41,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:41,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-04-30 10:35:41,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:41,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-04-30 10:35:41,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,501 INFO L116 PetriNetUnfolderBase]: 42/149 cut-off events. [2025-04-30 10:35:41,501 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:41,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 149 events. 42/149 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 583 event pairs, 42 based on Foata normal form. 8/136 useless extension candidates. Maximal degree in co-relation 248. Up to 101 conditions per place. [2025-04-30 10:35:41,502 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-04-30 10:35:41,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 108 flow [2025-04-30 10:35:41,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-04-30 10:35:41,503 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-04-30 10:35:41,503 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 80 flow. Second operand 3 states and 109 transitions. [2025-04-30 10:35:41,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 108 flow [2025-04-30 10:35:41,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:41,504 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-04-30 10:35:41,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-04-30 10:35:41,504 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-04-30 10:35:41,504 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-04-30 10:35:41,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:41,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:41,705 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:41,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1903559775, now seen corresponding path program 1 times [2025-04-30 10:35:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:41,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103936640] [2025-04-30 10:35:41,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:41,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:41,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:41,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:35:41,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:35:41,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:35:41,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:35:41,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:41,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:35:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:41,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:41,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:41,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103936640] [2025-04-30 10:35:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103936640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:41,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690388592] [2025-04-30 10:35:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:41,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:41,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:41,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:41,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-04-30 10:35:41,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:41,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-04-30 10:35:41,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,962 INFO L116 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-04-30 10:35:41,962 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:41,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 166 events. 49/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 675 event pairs, 35 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 280. Up to 88 conditions per place. [2025-04-30 10:35:41,963 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-04-30 10:35:41,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-04-30 10:35:41,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-04-30 10:35:41,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-04-30 10:35:41,965 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-04-30 10:35:41,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-04-30 10:35:41,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:41,965 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-04-30 10:35:41,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-04-30 10:35:41,966 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-04-30 10:35:41,966 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-04-30 10:35:41,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:35:42,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:42,167 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:42,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:42,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1903559774, now seen corresponding path program 1 times [2025-04-30 10:35:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:42,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366126622] [2025-04-30 10:35:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:42,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:42,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:35:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:35:42,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:35:42,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:42,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:35:42,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:42,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:42,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:42,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:42,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366126622] [2025-04-30 10:35:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366126622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588987743] [2025-04-30 10:35:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:42,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:42,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:42,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-04-30 10:35:42,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:42,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:42,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-04-30 10:35:42,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:42,457 INFO L116 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-04-30 10:35:42,457 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:35:42,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 143 events. 42/143 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 540 event pairs, 35 based on Foata normal form. 16/146 useless extension candidates. Maximal degree in co-relation 258. Up to 88 conditions per place. [2025-04-30 10:35:42,458 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-04-30 10:35:42,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-04-30 10:35:42,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-04-30 10:35:42,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-04-30 10:35:42,459 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-04-30 10:35:42,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-04-30 10:35:42,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:42,460 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-04-30 10:35:42,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-04-30 10:35:42,460 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-04-30 10:35:42,460 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-04-30 10:35:42,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:42,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:42,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:42,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:35:42,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:42,661 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:42,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1759856248, now seen corresponding path program 1 times [2025-04-30 10:35:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:42,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819611185] [2025-04-30 10:35:42,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:42,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:42,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:42,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:35:42,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:35:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:35:42,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:42,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:42,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:35:42,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:42,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:35:42,825 INFO L325 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-04-30 10:35:42,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-04-30 10:35:42,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:35:42,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:35:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:42,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:42,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:42,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819611185] [2025-04-30 10:35:42,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819611185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:42,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493486297] [2025-04-30 10:35:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:42,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:42,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:42,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:43,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-04-30 10:35:43,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:43,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:43,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-04-30 10:35:43,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:43,326 INFO L116 PetriNetUnfolderBase]: 98/267 cut-off events. [2025-04-30 10:35:43,326 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-30 10:35:43,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 267 events. 98/267 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1169 event pairs, 6 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 508. Up to 103 conditions per place. [2025-04-30 10:35:43,327 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 38 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2025-04-30 10:35:43,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 230 flow [2025-04-30 10:35:43,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-04-30 10:35:43,330 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5994397759103641 [2025-04-30 10:35:43,330 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 7 states and 214 transitions. [2025-04-30 10:35:43,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 230 flow [2025-04-30 10:35:43,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:43,334 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 138 flow [2025-04-30 10:35:43,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2025-04-30 10:35:43,334 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-04-30 10:35:43,334 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 138 flow [2025-04-30 10:35:43,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:43,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:43,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:43,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:43,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:43,536 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:43,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1759856249, now seen corresponding path program 1 times [2025-04-30 10:35:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:43,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53995975] [2025-04-30 10:35:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:43,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:43,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:35:43,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:35:43,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:35:43,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:43,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:43,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:35:43,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:43,674 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:43,724 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:35:43,724 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:35:43,739 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:35:43,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-30 10:35:43,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:35:43,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:35:43,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-30 10:35:43,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:35:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:43,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:43,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:43,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53995975] [2025-04-30 10:35:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53995975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:43,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:43,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600343711] [2025-04-30 10:35:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:43,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:43,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:43,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:44,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-04-30 10:35:44,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:44,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:44,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-04-30 10:35:44,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:44,631 INFO L116 PetriNetUnfolderBase]: 117/305 cut-off events. [2025-04-30 10:35:44,631 INFO L117 PetriNetUnfolderBase]: For 122/124 co-relation queries the response was YES. [2025-04-30 10:35:44,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 305 events. 117/305 cut-off events. For 122/124 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1376 event pairs, 15 based on Foata normal form. 12/307 useless extension candidates. Maximal degree in co-relation 728. Up to 142 conditions per place. [2025-04-30 10:35:44,633 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 45 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2025-04-30 10:35:44,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 320 flow [2025-04-30 10:35:44,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2025-04-30 10:35:44,640 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-04-30 10:35:44,640 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 138 flow. Second operand 8 states and 232 transitions. [2025-04-30 10:35:44,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 320 flow [2025-04-30 10:35:44,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:44,641 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 193 flow [2025-04-30 10:35:44,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-04-30 10:35:44,642 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-04-30 10:35:44,642 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 193 flow [2025-04-30 10:35:44,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:44,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:44,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:44,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:35:44,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:44,844 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:44,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash 392023546, now seen corresponding path program 1 times [2025-04-30 10:35:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:44,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686123086] [2025-04-30 10:35:44,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:44,847 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:44,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:35:44,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:35:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:35:44,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:44,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:44,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:35:44,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:44,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:35:44,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:35:45,019 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:35:45,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:35:45,036 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:35:45,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-30 10:35:45,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:35:45,114 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:35:45,171 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:35:45,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-30 10:35:45,188 INFO L325 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-04-30 10:35:45,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-30 10:35:45,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-04-30 10:35:45,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-30 10:35:45,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-30 10:35:45,343 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-30 10:35:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:45,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:45,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:45,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686123086] [2025-04-30 10:35:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686123086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:45,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:35:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778832508] [2025-04-30 10:35:45,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:45,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:35:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:45,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:35:45,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:35:45,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-04-30 10:35:45,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 193 flow. Second operand has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:45,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:45,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-04-30 10:35:45,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:46,446 INFO L116 PetriNetUnfolderBase]: 128/344 cut-off events. [2025-04-30 10:35:46,446 INFO L117 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-04-30 10:35:46,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 344 events. 128/344 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1619 event pairs, 22 based on Foata normal form. 8/340 useless extension candidates. Maximal degree in co-relation 896. Up to 89 conditions per place. [2025-04-30 10:35:46,448 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 43 selfloop transitions, 37 changer transitions 0/85 dead transitions. [2025-04-30 10:35:46,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 548 flow [2025-04-30 10:35:46,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 331 transitions. [2025-04-30 10:35:46,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5408496732026143 [2025-04-30 10:35:46,450 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 193 flow. Second operand 12 states and 331 transitions. [2025-04-30 10:35:46,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 548 flow [2025-04-30 10:35:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 498 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-30 10:35:46,453 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 378 flow [2025-04-30 10:35:46,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=378, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-04-30 10:35:46,453 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-04-30 10:35:46,453 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 378 flow [2025-04-30 10:35:46,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:46,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:46,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:46,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:35:46,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:46,654 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:46,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash -993171465, now seen corresponding path program 1 times [2025-04-30 10:35:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:46,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917920025] [2025-04-30 10:35:46,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:46,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:46,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:46,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:35:46,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:35:46,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:35:46,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:46,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:35:46,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:46,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:35:46,810 INFO L325 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-04-30 10:35:46,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-04-30 10:35:46,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:35:46,917 INFO L325 Elim1Store]: treesize reduction 82, result has 29.9 percent of original size [2025-04-30 10:35:46,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 48 [2025-04-30 10:35:46,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-04-30 10:35:47,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-04-30 10:35:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:47,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:35:47,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:35:47,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917920025] [2025-04-30 10:35:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917920025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:35:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388474180] [2025-04-30 10:35:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:47,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:35:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:35:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:35:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:35:47,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2025-04-30 10:35:47,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 378 flow. Second operand has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 9 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:47,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:47,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2025-04-30 10:35:47,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:48,012 INFO L116 PetriNetUnfolderBase]: 118/319 cut-off events. [2025-04-30 10:35:48,013 INFO L117 PetriNetUnfolderBase]: For 328/330 co-relation queries the response was YES. [2025-04-30 10:35:48,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 319 events. 118/319 cut-off events. For 328/330 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1459 event pairs, 11 based on Foata normal form. 10/318 useless extension candidates. Maximal degree in co-relation 918. Up to 97 conditions per place. [2025-04-30 10:35:48,015 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 51 selfloop transitions, 27 changer transitions 0/84 dead transitions. [2025-04-30 10:35:48,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 580 flow [2025-04-30 10:35:48,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 316 transitions. [2025-04-30 10:35:48,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5163398692810458 [2025-04-30 10:35:48,018 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 378 flow. Second operand 12 states and 316 transitions. [2025-04-30 10:35:48,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 580 flow [2025-04-30 10:35:48,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:48,023 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 458 flow [2025-04-30 10:35:48,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=458, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2025-04-30 10:35:48,024 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2025-04-30 10:35:48,024 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 458 flow [2025-04-30 10:35:48,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 9 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:48,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:48,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:48,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:35:48,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:48,228 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-04-30 10:35:48,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -787896675, now seen corresponding path program 1 times [2025-04-30 10:35:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:35:48,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408692411] [2025-04-30 10:35:48,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:48,230 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:48,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:35:48,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:48,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:48,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:35:48,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:35:48,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:48,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:35:48,976 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-30 10:35:48,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:35:48,979 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-04-30 10:35:48,980 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-04-30 10:35:48,980 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-04-30 10:35:48,980 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-04-30 10:35:48,980 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-04-30 10:35:48,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-04-30 10:35:48,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:49,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:49,182 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:49,212 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:35:49,212 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:35:49,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:35:49 BasicIcfg [2025-04-30 10:35:49,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:35:49,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:35:49,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:35:49,226 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:35:49,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:39" (3/4) ... [2025-04-30 10:35:49,228 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:35:49,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:35:49,229 INFO L158 Benchmark]: Toolchain (without parser) took 11228.33ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 81.7MB in the beginning and 97.3MB in the end (delta: -15.6MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-04-30 10:35:49,230 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:49,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.48ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 39.4MB in the end (delta: 42.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:35:49,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.28ms. Allocated memory is still 109.1MB. Free memory was 39.4MB in the beginning and 80.6MB in the end (delta: -41.2MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-04-30 10:35:49,231 INFO L158 Benchmark]: Boogie Preprocessor took 60.80ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 77.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:49,231 INFO L158 Benchmark]: RCFGBuilder took 641.95ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 52.3MB in the end (delta: 25.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2025-04-30 10:35:49,231 INFO L158 Benchmark]: TraceAbstraction took 9829.97ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 51.6MB in the beginning and 31.6MB in the end (delta: 20.0MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2025-04-30 10:35:49,232 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:49,233 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.48ms. Allocated memory is still 109.1MB. Free memory was 81.5MB in the beginning and 39.4MB in the end (delta: 42.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.28ms. Allocated memory is still 109.1MB. Free memory was 39.4MB in the beginning and 80.6MB in the end (delta: -41.2MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.80ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 77.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 641.95ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 52.3MB in the end (delta: 25.6MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9829.97ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 51.6MB in the beginning and 31.6MB in the end (delta: 20.0MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1244]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1244. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={3:0}, A_mutex={1:0}] [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, A_mutex={1:0}, p={32768:0}, t1=0] [L1253] EXPR 0 A->next [L1253] 0 p = A->next [L1254] 0 p->datum [L1256] 0 return 0; VAL [A={3:0}, A_mutex={1:0}, \result=0, p={32768:0}, t1=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 74 locations, 72 edges, 36 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: 9.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1259 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 875 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2218 IncrementalHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 82 mSDtfsCounter, 2218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=10, InterpolantAutomatonStates: 57, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 76 ConstructedInterpolants, 5 QuantifiedInterpolants, 1177 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1410 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:35:49,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample