./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-10 00:55:23,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:23,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:55:23,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:23,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:23,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:23,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:23,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:23,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:23,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:23,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:23,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:23,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:23,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:23,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:23,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:23,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:23,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:23,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:23,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:23,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:23,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:23,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:23,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:23,303 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-jdk21/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-01-10 00:55:23,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:23,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:23,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:23,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:23,509 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:23,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-01-10 00:55:24,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91acb11e2/2f5a7490fd8541fda4cab5a37953bc47/FLAG012df08aa [2025-01-10 00:55:24,975 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:24,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-01-10 00:55:25,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91acb11e2/2f5a7490fd8541fda4cab5a37953bc47/FLAG012df08aa [2025-01-10 00:55:25,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91acb11e2/2f5a7490fd8541fda4cab5a37953bc47 [2025-01-10 00:55:25,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:25,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:25,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:25,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:25,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:25,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2646df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25, skipping insertion in model container [2025-01-10 00:55:25,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:25,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:25,589 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:25,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:25,669 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:25,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25 WrapperNode [2025-01-10 00:55:25,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:25,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:25,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:25,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:25,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,702 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-10 00:55:25,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:25,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:25,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:25,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:25,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,722 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-01-10 00:55:25,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,728 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:25,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:25,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:25,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:25,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (1/1) ... [2025-01-10 00:55:25,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:25,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:55:25,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:25,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:25,775 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:25,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:25,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:25,777 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:55:25,891 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:25,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:26,150 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:26,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:26,351 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:26,353 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:26,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:26 BoogieIcfgContainer [2025-01-10 00:55:26,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:26,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:26,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:26,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:26,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:25" (1/3) ... [2025-01-10 00:55:26,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11339ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:26, skipping insertion in model container [2025-01-10 00:55:26,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:25" (2/3) ... [2025-01-10 00:55:26,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11339ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:26, skipping insertion in model container [2025-01-10 00:55:26,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:26" (3/3) ... [2025-01-10 00:55:26,362 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-01-10 00:55:26,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:26,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 52 locations, 1 initial locations, 0 loop locations, and 25 error locations. [2025-01-10 00:55:26,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:26,412 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:26,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-01-10 00:55:26,455 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-01-10 00:55:26,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:26,458 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-01-10 00:55:26,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-01-10 00:55:26,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-01-10 00:55:26,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:26,473 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ec5277d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:26,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-10 00:55:26,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:26,476 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:55:26,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:26,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:26,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:26,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:26,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 11213, now seen corresponding path program 1 times [2025-01-10 00:55:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-01-10 00:55:26,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:26,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:26,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117368501] [2025-01-10 00:55:26,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117368501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:26,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:26,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:26,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354275486] [2025-01-10 00:55:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:26,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:26,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:26,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:26,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-01-10 00:55:26,823 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-01-10 00:55:26,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:26,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-01-10 00:55:26,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:26,881 INFO L124 PetriNetUnfolderBase]: 42/177 cut-off events. [2025-01-10 00:55:26,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:26,883 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-01-10 00:55:26,884 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-01-10 00:55:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-01-10 00:55:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 00:55:26,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-01-10 00:55:26,893 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-01-10 00:55:26,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-01-10 00:55:26,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:26,897 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-01-10 00:55:26,898 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-01-10 00:55:26,900 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-01-10 00:55:26,901 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-01-10 00:55:26,901 INFO L472 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-01-10 00:55:26,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:26,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:26,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:26,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash 11214, now seen corresponding path program 1 times [2025-01-10 00:55:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148629730] [2025-01-10 00:55:26,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:26,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:26,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148629730] [2025-01-10 00:55:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148629730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824454656] [2025-01-10 00:55:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:27,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:27,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:27,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-01-10 00:55:27,175 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-01-10 00:55:27,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:27,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-01-10 00:55:27,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:27,246 INFO L124 PetriNetUnfolderBase]: 42/173 cut-off events. [2025-01-10 00:55:27,246 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:27,247 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-01-10 00:55:27,248 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-01-10 00:55:27,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-01-10 00:55:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 00:55:27,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-01-10 00:55:27,249 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-01-10 00:55:27,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-01-10 00:55:27,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:27,250 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-01-10 00:55:27,251 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-01-10 00:55:27,251 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-01-10 00:55:27,251 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-01-10 00:55:27,251 INFO L472 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-01-10 00:55:27,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:27,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:27,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:55:27,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1774899415, now seen corresponding path program 1 times [2025-01-10 00:55:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580532986] [2025-01-10 00:55:27,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:27,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:27,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:27,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:27,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580532986] [2025-01-10 00:55:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580532986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419976479] [2025-01-10 00:55:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:27,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:27,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:27,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 00:55:27,474 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-01-10 00:55:27,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:27,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 00:55:27,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:27,537 INFO L124 PetriNetUnfolderBase]: 49/180 cut-off events. [2025-01-10 00:55:27,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:27,538 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-01-10 00:55:27,539 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 19 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-01-10 00:55:27,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 124 flow [2025-01-10 00:55:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-10 00:55:27,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-01-10 00:55:27,541 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 4 states and 113 transitions. [2025-01-10 00:55:27,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 124 flow [2025-01-10 00:55:27,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:27,542 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 82 flow [2025-01-10 00:55:27,543 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-01-10 00:55:27,543 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2025-01-10 00:55:27,543 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 82 flow [2025-01-10 00:55:27,543 INFO L472 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-01-10 00:55:27,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:27,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:27,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:27,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:27,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1774899416, now seen corresponding path program 1 times [2025-01-10 00:55:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:27,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678480291] [2025-01-10 00:55:27,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:27,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:27,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:27,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678480291] [2025-01-10 00:55:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678480291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:27,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754196566] [2025-01-10 00:55:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:27,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:27,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:27,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-01-10 00:55:27,732 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-01-10 00:55:27,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:27,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-01-10 00:55:27,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:27,784 INFO L124 PetriNetUnfolderBase]: 42/149 cut-off events. [2025-01-10 00:55:27,784 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:27,785 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-01-10 00:55:27,785 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-01-10 00:55:27,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 110 flow [2025-01-10 00:55:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-01-10 00:55:27,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-01-10 00:55:27,787 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 82 flow. Second operand 4 states and 138 transitions. [2025-01-10 00:55:27,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 110 flow [2025-01-10 00:55:27,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:27,788 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 75 flow [2025-01-10 00:55:27,788 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-01-10 00:55:27,789 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2025-01-10 00:55:27,789 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 75 flow [2025-01-10 00:55:27,789 INFO L472 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-01-10 00:55:27,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:27,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:27,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:55:27,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:27,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash 686521503, now seen corresponding path program 1 times [2025-01-10 00:55:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111340188] [2025-01-10 00:55:27,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:27,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:27,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:27,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111340188] [2025-01-10 00:55:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111340188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079467989] [2025-01-10 00:55:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:27,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:27,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:27,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:27,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-01-10 00:55:27,988 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-01-10 00:55:27,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:27,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-01-10 00:55:27,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:28,038 INFO L124 PetriNetUnfolderBase]: 49/160 cut-off events. [2025-01-10 00:55:28,038 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:28,038 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-01-10 00:55:28,039 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-01-10 00:55:28,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 137 flow [2025-01-10 00:55:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-01-10 00:55:28,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-01-10 00:55:28,040 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 75 flow. Second operand 3 states and 118 transitions. [2025-01-10 00:55:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 137 flow [2025-01-10 00:55:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:28,041 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-01-10 00:55:28,041 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-01-10 00:55:28,042 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-01-10 00:55:28,042 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-01-10 00:55:28,042 INFO L472 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-01-10 00:55:28,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:28,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:28,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:28,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 686521504, now seen corresponding path program 1 times [2025-01-10 00:55:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546772710] [2025-01-10 00:55:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:28,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:28,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:28,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:28,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:28,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546772710] [2025-01-10 00:55:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546772710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:28,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262467289] [2025-01-10 00:55:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:28,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:28,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:28,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:28,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-01-10 00:55:28,205 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-01-10 00:55:28,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:28,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-01-10 00:55:28,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:28,263 INFO L124 PetriNetUnfolderBase]: 42/139 cut-off events. [2025-01-10 00:55:28,265 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 00:55:28,266 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-01-10 00:55:28,266 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 00:55:28,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-01-10 00:55:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-01-10 00:55:28,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-01-10 00:55:28,269 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-01-10 00:55:28,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-01-10 00:55:28,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:28,270 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-01-10 00:55:28,273 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-01-10 00:55:28,274 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-01-10 00:55:28,274 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-01-10 00:55:28,274 INFO L472 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-01-10 00:55:28,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:28,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:28,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:28,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:28,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash -511232776, now seen corresponding path program 1 times [2025-01-10 00:55:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:28,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128547579] [2025-01-10 00:55:28,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:28,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:28,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:28,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:28,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:28,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:28,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128547579] [2025-01-10 00:55:28,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128547579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:28,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:28,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859459962] [2025-01-10 00:55:28,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:28,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:28,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:28,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:28,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-01-10 00:55:28,810 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-01-10 00:55:28,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:28,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-01-10 00:55:28,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:28,917 INFO L124 PetriNetUnfolderBase]: 77/214 cut-off events. [2025-01-10 00:55:28,917 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 00:55:28,919 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-01-10 00:55:28,920 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 32 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2025-01-10 00:55:28,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 188 flow [2025-01-10 00:55:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-01-10 00:55:28,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5915032679738562 [2025-01-10 00:55:28,921 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 6 states and 181 transitions. [2025-01-10 00:55:28,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 188 flow [2025-01-10 00:55:28,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:28,924 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 112 flow [2025-01-10 00:55:28,925 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-01-10 00:55:28,925 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-01-10 00:55:28,925 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 112 flow [2025-01-10 00:55:28,926 INFO L472 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-01-10 00:55:28,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:28,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:28,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash -511232775, now seen corresponding path program 1 times [2025-01-10 00:55:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295499917] [2025-01-10 00:55:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:28,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:28,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:28,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295499917] [2025-01-10 00:55:29,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295499917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:29,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:29,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127464463] [2025-01-10 00:55:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:29,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:29,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:29,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:29,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-01-10 00:55:29,200 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-01-10 00:55:29,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:29,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-01-10 00:55:29,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:29,295 INFO L124 PetriNetUnfolderBase]: 98/265 cut-off events. [2025-01-10 00:55:29,295 INFO L125 PetriNetUnfolderBase]: For 82/84 co-relation queries the response was YES. [2025-01-10 00:55:29,295 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 1148 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-01-10 00:55:29,296 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 37 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2025-01-10 00:55:29,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 238 flow [2025-01-10 00:55:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-01-10 00:55:29,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7098039215686275 [2025-01-10 00:55:29,297 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 112 flow. Second operand 5 states and 181 transitions. [2025-01-10 00:55:29,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 238 flow [2025-01-10 00:55:29,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:29,299 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 144 flow [2025-01-10 00:55:29,299 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-01-10 00:55:29,299 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-01-10 00:55:29,299 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 144 flow [2025-01-10 00:55:29,299 INFO L472 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-01-10 00:55:29,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:29,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:29,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:29,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:29,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -281055724, now seen corresponding path program 1 times [2025-01-10 00:55:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405481032] [2025-01-10 00:55:29,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:29,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:55:29,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:55:29,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:29,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405481032] [2025-01-10 00:55:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405481032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:29,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134214200] [2025-01-10 00:55:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:29,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:29,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:29,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:29,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:29,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-01-10 00:55:29,880 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-01-10 00:55:29,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:29,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-01-10 00:55:29,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:30,019 INFO L124 PetriNetUnfolderBase]: 106/293 cut-off events. [2025-01-10 00:55:30,019 INFO L125 PetriNetUnfolderBase]: For 248/254 co-relation queries the response was YES. [2025-01-10 00:55:30,020 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 1312 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-01-10 00:55:30,021 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 42 selfloop transitions, 19 changer transitions 0/67 dead transitions. [2025-01-10 00:55:30,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 400 flow [2025-01-10 00:55:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:55:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:55:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2025-01-10 00:55:30,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-01-10 00:55:30,022 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 144 flow. Second operand 9 states and 207 transitions. [2025-01-10 00:55:30,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 400 flow [2025-01-10 00:55:30,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:55:30,025 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 261 flow [2025-01-10 00:55:30,025 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-01-10 00:55:30,025 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 00:55:30,025 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 261 flow [2025-01-10 00:55:30,026 INFO L472 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-01-10 00:55:30,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:30,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:30,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:30,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:30,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1666337225, now seen corresponding path program 1 times [2025-01-10 00:55:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386126042] [2025-01-10 00:55:30,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:30,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:55:30,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:55:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:30,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:30,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386126042] [2025-01-10 00:55:30,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386126042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:30,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:30,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:55:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012129898] [2025-01-10 00:55:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:55:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:30,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:55:30,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:55:30,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-01-10 00:55:30,511 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-01-10 00:55:30,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:30,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-01-10 00:55:30,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:30,717 INFO L124 PetriNetUnfolderBase]: 106/292 cut-off events. [2025-01-10 00:55:30,721 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-01-10 00:55:30,722 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 1294 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-01-10 00:55:30,723 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 43 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2025-01-10 00:55:30,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 465 flow [2025-01-10 00:55:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:55:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:55:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2025-01-10 00:55:30,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44509803921568625 [2025-01-10 00:55:30,724 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 261 flow. Second operand 10 states and 227 transitions. [2025-01-10 00:55:30,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 465 flow [2025-01-10 00:55:30,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:30,730 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 338 flow [2025-01-10 00:55:30,730 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-01-10 00:55:30,731 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-01-10 00:55:30,732 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 338 flow [2025-01-10 00:55:30,732 INFO L472 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-01-10 00:55:30,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:30,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:30,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:55:30,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash -181198757, now seen corresponding path program 1 times [2025-01-10 00:55:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288596693] [2025-01-10 00:55:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:30,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:30,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:30,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:30,771 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:55:30,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:30,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:30,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:30,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:30,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:55:30,811 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:55:30,811 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-01-10 00:55:30,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-01-10 00:55:30,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-01-10 00:55:30,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-01-10 00:55:30,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-01-10 00:55:30,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-01-10 00:55:30,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-01-10 00:55:30,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-01-10 00:55:30,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-01-10 00:55:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-01-10 00:55:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:30,818 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:30,848 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:55:30,848 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:55:30,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:55:30 BasicIcfg [2025-01-10 00:55:30,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:55:30,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:55:30,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:55:30,855 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:55:30,856 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:26" (3/4) ... [2025-01-10 00:55:30,857 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:55:30,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:55:30,859 INFO L158 Benchmark]: Toolchain (without parser) took 5651.18ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 111.0MB in the beginning and 263.4MB in the end (delta: -152.4MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2025-01-10 00:55:30,859 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:30,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.10ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 72.9MB in the end (delta: 37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 00:55:30,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.63ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:30,859 INFO L158 Benchmark]: Boogie Preprocessor took 30.50ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 68.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:30,860 INFO L158 Benchmark]: RCFGBuilder took 620.15ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 82.8MB in the end (delta: -15.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-01-10 00:55:30,860 INFO L158 Benchmark]: TraceAbstraction took 4498.85ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 82.1MB in the beginning and 263.5MB in the end (delta: -181.4MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2025-01-10 00:55:30,861 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 369.1MB. Free memory was 263.5MB in the beginning and 263.4MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:30,862 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.10ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 72.9MB in the end (delta: 37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.63ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.50ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 68.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 620.15ms. Allocated memory is still 142.6MB. Free memory was 67.5MB in the beginning and 82.8MB in the end (delta: -15.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4498.85ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 82.1MB in the beginning and 263.5MB in the end (delta: -181.4MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 369.1MB. Free memory was 263.5MB in the beginning and 263.4MB in the end (delta: 60.1kB). 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, 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.4s, 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.3s 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 786 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-01-10 00:55:30,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-10 00:55:32,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:32,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:55:32,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:32,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:33,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:33,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:33,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:33,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:33,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:33,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:33,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:33,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:33,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:33,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:33,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:33,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:33,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:33,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:33,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:33,012 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-jdk21/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-01-10 00:55:33,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:33,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:33,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:33,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:33,298 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:33,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-01-10 00:55:34,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd6b12af6/c131ac904dd24f63a0288f176468de2e/FLAG8388713b3 [2025-01-10 00:55:34,852 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:34,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-01-10 00:55:34,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd6b12af6/c131ac904dd24f63a0288f176468de2e/FLAG8388713b3 [2025-01-10 00:55:34,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd6b12af6/c131ac904dd24f63a0288f176468de2e [2025-01-10 00:55:34,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:34,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:34,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:34,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:34,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:34,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:34" (1/1) ... [2025-01-10 00:55:34,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64635264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:34, skipping insertion in model container [2025-01-10 00:55:34,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:34" (1/1) ... [2025-01-10 00:55:34,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:35,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:35,306 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:35,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:35,407 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:35,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35 WrapperNode [2025-01-10 00:55:35,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:35,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:35,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:35,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:35,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,457 INFO L138 Inliner]: procedures = 369, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-01-10 00:55:35,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:35,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:35,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:35,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:35,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,489 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-01-10 00:55:35,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:35,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:35,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:35,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:35,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (1/1) ... [2025-01-10 00:55:35,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:35,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:55:35,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:55:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-10 00:55:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-10 00:55:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:35,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:35,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:35,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:35,581 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:55:35,709 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:35,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:35,981 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:35,982 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:36,173 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:36,173 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:36,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:36 BoogieIcfgContainer [2025-01-10 00:55:36,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:36,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:36,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:36,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:36,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:34" (1/3) ... [2025-01-10 00:55:36,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be77413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:36, skipping insertion in model container [2025-01-10 00:55:36,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:35" (2/3) ... [2025-01-10 00:55:36,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be77413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:36, skipping insertion in model container [2025-01-10 00:55:36,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:36" (3/3) ... [2025-01-10 00:55:36,189 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-01-10 00:55:36,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:36,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 52 locations, 1 initial locations, 0 loop locations, and 25 error locations. [2025-01-10 00:55:36,216 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:36,293 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:36,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 106 flow [2025-01-10 00:55:36,340 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-01-10 00:55:36,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:36,343 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-01-10 00:55:36,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 51 transitions, 106 flow [2025-01-10 00:55:36,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 50 transitions, 103 flow [2025-01-10 00:55:36,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:36,358 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78abc02b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:36,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-10 00:55:36,363 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:36,364 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:55:36,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:36,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:36,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:36,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 11277, now seen corresponding path program 1 times [2025-01-10 00:55:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823420803] [2025-01-10 00:55:36,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:36,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:36,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:36,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:36,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:55:36,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:36,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:36,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:36,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:55:36,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:36,559 INFO L378 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-01-10 00:55:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:36,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:36,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:36,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823420803] [2025-01-10 00:55:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823420803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959834977] [2025-01-10 00:55:36,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:36,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:36,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:36,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 51 [2025-01-10 00:55:36,693 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-01-10 00:55:36,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:36,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 51 [2025-01-10 00:55:36,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:36,801 INFO L124 PetriNetUnfolderBase]: 42/177 cut-off events. [2025-01-10 00:55:36,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:36,803 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-01-10 00:55:36,804 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 18 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-01-10 00:55:36,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 135 flow [2025-01-10 00:55:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 00:55:36,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2025-01-10 00:55:36,815 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 103 flow. Second operand 3 states and 105 transitions. [2025-01-10 00:55:36,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 46 transitions, 135 flow [2025-01-10 00:55:36,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:36,821 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 98 flow [2025-01-10 00:55:36,823 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-01-10 00:55:36,825 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-01-10 00:55:36,825 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 98 flow [2025-01-10 00:55:36,826 INFO L472 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-01-10 00:55:36,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:36,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:36,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:37,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:37,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:37,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 11278, now seen corresponding path program 1 times [2025-01-10 00:55:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790169024] [2025-01-10 00:55:37,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:37,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:37,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:55:37,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:37,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:37,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:37,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:55:37,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:37,137 INFO L378 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-01-10 00:55:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:37,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:37,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790169024] [2025-01-10 00:55:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790169024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319259193] [2025-01-10 00:55:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:37,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:37,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:37,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-01-10 00:55:37,225 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-01-10 00:55:37,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-01-10 00:55:37,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,324 INFO L124 PetriNetUnfolderBase]: 42/173 cut-off events. [2025-01-10 00:55:37,325 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:37,325 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-01-10 00:55:37,326 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-01-10 00:55:37,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 126 flow [2025-01-10 00:55:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 00:55:37,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-01-10 00:55:37,328 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 98 flow. Second operand 3 states and 109 transitions. [2025-01-10 00:55:37,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 126 flow [2025-01-10 00:55:37,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:37,329 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 90 flow [2025-01-10 00:55:37,329 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-01-10 00:55:37,330 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-01-10 00:55:37,330 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 90 flow [2025-01-10 00:55:37,330 INFO L472 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-01-10 00:55:37,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:55:37,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:37,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:37,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1834066327, now seen corresponding path program 1 times [2025-01-10 00:55:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514061399] [2025-01-10 00:55:37,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:37,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:37,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:37,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:55:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:37,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:37,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:37,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:55:37,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:37,681 INFO L378 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-01-10 00:55:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:37,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:37,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514061399] [2025-01-10 00:55:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514061399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513884895] [2025-01-10 00:55:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:37,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:37,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:37,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:37,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 51 [2025-01-10 00:55:37,750 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-01-10 00:55:37,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 51 [2025-01-10 00:55:37,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,817 INFO L124 PetriNetUnfolderBase]: 49/180 cut-off events. [2025-01-10 00:55:37,817 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:37,817 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-01-10 00:55:37,818 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 18 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-01-10 00:55:37,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 120 flow [2025-01-10 00:55:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-01-10 00:55:37,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2025-01-10 00:55:37,819 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 90 flow. Second operand 3 states and 107 transitions. [2025-01-10 00:55:37,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 120 flow [2025-01-10 00:55:37,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:37,820 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 80 flow [2025-01-10 00:55:37,820 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-01-10 00:55:37,821 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-01-10 00:55:37,821 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 80 flow [2025-01-10 00:55:37,821 INFO L472 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-01-10 00:55:37,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:38,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:38,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:38,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1834066328, now seen corresponding path program 1 times [2025-01-10 00:55:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:38,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973901495] [2025-01-10 00:55:38,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:38,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:38,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:55:38,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:38,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:38,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:55:38,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:38,130 INFO L378 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-01-10 00:55:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:38,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:38,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:38,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973901495] [2025-01-10 00:55:38,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973901495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:38,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926636959] [2025-01-10 00:55:38,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:38,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:38,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:38,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 51 [2025-01-10 00:55:38,221 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-01-10 00:55:38,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 51 [2025-01-10 00:55:38,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,277 INFO L124 PetriNetUnfolderBase]: 42/149 cut-off events. [2025-01-10 00:55:38,278 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:38,278 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-01-10 00:55:38,279 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 17 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-01-10 00:55:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 108 flow [2025-01-10 00:55:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 00:55:38,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2025-01-10 00:55:38,281 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 80 flow. Second operand 3 states and 109 transitions. [2025-01-10 00:55:38,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 108 flow [2025-01-10 00:55:38,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 107 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:38,282 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 73 flow [2025-01-10 00:55:38,282 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-01-10 00:55:38,282 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2025-01-10 00:55:38,282 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 73 flow [2025-01-10 00:55:38,283 INFO L472 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-01-10 00:55:38,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:38,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:55:38,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:38,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1903559775, now seen corresponding path program 1 times [2025-01-10 00:55:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588795933] [2025-01-10 00:55:38,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:38,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:38,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:55:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:38,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:55:38,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:38,604 INFO L378 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-01-10 00:55:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:38,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:38,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588795933] [2025-01-10 00:55:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588795933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633891674] [2025-01-10 00:55:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:38,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 51 [2025-01-10 00:55:38,666 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-01-10 00:55:38,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 51 [2025-01-10 00:55:38,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,761 INFO L124 PetriNetUnfolderBase]: 49/166 cut-off events. [2025-01-10 00:55:38,762 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:38,762 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-01-10 00:55:38,763 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-01-10 00:55:38,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 135 flow [2025-01-10 00:55:38,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-01-10 00:55:38,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712418300653595 [2025-01-10 00:55:38,764 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 73 flow. Second operand 3 states and 118 transitions. [2025-01-10 00:55:38,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 135 flow [2025-01-10 00:55:38,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:38,765 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2025-01-10 00:55:38,766 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-01-10 00:55:38,766 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2025-01-10 00:55:38,766 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2025-01-10 00:55:38,766 INFO L472 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-01-10 00:55:38,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:38,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:38,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:38,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1903559774, now seen corresponding path program 1 times [2025-01-10 00:55:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220688863] [2025-01-10 00:55:38,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:38,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:38,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:38,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:55:39,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:55:39,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:55:39,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:55:39,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:39,088 INFO L378 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-01-10 00:55:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:39,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:39,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220688863] [2025-01-10 00:55:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220688863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744358985] [2025-01-10 00:55:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:39,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:39,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:39,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 51 [2025-01-10 00:55:39,171 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-01-10 00:55:39,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:39,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 51 [2025-01-10 00:55:39,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,245 INFO L124 PetriNetUnfolderBase]: 42/143 cut-off events. [2025-01-10 00:55:39,245 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 00:55:39,245 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-01-10 00:55:39,246 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 23 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 00:55:39,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 132 flow [2025-01-10 00:55:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-01-10 00:55:39,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2025-01-10 00:55:39,247 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 120 transitions. [2025-01-10 00:55:39,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 132 flow [2025-01-10 00:55:39,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:39,248 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2025-01-10 00:55:39,248 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-01-10 00:55:39,248 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2025-01-10 00:55:39,248 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2025-01-10 00:55:39,248 INFO L472 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-01-10 00:55:39,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:39,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:39,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:39,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1759856248, now seen corresponding path program 1 times [2025-01-10 00:55:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244280867] [2025-01-10 00:55:39,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:39,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:39,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:55:39,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:39,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:39,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:55:39,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:39,583 INFO L378 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-01-10 00:55:39,611 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-01-10 00:55:39,612 INFO L378 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-01-10 00:55:39,654 INFO L378 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-01-10 00:55:39,690 INFO L378 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-01-10 00:55:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:39,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:39,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244280867] [2025-01-10 00:55:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244280867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210327918] [2025-01-10 00:55:39,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:39,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:39,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:39,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-01-10 00:55:39,862 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-01-10 00:55:39,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:39,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-01-10 00:55:39,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:40,084 INFO L124 PetriNetUnfolderBase]: 98/267 cut-off events. [2025-01-10 00:55:40,085 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-10 00:55:40,085 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-01-10 00:55:40,086 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 38 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2025-01-10 00:55:40,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 230 flow [2025-01-10 00:55:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-01-10 00:55:40,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5994397759103641 [2025-01-10 00:55:40,087 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 7 states and 214 transitions. [2025-01-10 00:55:40,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 230 flow [2025-01-10 00:55:40,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:40,093 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 138 flow [2025-01-10 00:55:40,093 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-01-10 00:55:40,093 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-01-10 00:55:40,093 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 138 flow [2025-01-10 00:55:40,094 INFO L472 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-01-10 00:55:40,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:40,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:40,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:40,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:40,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1759856249, now seen corresponding path program 1 times [2025-01-10 00:55:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768909979] [2025-01-10 00:55:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:40,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:40,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:40,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:40,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:55:40,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:55:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:55:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:40,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:55:40,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:40,415 INFO L378 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-01-10 00:55:40,456 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:40,456 INFO L378 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-01-10 00:55:40,469 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 00:55:40,469 INFO L378 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-01-10 00:55:40,517 INFO L378 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-01-10 00:55:40,522 INFO L378 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-01-10 00:55:40,588 INFO L378 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-01-10 00:55:40,595 INFO L378 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-01-10 00:55:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:40,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:40,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768909979] [2025-01-10 00:55:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768909979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636490917] [2025-01-10 00:55:40,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:40,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:40,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:40,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:40,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 00:55:40,988 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-01-10 00:55:40,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:40,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 00:55:40,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:41,274 INFO L124 PetriNetUnfolderBase]: 117/305 cut-off events. [2025-01-10 00:55:41,274 INFO L125 PetriNetUnfolderBase]: For 121/123 co-relation queries the response was YES. [2025-01-10 00:55:41,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 305 events. 117/305 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1374 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-01-10 00:55:41,277 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 45 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2025-01-10 00:55:41,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 320 flow [2025-01-10 00:55:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:55:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:55:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2025-01-10 00:55:41,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-01-10 00:55:41,278 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 138 flow. Second operand 8 states and 232 transitions. [2025-01-10 00:55:41,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 320 flow [2025-01-10 00:55:41,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:41,280 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 193 flow [2025-01-10 00:55:41,280 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-01-10 00:55:41,280 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-01-10 00:55:41,280 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 193 flow [2025-01-10 00:55:41,280 INFO L472 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-01-10 00:55:41,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:41,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:41,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:41,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:41,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:41,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash 392023546, now seen corresponding path program 1 times [2025-01-10 00:55:41,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:41,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695299477] [2025-01-10 00:55:41,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:41,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:41,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:41,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:55:41,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:55:41,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:55:41,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:41,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:41,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 00:55:41,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:41,621 INFO L378 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-01-10 00:55:41,625 INFO L378 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-01-10 00:55:41,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:41,662 INFO L378 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-01-10 00:55:41,677 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 00:55:41,678 INFO L378 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-01-10 00:55:41,736 INFO L378 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-01-10 00:55:41,739 INFO L378 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-01-10 00:55:41,848 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 00:55:41,848 INFO L378 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-01-10 00:55:41,864 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-10 00:55:41,864 INFO L378 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-01-10 00:55:41,970 INFO L378 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-01-10 00:55:41,982 INFO L378 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-01-10 00:55:42,031 INFO L378 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-01-10 00:55:42,036 INFO L378 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-01-10 00:55:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:42,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:42,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695299477] [2025-01-10 00:55:42,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695299477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:42,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:42,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62798354] [2025-01-10 00:55:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:42,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:42,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:42,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:42,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 51 [2025-01-10 00:55:42,638 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-01-10 00:55:42,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:42,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 51 [2025-01-10 00:55:42,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:43,217 INFO L124 PetriNetUnfolderBase]: 128/344 cut-off events. [2025-01-10 00:55:43,218 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-10 00:55:43,218 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 1617 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-01-10 00:55:43,220 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 43 selfloop transitions, 37 changer transitions 0/85 dead transitions. [2025-01-10 00:55:43,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 548 flow [2025-01-10 00:55:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 331 transitions. [2025-01-10 00:55:43,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5408496732026143 [2025-01-10 00:55:43,222 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 193 flow. Second operand 12 states and 331 transitions. [2025-01-10 00:55:43,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 548 flow [2025-01-10 00:55:43,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 498 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:43,226 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 378 flow [2025-01-10 00:55:43,227 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-01-10 00:55:43,228 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-01-10 00:55:43,228 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 378 flow [2025-01-10 00:55:43,228 INFO L472 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-01-10 00:55:43,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:43,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:43,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:43,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:43,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:43,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash -993171465, now seen corresponding path program 1 times [2025-01-10 00:55:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915013277] [2025-01-10 00:55:43,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:43,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:43,438 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:43,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:55:43,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:55:43,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:55:43,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:43,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:43,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 00:55:43,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:43,591 INFO L378 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-01-10 00:55:43,633 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-01-10 00:55:43,633 INFO L378 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-01-10 00:55:43,677 INFO L378 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-01-10 00:55:43,748 INFO L349 Elim1Store]: treesize reduction 82, result has 29.9 percent of original size [2025-01-10 00:55:43,748 INFO L378 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-01-10 00:55:43,801 INFO L378 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-01-10 00:55:43,866 INFO L378 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-01-10 00:55:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:43,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:43,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915013277] [2025-01-10 00:55:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915013277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855969983] [2025-01-10 00:55:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:43,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:43,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:43,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:44,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 51 [2025-01-10 00:55:44,367 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-01-10 00:55:44,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:44,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 51 [2025-01-10 00:55:44,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:44,997 INFO L124 PetriNetUnfolderBase]: 118/321 cut-off events. [2025-01-10 00:55:44,997 INFO L125 PetriNetUnfolderBase]: For 338/340 co-relation queries the response was YES. [2025-01-10 00:55:44,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 321 events. 118/321 cut-off events. For 338/340 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1470 event pairs, 13 based on Foata normal form. 10/320 useless extension candidates. Maximal degree in co-relation 920. Up to 97 conditions per place. [2025-01-10 00:55:44,998 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 51 selfloop transitions, 27 changer transitions 0/84 dead transitions. [2025-01-10 00:55:44,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 84 transitions, 580 flow [2025-01-10 00:55:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 316 transitions. [2025-01-10 00:55:45,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163398692810458 [2025-01-10 00:55:45,005 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 378 flow. Second operand 12 states and 316 transitions. [2025-01-10 00:55:45,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 84 transitions, 580 flow [2025-01-10 00:55:45,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:45,008 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 458 flow [2025-01-10 00:55:45,009 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-01-10 00:55:45,009 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2025-01-10 00:55:45,009 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 458 flow [2025-01-10 00:55:45,009 INFO L472 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-01-10 00:55:45,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:45,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:45,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:55:45,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:45,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2025-01-10 00:55:45,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash -787896675, now seen corresponding path program 1 times [2025-01-10 00:55:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57765782] [2025-01-10 00:55:45,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:45,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:45,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:45,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:45,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:55:45,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:45,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:45,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:45,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:45,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:55:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:46,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:46,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:46,153 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:55:46,153 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:55:46,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2025-01-10 00:55:46,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2025-01-10 00:55:46,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2025-01-10 00:55:46,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2025-01-10 00:55:46,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2025-01-10 00:55:46,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2025-01-10 00:55:46,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 36 remaining) [2025-01-10 00:55:46,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 00:55:46,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:46,356 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:46,380 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:55:46,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:55:46,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:55:46 BasicIcfg [2025-01-10 00:55:46,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:55:46,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:55:46,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:55:46,384 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:55:46,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:36" (3/4) ... [2025-01-10 00:55:46,385 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:55:46,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:55:46,386 INFO L158 Benchmark]: Toolchain (without parser) took 11505.42ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 89.0MB in the beginning and 222.4MB in the end (delta: -133.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-01-10 00:55:46,386 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:46,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.21ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 50.1MB in the end (delta: 38.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 00:55:46,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.76ms. Allocated memory is still 117.4MB. Free memory was 50.1MB in the beginning and 47.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:46,386 INFO L158 Benchmark]: Boogie Preprocessor took 51.73ms. Allocated memory is still 117.4MB. Free memory was 47.4MB in the beginning and 44.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:46,387 INFO L158 Benchmark]: RCFGBuilder took 663.27ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 44.6MB in the beginning and 181.4MB in the end (delta: -136.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2025-01-10 00:55:46,387 INFO L158 Benchmark]: TraceAbstraction took 10208.50ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 181.4MB in the beginning and 222.5MB in the end (delta: -41.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2025-01-10 00:55:46,387 INFO L158 Benchmark]: Witness Printer took 1.96ms. Allocated memory is still 285.2MB. Free memory was 222.5MB in the beginning and 222.4MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:46,388 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.16ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.21ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 50.1MB in the end (delta: 38.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.76ms. Allocated memory is still 117.4MB. Free memory was 50.1MB in the beginning and 47.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.73ms. Allocated memory is still 117.4MB. Free memory was 47.4MB in the beginning and 44.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 663.27ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 44.6MB in the beginning and 181.4MB in the end (delta: -136.8MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10208.50ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 181.4MB in the beginning and 222.5MB in the end (delta: -41.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Witness Printer took 1.96ms. Allocated memory is still 285.2MB. Free memory was 222.5MB in the beginning and 222.4MB in the end (delta: 87.6kB). 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, 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: 10.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1260 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2216 IncrementalHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 82 mSDtfsCounter, 2216 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.8s 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.5s SatisfiabilityAnalysisTime, 1.3s 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-01-10 00:55:46,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample