./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_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_04-list2_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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:24,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:24,354 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:24,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:24,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:24,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:24,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:24,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:24,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:24,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:24,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:24,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:24,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:24,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:24,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:24,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:24,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:24,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:24,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:24,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:24,376 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-01-10 00:55:24,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:24,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:24,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:24,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:24,592 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:24,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-01-10 00:55:25,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/925bab91d/be60036300f243d89b45e8da896e0484/FLAG9bb72f4da [2025-01-10 00:55:25,949 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:25,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-01-10 00:55:25,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/925bab91d/be60036300f243d89b45e8da896e0484/FLAG9bb72f4da [2025-01-10 00:55:25,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/925bab91d/be60036300f243d89b45e8da896e0484 [2025-01-10 00:55:25,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:25,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:25,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:25,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:25,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:25,984 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,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e85379 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,985 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:26,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:26,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:26,436 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:26,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:26,531 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:26,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:26 WrapperNode [2025-01-10 00:55:26,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:26,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:26,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:26,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:26,539 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:26" (1/1) ... [2025-01-10 00:55:26,557 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:26" (1/1) ... [2025-01-10 00:55:26,580 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 89 [2025-01-10 00:55:26,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:26,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:26,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:26,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:26,589 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:26" (1/1) ... [2025-01-10 00:55:26,590 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:26" (1/1) ... [2025-01-10 00:55:26,594 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:26" (1/1) ... [2025-01-10 00:55:26,609 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-01-10 00:55:26,610 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:26" (1/1) ... [2025-01-10 00:55:26,610 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:26" (1/1) ... [2025-01-10 00:55:26,618 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:26" (1/1) ... [2025-01-10 00:55:26,619 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:26" (1/1) ... [2025-01-10 00:55:26,620 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:26" (1/1) ... [2025-01-10 00:55:26,621 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:26" (1/1) ... [2025-01-10 00:55:26,622 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:26" (1/1) ... [2025-01-10 00:55:26,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:26,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:26,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:26,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:26,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:26" (1/1) ... [2025-01-10 00:55:26,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:26,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:26,652 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:26,654 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:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:26,670 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:26,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:26,671 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:26,773 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:26,774 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:27,073 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:27,073 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:27,200 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:27,200 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:27,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:27 BoogieIcfgContainer [2025-01-10 00:55:27,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:27,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:27,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:27,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:27,207 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:27,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ce1b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:27, skipping insertion in model container [2025-01-10 00:55:27,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:26" (2/3) ... [2025-01-10 00:55:27,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ce1b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:27, skipping insertion in model container [2025-01-10 00:55:27,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:27" (3/3) ... [2025-01-10 00:55:27,209 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-01-10 00:55:27,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:27,223 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 84 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-01-10 00:55:27,223 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:27,273 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:27,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2025-01-10 00:55:27,333 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-01-10 00:55:27,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:27,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-10 00:55:27,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2025-01-10 00:55:27,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2025-01-10 00:55:27,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:27,354 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;@5701f862, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:27,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-01-10 00:55:27,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:27,357 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:55:27,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:27,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:27,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:27,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 11284, now seen corresponding path program 1 times [2025-01-10 00:55:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:27,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91937952] [2025-01-10 00:55:27,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:27,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:27,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:27,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:27,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:27,585 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,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:27,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91937952] [2025-01-10 00:55:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91937952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:27,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:27,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283115224] [2025-01-10 00:55:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:27,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:27,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:27,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:27,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-01-10 00:55:27,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:27,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-01-10 00:55:27,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:27,849 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2025-01-10 00:55:27,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:27,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2025-01-10 00:55:27,853 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-01-10 00:55:27,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2025-01-10 00:55:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 00:55:27,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-01-10 00:55:27,865 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2025-01-10 00:55:27,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2025-01-10 00:55:27,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:27,872 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2025-01-10 00:55:27,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-01-10 00:55:27,878 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-01-10 00:55:27,878 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2025-01-10 00:55:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:27,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:27,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:27,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:27,881 INFO L85 PathProgramCache]: Analyzing trace with hash 11285, now seen corresponding path program 1 times [2025-01-10 00:55:27,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267346174] [2025-01-10 00:55:27,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:27,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:27,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:27,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:27,991 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,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267346174] [2025-01-10 00:55:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267346174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:27,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669666087] [2025-01-10 00:55:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:27,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:27,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:27,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:27,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:28,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-01-10 00:55:28,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:28,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-01-10 00:55:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:28,172 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2025-01-10 00:55:28,172 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:28,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1810 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2025-01-10 00:55:28,175 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-01-10 00:55:28,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2025-01-10 00:55:28,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-01-10 00:55:28,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-01-10 00:55:28,176 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2025-01-10 00:55:28,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2025-01-10 00:55:28,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:28,178 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2025-01-10 00:55:28,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-01-10 00:55:28,178 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-01-10 00:55:28,179 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2025-01-10 00:55:28,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:28,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:28,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:55:28,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:28,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1840858293, now seen corresponding path program 1 times [2025-01-10 00:55:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:28,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349985201] [2025-01-10 00:55:28,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:28,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:28,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:28,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:28,293 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,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349985201] [2025-01-10 00:55:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349985201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:28,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:28,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318988516] [2025-01-10 00:55:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:28,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:28,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:28,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:28,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2025-01-10 00:55:28,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:28,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2025-01-10 00:55:28,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:28,536 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2025-01-10 00:55:28,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:28,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 392 events. 110/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1982 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 249 conditions per place. [2025-01-10 00:55:28,540 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-01-10 00:55:28,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 202 flow [2025-01-10 00:55:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-01-10 00:55:28,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5783132530120482 [2025-01-10 00:55:28,541 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 4 states and 192 transitions. [2025-01-10 00:55:28,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 202 flow [2025-01-10 00:55:28,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:28,543 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 132 flow [2025-01-10 00:55:28,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 00:55:28,543 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -17 predicate places. [2025-01-10 00:55:28,544 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 132 flow [2025-01-10 00:55:28,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:28,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:28,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1840858294, now seen corresponding path program 1 times [2025-01-10 00:55:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43142336] [2025-01-10 00:55:28,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:28,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:28,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:28,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:28,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:28,662 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,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43142336] [2025-01-10 00:55:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43142336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:28,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040883496] [2025-01-10 00:55:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:28,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:28,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:28,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:28,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-01-10 00:55:28,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:28,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-01-10 00:55:28,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:28,882 INFO L124 PetriNetUnfolderBase]: 110/387 cut-off events. [2025-01-10 00:55:28,882 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:28,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 387 events. 110/387 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1977 event pairs, 110 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 630. Up to 247 conditions per place. [2025-01-10 00:55:28,885 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 27 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-01-10 00:55:28,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 184 flow [2025-01-10 00:55:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-01-10 00:55:28,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-01-10 00:55:28,888 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 132 flow. Second operand 4 states and 236 transitions. [2025-01-10 00:55:28,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 184 flow [2025-01-10 00:55:28,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:28,889 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 127 flow [2025-01-10 00:55:28,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-01-10 00:55:28,890 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -19 predicate places. [2025-01-10 00:55:28,890 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 127 flow [2025-01-10 00:55:28,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:28,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:28,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:55:28,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:28,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543333, now seen corresponding path program 1 times [2025-01-10 00:55:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622170638] [2025-01-10 00:55:28,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:28,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:55:28,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:55:28,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:28,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:29,055 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,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622170638] [2025-01-10 00:55:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622170638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160613609] [2025-01-10 00:55:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:29,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:29,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:29,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:29,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-01-10 00:55:29,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:29,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-01-10 00:55:29,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:29,206 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2025-01-10 00:55:29,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:29,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 357 events. 110/357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1692 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 602. Up to 248 conditions per place. [2025-01-10 00:55:29,211 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2025-01-10 00:55:29,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 187 flow [2025-01-10 00:55:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-01-10 00:55:29,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-01-10 00:55:29,213 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 127 flow. Second operand 3 states and 177 transitions. [2025-01-10 00:55:29,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 187 flow [2025-01-10 00:55:29,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:29,214 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2025-01-10 00:55:29,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-01-10 00:55:29,215 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2025-01-10 00:55:29,215 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2025-01-10 00:55:29,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:29,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:29,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:29,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543332, now seen corresponding path program 1 times [2025-01-10 00:55:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608659333] [2025-01-10 00:55:29,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:29,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:55:29,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:55:29,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:29,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:29,426 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,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608659333] [2025-01-10 00:55:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608659333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609960283] [2025-01-10 00:55:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:29,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:29,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:29,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-01-10 00:55:29,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:29,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-01-10 00:55:29,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:29,654 INFO L124 PetriNetUnfolderBase]: 110/344 cut-off events. [2025-01-10 00:55:29,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:29,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 344 events. 110/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1577 event pairs, 110 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 590. Up to 246 conditions per place. [2025-01-10 00:55:29,657 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-01-10 00:55:29,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 180 flow [2025-01-10 00:55:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-01-10 00:55:29,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2025-01-10 00:55:29,658 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 4 states and 180 transitions. [2025-01-10 00:55:29,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 180 flow [2025-01-10 00:55:29,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:29,660 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2025-01-10 00:55:29,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-01-10 00:55:29,662 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2025-01-10 00:55:29,662 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2025-01-10 00:55:29,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:29,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:29,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:29,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2094825083, now seen corresponding path program 1 times [2025-01-10 00:55:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934598804] [2025-01-10 00:55:29,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:29,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:29,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:29,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:30,271 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,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934598804] [2025-01-10 00:55:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934598804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:30,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:55:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999270991] [2025-01-10 00:55:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:30,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:30,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:30,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:31,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-01-10 00:55:31,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 13 states, 13 states have (on average 35.15384615384615) internal successors, (457), 13 states have internal predecessors, (457), 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:31,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:31,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-01-10 00:55:31,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:31,328 INFO L124 PetriNetUnfolderBase]: 167/488 cut-off events. [2025-01-10 00:55:31,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:31,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 488 events. 167/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2508 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 857. Up to 180 conditions per place. [2025-01-10 00:55:31,330 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 61 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2025-01-10 00:55:31,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 341 flow [2025-01-10 00:55:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:55:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:55:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 456 transitions. [2025-01-10 00:55:31,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4994523548740416 [2025-01-10 00:55:31,333 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 11 states and 456 transitions. [2025-01-10 00:55:31,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 341 flow [2025-01-10 00:55:31,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:31,337 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 171 flow [2025-01-10 00:55:31,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=171, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2025-01-10 00:55:31,339 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -14 predicate places. [2025-01-10 00:55:31,339 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 171 flow [2025-01-10 00:55:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.15384615384615) internal successors, (457), 13 states have internal predecessors, (457), 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:31,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:31,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:31,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:31,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2094825082, now seen corresponding path program 1 times [2025-01-10 00:55:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139150851] [2025-01-10 00:55:31,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:31,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:31,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:31,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:31,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:32,064 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:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139150851] [2025-01-10 00:55:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139150851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743585341] [2025-01-10 00:55:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:32,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:32,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:32,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2025-01-10 00:55:32,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 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:32,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:32,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2025-01-10 00:55:32,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:32,776 INFO L124 PetriNetUnfolderBase]: 176/487 cut-off events. [2025-01-10 00:55:32,776 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-01-10 00:55:32,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 487 events. 176/487 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2507 event pairs, 2 based on Foata normal form. 15/445 useless extension candidates. Maximal degree in co-relation 993. Up to 247 conditions per place. [2025-01-10 00:55:32,778 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 65 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2025-01-10 00:55:32,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 403 flow [2025-01-10 00:55:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:55:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:55:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 448 transitions. [2025-01-10 00:55:32,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5997322623828648 [2025-01-10 00:55:32,780 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 171 flow. Second operand 9 states and 448 transitions. [2025-01-10 00:55:32,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 403 flow [2025-01-10 00:55:32,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 395 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:32,782 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 201 flow [2025-01-10 00:55:32,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2025-01-10 00:55:32,782 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2025-01-10 00:55:32,783 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 201 flow [2025-01-10 00:55:32,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 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:32,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:32,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:32,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:32,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:32,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2128602727, now seen corresponding path program 1 times [2025-01-10 00:55:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:32,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347123855] [2025-01-10 00:55:32,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:32,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:32,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:32,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:32,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,362 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:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347123855] [2025-01-10 00:55:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347123855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564569675] [2025-01-10 00:55:33,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:33,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:33,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-01-10 00:55:33,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 44.77777777777778) internal successors, (403), 9 states have internal predecessors, (403), 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:33,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-01-10 00:55:33,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,879 INFO L124 PetriNetUnfolderBase]: 166/466 cut-off events. [2025-01-10 00:55:33,879 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-01-10 00:55:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 466 events. 166/466 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2378 event pairs, 42 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 986. Up to 184 conditions per place. [2025-01-10 00:55:33,882 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 70 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2025-01-10 00:55:33,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 465 flow [2025-01-10 00:55:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:55:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:55:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 516 transitions. [2025-01-10 00:55:33,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6216867469879518 [2025-01-10 00:55:33,886 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 201 flow. Second operand 10 states and 516 transitions. [2025-01-10 00:55:33,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 465 flow [2025-01-10 00:55:33,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 99 transitions, 452 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:55:33,888 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 244 flow [2025-01-10 00:55:33,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2025-01-10 00:55:33,889 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-01-10 00:55:33,889 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 244 flow [2025-01-10 00:55:33,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.77777777777778) internal successors, (403), 9 states have internal predecessors, (403), 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:33,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:33,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:33,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1460892621, now seen corresponding path program 1 times [2025-01-10 00:55:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794813503] [2025-01-10 00:55:33,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:55:33,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:55:33,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,961 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:33,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794813503] [2025-01-10 00:55:33,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794813503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182199060] [2025-01-10 00:55:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:33,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:33,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:33,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2025-01-10 00:55:33,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:33,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2025-01-10 00:55:33,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,039 INFO L124 PetriNetUnfolderBase]: 105/347 cut-off events. [2025-01-10 00:55:34,039 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2025-01-10 00:55:34,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 347 events. 105/347 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1757 event pairs, 43 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 750. Up to 174 conditions per place. [2025-01-10 00:55:34,041 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 48 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2025-01-10 00:55:34,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 390 flow [2025-01-10 00:55:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-01-10 00:55:34,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2025-01-10 00:55:34,042 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 244 flow. Second operand 3 states and 213 transitions. [2025-01-10 00:55:34,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 390 flow [2025-01-10 00:55:34,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 356 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-01-10 00:55:34,044 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 226 flow [2025-01-10 00:55:34,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2025-01-10 00:55:34,045 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2025-01-10 00:55:34,045 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 226 flow [2025-01-10 00:55:34,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:34,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:34,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:55:34,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:34,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1711614886, now seen corresponding path program 1 times [2025-01-10 00:55:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243381575] [2025-01-10 00:55:34,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:55:34,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:55:34,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,228 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:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243381575] [2025-01-10 00:55:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243381575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:34,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354286053] [2025-01-10 00:55:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:34,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:34,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:34,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-01-10 00:55:34,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:34,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-01-10 00:55:34,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,394 INFO L124 PetriNetUnfolderBase]: 140/446 cut-off events. [2025-01-10 00:55:34,394 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-01-10 00:55:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 446 events. 140/446 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2392 event pairs, 14 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 987. Up to 183 conditions per place. [2025-01-10 00:55:34,397 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2025-01-10 00:55:34,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 449 flow [2025-01-10 00:55:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-01-10 00:55:34,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-01-10 00:55:34,398 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 226 flow. Second operand 5 states and 305 transitions. [2025-01-10 00:55:34,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 449 flow [2025-01-10 00:55:34,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:34,403 INFO L231 Difference]: Finished difference. Result has 82 places, 66 transitions, 273 flow [2025-01-10 00:55:34,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2025-01-10 00:55:34,403 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2025-01-10 00:55:34,403 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 273 flow [2025-01-10 00:55:34,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:34,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:34,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:34,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1711614887, now seen corresponding path program 1 times [2025-01-10 00:55:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428779825] [2025-01-10 00:55:34,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:55:34,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:55:34,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,514 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:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428779825] [2025-01-10 00:55:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428779825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760171794] [2025-01-10 00:55:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:34,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:34,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2025-01-10 00:55:34,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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:34,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2025-01-10 00:55:34,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,743 INFO L124 PetriNetUnfolderBase]: 140/436 cut-off events. [2025-01-10 00:55:34,743 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-01-10 00:55:34,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 436 events. 140/436 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2274 event pairs, 58 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 1048. Up to 191 conditions per place. [2025-01-10 00:55:34,746 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 48 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2025-01-10 00:55:34,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 85 transitions, 463 flow [2025-01-10 00:55:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-01-10 00:55:34,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2025-01-10 00:55:34,748 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 273 flow. Second operand 6 states and 303 transitions. [2025-01-10 00:55:34,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 85 transitions, 463 flow [2025-01-10 00:55:34,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:55:34,752 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 349 flow [2025-01-10 00:55:34,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2025-01-10 00:55:34,753 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2025-01-10 00:55:34,753 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 349 flow [2025-01-10 00:55:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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:34,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:34,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:55:34,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -38564856, now seen corresponding path program 1 times [2025-01-10 00:55:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57816587] [2025-01-10 00:55:34,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:55:34,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:55:34,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:35,172 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:35,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:35,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57816587] [2025-01-10 00:55:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57816587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:35,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 00:55:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914965995] [2025-01-10 00:55:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:35,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:55:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:35,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:55:35,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:55:35,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-01-10 00:55:35,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 349 flow. Second operand has 14 states, 14 states have (on average 34.5) internal successors, (483), 14 states have internal predecessors, (483), 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:35,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:35,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-01-10 00:55:35,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:36,584 INFO L124 PetriNetUnfolderBase]: 167/474 cut-off events. [2025-01-10 00:55:36,585 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2025-01-10 00:55:36,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 474 events. 167/474 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2446 event pairs, 12 based on Foata normal form. 6/468 useless extension candidates. Maximal degree in co-relation 1365. Up to 76 conditions per place. [2025-01-10 00:55:36,588 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 73 selfloop transitions, 49 changer transitions 2/137 dead transitions. [2025-01-10 00:55:36,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 893 flow [2025-01-10 00:55:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 00:55:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 00:55:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 834 transitions. [2025-01-10 00:55:36,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45673603504928806 [2025-01-10 00:55:36,592 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 349 flow. Second operand 22 states and 834 transitions. [2025-01-10 00:55:36,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 893 flow [2025-01-10 00:55:36,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 856 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:36,596 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 550 flow [2025-01-10 00:55:36,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=550, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2025-01-10 00:55:36,598 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 23 predicate places. [2025-01-10 00:55:36,598 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 550 flow [2025-01-10 00:55:36,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.5) internal successors, (483), 14 states have internal predecessors, (483), 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,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:36,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:55:36,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2004021681, now seen corresponding path program 1 times [2025-01-10 00:55:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:36,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517332971] [2025-01-10 00:55:36,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:36,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:55:36,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:55:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:36,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:36,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517332971] [2025-01-10 00:55:36,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517332971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:55:36,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933994980] [2025-01-10 00:55:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:37,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2025-01-10 00:55:37,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 550 flow. Second operand has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 states have internal predecessors, (476), 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,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2025-01-10 00:55:37,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,744 INFO L124 PetriNetUnfolderBase]: 147/453 cut-off events. [2025-01-10 00:55:37,744 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2025-01-10 00:55:37,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 453 events. 147/453 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2412 event pairs, 27 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1380. Up to 72 conditions per place. [2025-01-10 00:55:37,747 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 62 selfloop transitions, 40 changer transitions 0/117 dead transitions. [2025-01-10 00:55:37,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 117 transitions, 846 flow [2025-01-10 00:55:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 499 transitions. [2025-01-10 00:55:37,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.501004016064257 [2025-01-10 00:55:37,749 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 550 flow. Second operand 12 states and 499 transitions. [2025-01-10 00:55:37,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 117 transitions, 846 flow [2025-01-10 00:55:37,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 117 transitions, 797 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-01-10 00:55:37,755 INFO L231 Difference]: Finished difference. Result has 112 places, 88 transitions, 602 flow [2025-01-10 00:55:37,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=602, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2025-01-10 00:55:37,756 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2025-01-10 00:55:37,756 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 602 flow [2025-01-10 00:55:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 states have internal predecessors, (476), 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,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:55:37,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1245081057, now seen corresponding path program 1 times [2025-01-10 00:55:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140337949] [2025-01-10 00:55:37,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:37,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:55:37,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:55:37,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,139 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,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140337949] [2025-01-10 00:55:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140337949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:55:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976178953] [2025-01-10 00:55:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:38,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:38,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:38,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-01-10 00:55:38,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 602 flow. Second operand has 13 states, 13 states have (on average 35.53846153846154) internal successors, (462), 13 states have internal predecessors, (462), 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,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-01-10 00:55:38,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,088 INFO L124 PetriNetUnfolderBase]: 185/545 cut-off events. [2025-01-10 00:55:39,088 INFO L125 PetriNetUnfolderBase]: For 1222/1222 co-relation queries the response was YES. [2025-01-10 00:55:39,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 545 events. 185/545 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3026 event pairs, 17 based on Foata normal form. 31/574 useless extension candidates. Maximal degree in co-relation 1767. Up to 97 conditions per place. [2025-01-10 00:55:39,091 INFO L140 encePairwiseOnDemand]: 66/83 looper letters, 98 selfloop transitions, 38 changer transitions 0/148 dead transitions. [2025-01-10 00:55:39,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 148 transitions, 1183 flow [2025-01-10 00:55:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:55:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 00:55:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 658 transitions. [2025-01-10 00:55:39,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954819277108434 [2025-01-10 00:55:39,096 INFO L175 Difference]: Start difference. First operand has 112 places, 88 transitions, 602 flow. Second operand 16 states and 658 transitions. [2025-01-10 00:55:39,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 148 transitions, 1183 flow [2025-01-10 00:55:39,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 148 transitions, 1067 flow, removed 1 selfloop flow, removed 12 redundant places. [2025-01-10 00:55:39,104 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 687 flow [2025-01-10 00:55:39,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=687, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2025-01-10 00:55:39,104 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 30 predicate places. [2025-01-10 00:55:39,104 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 687 flow [2025-01-10 00:55:39,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.53846153846154) internal successors, (462), 13 states have internal predecessors, (462), 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,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:39,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:55:39,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:39,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1245081056, now seen corresponding path program 1 times [2025-01-10 00:55:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553563436] [2025-01-10 00:55:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:39,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:55:39,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:55:39,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:55:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553563436] [2025-01-10 00:55:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553563436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:55:39,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882238886] [2025-01-10 00:55:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:39,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:40,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 00:55:40,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 687 flow. Second operand has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 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,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:40,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 00:55:40,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:40,653 INFO L124 PetriNetUnfolderBase]: 201/525 cut-off events. [2025-01-10 00:55:40,654 INFO L125 PetriNetUnfolderBase]: For 1370/1370 co-relation queries the response was YES. [2025-01-10 00:55:40,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 525 events. 201/525 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2677 event pairs, 20 based on Foata normal form. 25/548 useless extension candidates. Maximal degree in co-relation 1859. Up to 168 conditions per place. [2025-01-10 00:55:40,656 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 87 selfloop transitions, 30 changer transitions 11/136 dead transitions. [2025-01-10 00:55:40,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 1143 flow [2025-01-10 00:55:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 00:55:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 00:55:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 608 transitions. [2025-01-10 00:55:40,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4578313253012048 [2025-01-10 00:55:40,658 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 687 flow. Second operand 16 states and 608 transitions. [2025-01-10 00:55:40,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 1143 flow [2025-01-10 00:55:40,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 1114 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 00:55:40,663 INFO L231 Difference]: Finished difference. Result has 121 places, 85 transitions, 619 flow [2025-01-10 00:55:40,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=619, PETRI_PLACES=121, PETRI_TRANSITIONS=85} [2025-01-10 00:55:40,664 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 35 predicate places. [2025-01-10 00:55:40,664 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 85 transitions, 619 flow [2025-01-10 00:55:40,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 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,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:40,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:55:40,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:40,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -866987548, now seen corresponding path program 1 times [2025-01-10 00:55:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888828392] [2025-01-10 00:55:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:40,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:55:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:55:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:40,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:55:40,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:55:40,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:55:40,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:40,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:40,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:55:40,751 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:55:40,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2025-01-10 00:55:40,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2025-01-10 00:55:40,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2025-01-10 00:55:40,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2025-01-10 00:55:40,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2025-01-10 00:55:40,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2025-01-10 00:55:40,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2025-01-10 00:55:40,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2025-01-10 00:55:40,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2025-01-10 00:55:40,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2025-01-10 00:55:40,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2025-01-10 00:55:40,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:55:40,758 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:40,792 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:55:40,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:55:40,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:55:40 BasicIcfg [2025-01-10 00:55:40,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:55:40,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:55:40,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:55:40,799 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:55:40,800 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:27" (3/4) ... [2025-01-10 00:55:40,801 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:55:40,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:55:40,802 INFO L158 Benchmark]: Toolchain (without parser) took 14823.52ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 112.2MB in the beginning and 196.0MB in the end (delta: -83.8MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2025-01-10 00:55:40,802 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:40,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.33ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 74.0MB in the end (delta: 38.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 00:55:40,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 71.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:40,803 INFO L158 Benchmark]: Boogie Preprocessor took 41.22ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 69.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:40,804 INFO L158 Benchmark]: RCFGBuilder took 576.26ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 91.9MB in the end (delta: -22.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-01-10 00:55:40,804 INFO L158 Benchmark]: TraceAbstraction took 13595.55ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 91.9MB in the beginning and 196.1MB in the end (delta: -104.2MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:40,804 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 360.7MB. Free memory was 196.1MB in the beginning and 196.0MB in the end (delta: 46.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:40,805 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.33ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 74.0MB in the end (delta: 38.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 71.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.22ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 69.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 576.26ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 91.9MB in the end (delta: -22.6MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13595.55ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 91.9MB in the beginning and 196.1MB in the end (delta: -104.2MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 360.7MB. Free memory was 196.1MB in the beginning and 196.0MB in the end (delta: 46.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [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 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-5:0}, t1=-1] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={-5: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: -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: 1254]: 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. - 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, 113 locations, 54 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: 13.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4882 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3934 mSDsluCounter, 2168 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1972 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14077 IncrementalHoareTripleChecker+Invalid, 14407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 196 mSDtfsCounter, 14077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=15, InterpolantAutomatonStates: 131, 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, 4.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 3257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 1/1 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:40,823 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_04-list2_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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:42,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:42,794 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:42,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:42,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:42,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:42,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:42,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:42,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:42,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:42,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:42,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:42,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:42,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:42,831 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:42,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:42,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:42,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:42,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:42,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:42,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:42,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:42,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:42,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:42,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:42,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:42,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:42,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:42,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:42,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:42,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:42,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:42,834 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:55:42,835 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:55:42,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:42,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:42,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:42,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:42,835 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-01-10 00:55:43,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:43,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:43,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:43,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:43,120 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:43,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-01-10 00:55:44,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2a73a90c/5d51a8cc47f241cba5700eaf56c9ed04/FLAG58ae2b1be [2025-01-10 00:55:44,552 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:44,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-01-10 00:55:44,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2a73a90c/5d51a8cc47f241cba5700eaf56c9ed04/FLAG58ae2b1be [2025-01-10 00:55:44,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2a73a90c/5d51a8cc47f241cba5700eaf56c9ed04 [2025-01-10 00:55:44,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:44,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:44,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:44,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:44,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:44,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:44" (1/1) ... [2025-01-10 00:55:44,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473a7852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:44, skipping insertion in model container [2025-01-10 00:55:44,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:44" (1/1) ... [2025-01-10 00:55:44,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:45,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:45,290 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:45,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:45,434 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:45,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45 WrapperNode [2025-01-10 00:55:45,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:45,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:45,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:45,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:45,442 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:45" (1/1) ... [2025-01-10 00:55:45,462 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:45" (1/1) ... [2025-01-10 00:55:45,487 INFO L138 Inliner]: procedures = 369, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2025-01-10 00:55:45,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:45,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:45,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:45,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:45,497 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:45" (1/1) ... [2025-01-10 00:55:45,498 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:45" (1/1) ... [2025-01-10 00:55:45,506 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:45" (1/1) ... [2025-01-10 00:55:45,525 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-01-10 00:55:45,526 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:45" (1/1) ... [2025-01-10 00:55:45,526 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:45" (1/1) ... [2025-01-10 00:55:45,542 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:45" (1/1) ... [2025-01-10 00:55:45,543 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:45" (1/1) ... [2025-01-10 00:55:45,546 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:45" (1/1) ... [2025-01-10 00:55:45,549 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:45" (1/1) ... [2025-01-10 00:55:45,550 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:45" (1/1) ... [2025-01-10 00:55:45,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:45,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:45,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:45,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:45,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45" (1/1) ... [2025-01-10 00:55:45,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:45,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:45,593 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:45,596 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:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-10 00:55:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-10 00:55:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-10 00:55:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-10 00:55:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:45,617 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:45,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:45,619 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:45,761 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:45,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:46,194 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:46,194 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:46,384 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:46,384 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:46,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:46 BoogieIcfgContainer [2025-01-10 00:55:46,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:46,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:46,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:46,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:46,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:44" (1/3) ... [2025-01-10 00:55:46,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fad3fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:46, skipping insertion in model container [2025-01-10 00:55:46,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:45" (2/3) ... [2025-01-10 00:55:46,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fad3fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:46, skipping insertion in model container [2025-01-10 00:55:46,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:46" (3/3) ... [2025-01-10 00:55:46,394 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-01-10 00:55:46,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:46,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 84 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-01-10 00:55:46,419 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:46,471 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:46,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2025-01-10 00:55:46,530 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-01-10 00:55:46,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:46,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-10 00:55:46,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2025-01-10 00:55:46,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2025-01-10 00:55:46,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:46,553 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;@754a6191, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:46,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-01-10 00:55:46,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:46,556 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:55:46,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:46,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:46,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:46,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:46,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash 11348, now seen corresponding path program 1 times [2025-01-10 00:55:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364503248] [2025-01-10 00:55:46,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:46,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:46,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:46,575 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:46,577 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:46,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:46,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:46,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:46,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:55:46,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:46,721 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:46,733 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:46,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:46,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364503248] [2025-01-10 00:55:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364503248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77823119] [2025-01-10 00:55:46,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:46,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:46,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:46,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-01-10 00:55:46,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:46,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:46,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-01-10 00:55:46,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:47,094 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2025-01-10 00:55:47,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:47,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2025-01-10 00:55:47,099 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-01-10 00:55:47,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2025-01-10 00:55:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 00:55:47,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2025-01-10 00:55:47,114 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2025-01-10 00:55:47,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2025-01-10 00:55:47,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:47,123 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2025-01-10 00:55:47,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2025-01-10 00:55:47,131 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2025-01-10 00:55:47,132 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2025-01-10 00:55:47,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:47,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:47,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:47,141 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:47,338 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:47,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:47,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 11349, now seen corresponding path program 1 times [2025-01-10 00:55:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:47,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360225360] [2025-01-10 00:55:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:47,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:47,342 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:47,343 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:47,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:47,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:47,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:47,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:47,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:55:47,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:47,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:47,424 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:47,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:47,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:47,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360225360] [2025-01-10 00:55:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360225360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896421644] [2025-01-10 00:55:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:47,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:47,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:47,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:47,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-01-10 00:55:47,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:47,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:47,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-01-10 00:55:47,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:47,728 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2025-01-10 00:55:47,730 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:47,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1810 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2025-01-10 00:55:47,732 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-01-10 00:55:47,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2025-01-10 00:55:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-01-10 00:55:47,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2025-01-10 00:55:47,734 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2025-01-10 00:55:47,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2025-01-10 00:55:47,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:47,736 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2025-01-10 00:55:47,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2025-01-10 00:55:47,737 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2025-01-10 00:55:47,737 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2025-01-10 00:55:47,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:47,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:47,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:47,745 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:47,938 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:47,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:47,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025205, now seen corresponding path program 1 times [2025-01-10 00:55:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:47,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612365098] [2025-01-10 00:55:47,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:47,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:47,942 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:47,943 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:48,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:48,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:48,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:55:48,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:48,033 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:48,041 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:48,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:48,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:48,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612365098] [2025-01-10 00:55:48,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612365098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:48,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973068699] [2025-01-10 00:55:48,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:48,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:48,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:48,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:48,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:48,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-01-10 00:55:48,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-01-10 00:55:48,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,221 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2025-01-10 00:55:48,221 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:48,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 392 events. 110/392 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1994 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 248 conditions per place. [2025-01-10 00:55:48,224 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-01-10 00:55:48,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 194 flow [2025-01-10 00:55:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-01-10 00:55:48,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2025-01-10 00:55:48,225 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 3 states and 185 transitions. [2025-01-10 00:55:48,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 194 flow [2025-01-10 00:55:48,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:48,227 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 130 flow [2025-01-10 00:55:48,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-01-10 00:55:48,227 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -18 predicate places. [2025-01-10 00:55:48,227 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 130 flow [2025-01-10 00:55:48,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:48,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:55:48,234 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:48,432 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:48,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025206, now seen corresponding path program 1 times [2025-01-10 00:55:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335062062] [2025-01-10 00:55:48,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:48,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:48,434 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:48,435 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:48,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:55:48,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:55:48,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:55:48,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:48,518 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:48,534 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:48,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:48,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:48,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335062062] [2025-01-10 00:55:48,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335062062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:48,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:48,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94574175] [2025-01-10 00:55:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:48,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:48,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:48,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:48,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2025-01-10 00:55:48,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:48,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2025-01-10 00:55:48,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,734 INFO L124 PetriNetUnfolderBase]: 99/352 cut-off events. [2025-01-10 00:55:48,734 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:48,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 352 events. 99/352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1744 event pairs, 99 based on Foata normal form. 11/312 useless extension candidates. Maximal degree in co-relation 575. Up to 225 conditions per place. [2025-01-10 00:55:48,736 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-01-10 00:55:48,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 180 flow [2025-01-10 00:55:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-01-10 00:55:48,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2025-01-10 00:55:48,737 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 130 flow. Second operand 3 states and 187 transitions. [2025-01-10 00:55:48,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 180 flow [2025-01-10 00:55:48,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:48,738 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2025-01-10 00:55:48,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-01-10 00:55:48,739 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2025-01-10 00:55:48,739 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2025-01-10 00:55:48,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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:48,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:48,748 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:48,940 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:48,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 147380253, now seen corresponding path program 1 times [2025-01-10 00:55:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629537547] [2025-01-10 00:55:48,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:48,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:48,943 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:48,944 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:49,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:55:49,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:55:49,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:49,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:55:49,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:49,074 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:55:49,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:55:49,087 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:49,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:49,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629537547] [2025-01-10 00:55:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629537547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:49,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160526120] [2025-01-10 00:55:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:49,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:49,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:49,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:49,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:49,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2025-01-10 00:55:49,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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:49,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:49,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2025-01-10 00:55:49,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:49,407 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2025-01-10 00:55:49,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:49,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 357 events. 110/357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1712 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 606. Up to 246 conditions per place. [2025-01-10 00:55:49,409 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-01-10 00:55:49,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 185 flow [2025-01-10 00:55:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-01-10 00:55:49,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746987951807228 [2025-01-10 00:55:49,411 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 4 states and 224 transitions. [2025-01-10 00:55:49,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 185 flow [2025-01-10 00:55:49,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:49,412 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 122 flow [2025-01-10 00:55:49,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-01-10 00:55:49,412 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -21 predicate places. [2025-01-10 00:55:49,412 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 122 flow [2025-01-10 00:55:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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:49,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:49,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:49,420 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:49,613 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:49,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash 147380254, now seen corresponding path program 1 times [2025-01-10 00:55:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927374253] [2025-01-10 00:55:49,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:49,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:49,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:49,617 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:49,618 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:49,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:55:49,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:55:49,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:49,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:55:49,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:49,710 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:49,740 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:55:49,740 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 12 treesize of output 14 [2025-01-10 00:55:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:49,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:49,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927374253] [2025-01-10 00:55:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927374253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:49,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:49,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295108209] [2025-01-10 00:55:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:49,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:49,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:49,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:49,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2025-01-10 00:55:49,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:49,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:49,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2025-01-10 00:55:49,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:49,955 INFO L124 PetriNetUnfolderBase]: 99/326 cut-off events. [2025-01-10 00:55:49,955 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:49,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 326 events. 99/326 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1516 event pairs, 99 based on Foata normal form. 12/308 useless extension candidates. Maximal degree in co-relation 551. Up to 223 conditions per place. [2025-01-10 00:55:49,957 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-01-10 00:55:49,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 172 flow [2025-01-10 00:55:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-01-10 00:55:49,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2025-01-10 00:55:49,958 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 122 flow. Second operand 3 states and 187 transitions. [2025-01-10 00:55:49,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 172 flow [2025-01-10 00:55:49,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:49,959 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 115 flow [2025-01-10 00:55:49,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-01-10 00:55:49,960 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -24 predicate places. [2025-01-10 00:55:49,960 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 115 flow [2025-01-10 00:55:49,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:49,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:49,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:49,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:55:50,160 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:50,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1015971961, now seen corresponding path program 1 times [2025-01-10 00:55:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:50,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47404599] [2025-01-10 00:55:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:50,166 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:50,167 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:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:50,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:50,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:50,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:50,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 00:55:50,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:50,299 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:50,325 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:55:50,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:55:50,412 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-01-10 00:55:50,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-01-10 00:55:50,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:50,480 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 42 treesize of output 33 [2025-01-10 00:55:50,555 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 42 treesize of output 33 [2025-01-10 00:55:50,613 INFO L349 Elim1Store]: treesize reduction 84, result has 35.4 percent of original size [2025-01-10 00:55:50,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 71 [2025-01-10 00:55:50,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-01-10 00:55:50,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-01-10 00:55:50,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2025-01-10 00:55:51,501 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 53 treesize of output 23 [2025-01-10 00:55:51,581 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:51,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:51,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47404599] [2025-01-10 00:55:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47404599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:55:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432340522] [2025-01-10 00:55:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:51,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:55:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:51,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:55:51,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:55:53,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-01-10 00:55:53,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 115 flow. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 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:53,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:53,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-01-10 00:55:53,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:54,939 INFO L124 PetriNetUnfolderBase]: 167/488 cut-off events. [2025-01-10 00:55:54,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:54,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 488 events. 167/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2508 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 860. Up to 101 conditions per place. [2025-01-10 00:55:54,942 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 64 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2025-01-10 00:55:54,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 383 flow [2025-01-10 00:55:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 467 transitions. [2025-01-10 00:55:54,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46887550200803213 [2025-01-10 00:55:54,943 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 115 flow. Second operand 12 states and 467 transitions. [2025-01-10 00:55:54,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 383 flow [2025-01-10 00:55:54,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:54,947 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 209 flow [2025-01-10 00:55:54,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 00:55:54,947 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2025-01-10 00:55:54,947 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 209 flow [2025-01-10 00:55:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 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:54,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:54,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:54,955 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:55,148 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:55,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:55,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1015971960, now seen corresponding path program 1 times [2025-01-10 00:55:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215364457] [2025-01-10 00:55:55,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:55,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:55,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:55,152 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:55,153 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:55,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:55,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:55,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:55,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:55,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 00:55:55,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:55,273 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:55,286 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:55,322 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:55,322 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:55,347 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:55:55,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:55:55,397 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:55,414 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-10 00:55:55,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 20 [2025-01-10 00:55:55,427 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:55,461 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-01-10 00:55:55,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-01-10 00:55:55,521 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:55,528 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 53 treesize of output 42 [2025-01-10 00:55:55,554 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:55,565 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 53 treesize of output 42 [2025-01-10 00:55:55,580 INFO L349 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2025-01-10 00:55:55,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2025-01-10 00:55:55,601 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:55:55,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2025-01-10 00:55:55,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 50 treesize of output 39 [2025-01-10 00:55:55,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:55,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 50 treesize of output 39 [2025-01-10 00:55:55,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:55,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 50 treesize of output 39 [2025-01-10 00:55:55,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 00:55:56,011 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 51 treesize of output 21 [2025-01-10 00:55:56,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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:56,052 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:56,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:56,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215364457] [2025-01-10 00:55:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215364457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:56,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:56,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763059369] [2025-01-10 00:55:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:56,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:56,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:56,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:57,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2025-01-10 00:55:57,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 209 flow. Second operand has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 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:57,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:57,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2025-01-10 00:55:57,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:58,166 INFO L124 PetriNetUnfolderBase]: 176/487 cut-off events. [2025-01-10 00:55:58,166 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-01-10 00:55:58,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 487 events. 176/487 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2518 event pairs, 2 based on Foata normal form. 15/474 useless extension candidates. Maximal degree in co-relation 1051. Up to 247 conditions per place. [2025-01-10 00:55:58,168 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 66 selfloop transitions, 15 changer transitions 0/94 dead transitions. [2025-01-10 00:55:58,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 443 flow [2025-01-10 00:55:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:55:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:55:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 448 transitions. [2025-01-10 00:55:58,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5997322623828648 [2025-01-10 00:55:58,170 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 209 flow. Second operand 9 states and 448 transitions. [2025-01-10 00:55:58,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 443 flow [2025-01-10 00:55:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:58,172 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 247 flow [2025-01-10 00:55:58,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2025-01-10 00:55:58,173 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -8 predicate places. [2025-01-10 00:55:58,173 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 247 flow [2025-01-10 00:55:58,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 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:58,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:58,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:58,183 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:58,375 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:58,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:55:58,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1049749605, now seen corresponding path program 1 times [2025-01-10 00:55:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:55:58,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621613101] [2025-01-10 00:55:58,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:58,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:58,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:58,378 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:58,379 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:58,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:58,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:58,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:58,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:58,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 00:55:58,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:58,503 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:58,509 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:58,543 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:58,544 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:58,562 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-01-10 00:55:58,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-01-10 00:55:58,624 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-01-10 00:55:58,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-01-10 00:55:58,637 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 13 treesize of output 9 [2025-01-10 00:55:58,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 00:55:58,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:58,695 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 53 treesize of output 42 [2025-01-10 00:55:58,709 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:58,756 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 53 treesize of output 42 [2025-01-10 00:55:58,777 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-01-10 00:55:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-01-10 00:55:58,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2025-01-10 00:55:58,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:58,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-01-10 00:55:58,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-01-10 00:55:58,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:58,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-01-10 00:55:58,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:59,103 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 41 treesize of output 17 [2025-01-10 00:55:59,109 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:59,138 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:59,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:55:59,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:55:59,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621613101] [2025-01-10 00:55:59,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621613101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:59,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:59,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:55:59,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772569500] [2025-01-10 00:55:59,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:59,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:55:59,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:55:59,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:55:59,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:56:00,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 00:56:00,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 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:56:00,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:00,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 00:56:00,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:01,485 INFO L124 PetriNetUnfolderBase]: 176/489 cut-off events. [2025-01-10 00:56:01,485 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-01-10 00:56:01,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 489 events. 176/489 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2473 event pairs, 46 based on Foata normal form. 12/471 useless extension candidates. Maximal degree in co-relation 1083. Up to 211 conditions per place. [2025-01-10 00:56:01,488 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 71 selfloop transitions, 18 changer transitions 0/105 dead transitions. [2025-01-10 00:56:01,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 105 transitions, 511 flow [2025-01-10 00:56:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:56:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:56:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 470 transitions. [2025-01-10 00:56:01,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4718875502008032 [2025-01-10 00:56:01,490 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 247 flow. Second operand 12 states and 470 transitions. [2025-01-10 00:56:01,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 105 transitions, 511 flow [2025-01-10 00:56:01,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 105 transitions, 497 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:56:01,492 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 291 flow [2025-01-10 00:56:01,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=291, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2025-01-10 00:56:01,493 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2025-01-10 00:56:01,494 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 291 flow [2025-01-10 00:56:01,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 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:56:01,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:01,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:01,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 00:56:01,698 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:56:01,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1978687745, now seen corresponding path program 1 times [2025-01-10 00:56:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:01,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987518874] [2025-01-10 00:56:01,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:01,701 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:56:01,703 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:56:01,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:56:01,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:56:01,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:01,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:01,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:56:01,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:01,803 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 11 treesize of output 9 [2025-01-10 00:56:01,812 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:56:01,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:01,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987518874] [2025-01-10 00:56:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987518874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:01,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:56:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221182302] [2025-01-10 00:56:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:01,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:56:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:01,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:56:01,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:56:01,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2025-01-10 00:56:01,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:56:01,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:01,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2025-01-10 00:56:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:01,963 INFO L124 PetriNetUnfolderBase]: 107/351 cut-off events. [2025-01-10 00:56:01,963 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-01-10 00:56:01,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 351 events. 107/351 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1776 event pairs, 49 based on Foata normal form. 6/342 useless extension candidates. Maximal degree in co-relation 811. Up to 174 conditions per place. [2025-01-10 00:56:01,966 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 57 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-01-10 00:56:01,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 482 flow [2025-01-10 00:56:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:56:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:56:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-01-10 00:56:01,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2025-01-10 00:56:01,968 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 291 flow. Second operand 3 states and 213 transitions. [2025-01-10 00:56:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 482 flow [2025-01-10 00:56:01,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 88 transitions, 409 flow, removed 4 selfloop flow, removed 12 redundant places. [2025-01-10 00:56:01,971 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 245 flow [2025-01-10 00:56:01,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2025-01-10 00:56:01,971 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -8 predicate places. [2025-01-10 00:56:01,973 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 245 flow [2025-01-10 00:56:01,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:56:01,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:01,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:01,982 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:56:02,174 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:56:02,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2002413156, now seen corresponding path program 1 times [2025-01-10 00:56:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:02,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109025424] [2025-01-10 00:56:02,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:02,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:02,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:02,177 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:56:02,178 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:56:02,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:56:02,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:56:02,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:02,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:02,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 00:56:02,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:02,294 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:56:02,314 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:56:02,321 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:56:02,372 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 21 treesize of output 9 [2025-01-10 00:56:02,375 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:56:02,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:02,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109025424] [2025-01-10 00:56:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109025424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:02,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:56:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314933217] [2025-01-10 00:56:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:56:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:02,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:56:02,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:56:02,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-01-10 00:56:02,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:56:02,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:02,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-01-10 00:56:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:02,743 INFO L124 PetriNetUnfolderBase]: 143/452 cut-off events. [2025-01-10 00:56:02,743 INFO L125 PetriNetUnfolderBase]: For 138/139 co-relation queries the response was YES. [2025-01-10 00:56:02,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 452 events. 143/452 cut-off events. For 138/139 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2410 event pairs, 13 based on Foata normal form. 10/442 useless extension candidates. Maximal degree in co-relation 1019. Up to 183 conditions per place. [2025-01-10 00:56:02,745 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 59 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2025-01-10 00:56:02,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 92 transitions, 473 flow [2025-01-10 00:56:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:56:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:56:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-01-10 00:56:02,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2025-01-10 00:56:02,746 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 245 flow. Second operand 5 states and 305 transitions. [2025-01-10 00:56:02,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 92 transitions, 473 flow [2025-01-10 00:56:02,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 92 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:56:02,749 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 298 flow [2025-01-10 00:56:02,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2025-01-10 00:56:02,750 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -3 predicate places. [2025-01-10 00:56:02,750 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 298 flow [2025-01-10 00:56:02,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:56:02,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:02,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:02,763 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:56:02,955 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:56:02,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:02,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2002413157, now seen corresponding path program 1 times [2025-01-10 00:56:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:02,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759215854] [2025-01-10 00:56:02,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:02,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:02,958 INFO L229 MonitoredProcess]: Starting monitored process 13 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:56:02,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:56:03,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:56:03,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:56:03,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:03,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 00:56:03,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:03,100 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:56:03,122 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:56:03,123 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:56:03,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:03,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759215854] [2025-01-10 00:56:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759215854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:03,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:03,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:56:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088824945] [2025-01-10 00:56:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:03,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:56:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:03,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:56:03,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:56:03,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2025-01-10 00:56:03,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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:56:03,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:03,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2025-01-10 00:56:03,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:03,609 INFO L124 PetriNetUnfolderBase]: 143/440 cut-off events. [2025-01-10 00:56:03,609 INFO L125 PetriNetUnfolderBase]: For 236/237 co-relation queries the response was YES. [2025-01-10 00:56:03,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 440 events. 143/440 cut-off events. For 236/237 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2300 event pairs, 58 based on Foata normal form. 11/435 useless extension candidates. Maximal degree in co-relation 1078. Up to 191 conditions per place. [2025-01-10 00:56:03,611 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 49 selfloop transitions, 21 changer transitions 0/89 dead transitions. [2025-01-10 00:56:03,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 494 flow [2025-01-10 00:56:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:56:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:56:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-01-10 00:56:03,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7048192771084337 [2025-01-10 00:56:03,613 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 298 flow. Second operand 6 states and 351 transitions. [2025-01-10 00:56:03,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 494 flow [2025-01-10 00:56:03,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 89 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:56:03,615 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 378 flow [2025-01-10 00:56:03,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=378, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-01-10 00:56:03,616 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2025-01-10 00:56:03,616 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 378 flow [2025-01-10 00:56:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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:56:03,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:03,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:03,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:56:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:03,821 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:03,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -463376633, now seen corresponding path program 1 times [2025-01-10 00:56:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157870199] [2025-01-10 00:56:03,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:03,824 INFO L229 MonitoredProcess]: Starting monitored process 14 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:56:03,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 00:56:03,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:56:03,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:56:03,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:03,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:56:03,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:03,948 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:56:03,957 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 00:56:03,957 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:56:03,975 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:56:03,989 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:56:03,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:56:04,016 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 19 treesize of output 14 [2025-01-10 00:56:04,028 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-01-10 00:56:04,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:56:04,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 00:56:04,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 00:56:04,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 14 [2025-01-10 00:56:04,076 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 19 treesize of output 14 [2025-01-10 00:56:04,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:56:04,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2025-01-10 00:56:04,168 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 33 treesize of output 15 [2025-01-10 00:56:04,170 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:56:04,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:04,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157870199] [2025-01-10 00:56:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157870199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:56:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350657868] [2025-01-10 00:56:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:04,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:56:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:04,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:56:04,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:56:04,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2025-01-10 00:56:04,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 378 flow. Second operand has 11 states, 11 states have (on average 44.90909090909091) internal successors, (494), 11 states have internal predecessors, (494), 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:56:04,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:04,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2025-01-10 00:56:04,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:05,180 INFO L124 PetriNetUnfolderBase]: 153/462 cut-off events. [2025-01-10 00:56:05,180 INFO L125 PetriNetUnfolderBase]: For 642/642 co-relation queries the response was YES. [2025-01-10 00:56:05,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 462 events. 153/462 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2434 event pairs, 27 based on Foata normal form. 6/452 useless extension candidates. Maximal degree in co-relation 1307. Up to 72 conditions per place. [2025-01-10 00:56:05,182 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 63 selfloop transitions, 35 changer transitions 2/115 dead transitions. [2025-01-10 00:56:05,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 115 transitions, 762 flow [2025-01-10 00:56:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:56:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:56:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 596 transitions. [2025-01-10 00:56:05,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5983935742971888 [2025-01-10 00:56:05,184 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 378 flow. Second operand 12 states and 596 transitions. [2025-01-10 00:56:05,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 115 transitions, 762 flow [2025-01-10 00:56:05,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 718 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:56:05,187 INFO L231 Difference]: Finished difference. Result has 100 places, 81 transitions, 499 flow [2025-01-10 00:56:05,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=499, PETRI_PLACES=100, PETRI_TRANSITIONS=81} [2025-01-10 00:56:05,188 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 14 predicate places. [2025-01-10 00:56:05,188 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 81 transitions, 499 flow [2025-01-10 00:56:05,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 44.90909090909091) internal successors, (494), 11 states have internal predecessors, (494), 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:56:05,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:05,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:05,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 00:56:05,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:05,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1249020614, now seen corresponding path program 1 times [2025-01-10 00:56:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:05,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147453729] [2025-01-10 00:56:05,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:05,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:05,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:05,392 INFO L229 MonitoredProcess]: Starting monitored process 15 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:56:05,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 00:56:05,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:56:05,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:56:05,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:05,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:05,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 00:56:05,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:05,543 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:56:05,564 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-01-10 00:56:05,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-01-10 00:56:05,598 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:56:05,631 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-01-10 00:56:05,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-01-10 00:56:05,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:56:05,691 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:56:05,699 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 42 treesize of output 33 [2025-01-10 00:56:05,754 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 42 treesize of output 33 [2025-01-10 00:56:05,775 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-01-10 00:56:05,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-01-10 00:56:05,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:56:05,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-01-10 00:56:05,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:56:05,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-01-10 00:56:05,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:56:05,905 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 29 treesize of output 22 [2025-01-10 00:56:05,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 00:56:06,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-10 00:56:06,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-10 00:56:06,020 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 13 [2025-01-10 00:56:06,074 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:56:06,077 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:56:06,092 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:56:06,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:06,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147453729] [2025-01-10 00:56:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147453729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:06,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:06,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:56:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181390971] [2025-01-10 00:56:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:06,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:56:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:06,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:56:06,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:56:07,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-01-10 00:56:07,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 81 transitions, 499 flow. Second operand has 13 states, 13 states have (on average 32.61538461538461) internal successors, (424), 13 states have internal predecessors, (424), 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:56:07,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:07,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-01-10 00:56:07,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:08,265 INFO L124 PetriNetUnfolderBase]: 175/503 cut-off events. [2025-01-10 00:56:08,266 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-01-10 00:56:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 503 events. 175/503 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2650 event pairs, 25 based on Foata normal form. 7/492 useless extension candidates. Maximal degree in co-relation 1555. Up to 133 conditions per place. [2025-01-10 00:56:08,269 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 79 selfloop transitions, 31 changer transitions 0/122 dead transitions. [2025-01-10 00:56:08,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 122 transitions, 854 flow [2025-01-10 00:56:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:56:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 00:56:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 525 transitions. [2025-01-10 00:56:08,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45180722891566266 [2025-01-10 00:56:08,270 INFO L175 Difference]: Start difference. First operand has 100 places, 81 transitions, 499 flow. Second operand 14 states and 525 transitions. [2025-01-10 00:56:08,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 122 transitions, 854 flow [2025-01-10 00:56:08,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 122 transitions, 829 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 00:56:08,274 INFO L231 Difference]: Finished difference. Result has 109 places, 84 transitions, 568 flow [2025-01-10 00:56:08,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=568, PETRI_PLACES=109, PETRI_TRANSITIONS=84} [2025-01-10 00:56:08,275 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 23 predicate places. [2025-01-10 00:56:08,275 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 84 transitions, 568 flow [2025-01-10 00:56:08,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.61538461538461) internal successors, (424), 13 states have internal predecessors, (424), 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:56:08,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:08,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:08,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 00:56:08,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:08,477 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1669892833, now seen corresponding path program 1 times [2025-01-10 00:56:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495594749] [2025-01-10 00:56:08,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:08,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:08,479 INFO L229 MonitoredProcess]: Starting monitored process 16 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:56:08,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 00:56:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:56:08,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:56:08,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:08,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:08,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:56:08,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:08,619 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:56:08,638 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:56:08,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:56:08,662 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:56:08,698 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2025-01-10 00:56:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 00:56:08,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:56:08,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 00:56:08,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:56:08,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-10 00:56:08,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:56:08,947 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:56:08,977 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 35 treesize of output 19 [2025-01-10 00:56:09,017 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 27 treesize of output 15 [2025-01-10 00:56:09,031 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:56:09,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:09,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:09,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495594749] [2025-01-10 00:56:09,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495594749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:09,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:56:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876815975] [2025-01-10 00:56:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:09,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:56:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:09,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:56:09,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:56:10,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-01-10 00:56:10,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 84 transitions, 568 flow. Second operand has 12 states, 12 states have (on average 32.666666666666664) internal successors, (392), 12 states have internal predecessors, (392), 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:56:10,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:10,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-01-10 00:56:10,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:11,080 INFO L124 PetriNetUnfolderBase]: 165/488 cut-off events. [2025-01-10 00:56:11,080 INFO L125 PetriNetUnfolderBase]: For 1064/1064 co-relation queries the response was YES. [2025-01-10 00:56:11,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 488 events. 165/488 cut-off events. For 1064/1064 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2563 event pairs, 5 based on Foata normal form. 19/505 useless extension candidates. Maximal degree in co-relation 1572. Up to 118 conditions per place. [2025-01-10 00:56:11,083 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 87 selfloop transitions, 34 changer transitions 0/133 dead transitions. [2025-01-10 00:56:11,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 133 transitions, 1036 flow [2025-01-10 00:56:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 00:56:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 00:56:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 664 transitions. [2025-01-10 00:56:11,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-10 00:56:11,084 INFO L175 Difference]: Start difference. First operand has 109 places, 84 transitions, 568 flow. Second operand 18 states and 664 transitions. [2025-01-10 00:56:11,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 133 transitions, 1036 flow [2025-01-10 00:56:11,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 133 transitions, 945 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-01-10 00:56:11,088 INFO L231 Difference]: Finished difference. Result has 112 places, 87 transitions, 590 flow [2025-01-10 00:56:11,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=590, PETRI_PLACES=112, PETRI_TRANSITIONS=87} [2025-01-10 00:56:11,089 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2025-01-10 00:56:11,089 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 590 flow [2025-01-10 00:56:11,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.666666666666664) internal successors, (392), 12 states have internal predecessors, (392), 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:56:11,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:11,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:11,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 00:56:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:11,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1669892832, now seen corresponding path program 1 times [2025-01-10 00:56:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653842900] [2025-01-10 00:56:11,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:11,293 INFO L229 MonitoredProcess]: Starting monitored process 17 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:56:11,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 00:56:11,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:56:11,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:56:11,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:11,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:11,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 00:56:11,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:11,429 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:56:11,444 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-01-10 00:56:11,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 00:56:11,485 INFO L349 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-01-10 00:56:11,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2025-01-10 00:56:11,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:56:11,536 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 42 treesize of output 33 [2025-01-10 00:56:11,595 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:56:11,601 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 42 treesize of output 33 [2025-01-10 00:56:11,626 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-01-10 00:56:11,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-01-10 00:56:11,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 39 treesize of output 30 [2025-01-10 00:56:11,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-01-10 00:56:11,754 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 13 treesize of output 9 [2025-01-10 00:56:11,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2025-01-10 00:56:12,041 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-01-10 00:56:12,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 98 [2025-01-10 00:56:12,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-01-10 00:56:12,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 29 [2025-01-10 00:56:12,250 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:56:12,271 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:56:12,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:12,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:56:12,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653842900] [2025-01-10 00:56:12,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653842900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:12,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:12,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:56:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566044379] [2025-01-10 00:56:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:12,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:56:12,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:56:12,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:56:12,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:56:14,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-01-10 00:56:14,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 87 transitions, 590 flow. Second operand has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 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:56:14,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:14,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-01-10 00:56:14,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:16,143 INFO L124 PetriNetUnfolderBase]: 193/516 cut-off events. [2025-01-10 00:56:16,144 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2025-01-10 00:56:16,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 516 events. 193/516 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2596 event pairs, 5 based on Foata normal form. 23/537 useless extension candidates. Maximal degree in co-relation 1714. Up to 92 conditions per place. [2025-01-10 00:56:16,155 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 79 selfloop transitions, 51 changer transitions 13/151 dead transitions. [2025-01-10 00:56:16,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 151 transitions, 1147 flow [2025-01-10 00:56:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 00:56:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 00:56:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 730 transitions. [2025-01-10 00:56:16,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41881812966150317 [2025-01-10 00:56:16,157 INFO L175 Difference]: Start difference. First operand has 112 places, 87 transitions, 590 flow. Second operand 21 states and 730 transitions. [2025-01-10 00:56:16,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 151 transitions, 1147 flow [2025-01-10 00:56:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 151 transitions, 1102 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-01-10 00:56:16,164 INFO L231 Difference]: Finished difference. Result has 119 places, 87 transitions, 642 flow [2025-01-10 00:56:16,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=642, PETRI_PLACES=119, PETRI_TRANSITIONS=87} [2025-01-10 00:56:16,165 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2025-01-10 00:56:16,165 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 87 transitions, 642 flow [2025-01-10 00:56:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 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:56:16,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:16,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:16,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 00:56:16,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:16,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2025-01-10 00:56:16,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1089211100, now seen corresponding path program 1 times [2025-01-10 00:56:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:56:16,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888126216] [2025-01-10 00:56:16,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:16,370 INFO L229 MonitoredProcess]: Starting monitored process 18 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:56:16,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 00:56:16,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:56:21,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:56:21,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:21,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:56:21,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:56:22,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:56:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:56:24,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:24,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:56:24,666 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:56:24,666 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:56:24,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2025-01-10 00:56:24,668 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2025-01-10 00:56:24,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2025-01-10 00:56:24,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2025-01-10 00:56:24,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2025-01-10 00:56:24,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 00:56:24,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:24,872 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:56:24,902 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:56:24,902 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:56:24,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:56:24 BasicIcfg [2025-01-10 00:56:24,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:56:24,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:56:24,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:56:24,909 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:56:24,909 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:46" (3/4) ... [2025-01-10 00:56:24,911 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:56:24,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:56:24,912 INFO L158 Benchmark]: Toolchain (without parser) took 40010.47ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 57.7MB in the beginning and 101.7MB in the end (delta: -44.0MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-01-10 00:56:24,912 INFO L158 Benchmark]: CDTParser took 1.74ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:56:24,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.64ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 54.7MB in the end (delta: 2.7MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-01-10 00:56:24,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.48ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 52.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:56:24,913 INFO L158 Benchmark]: Boogie Preprocessor took 67.50ms. Allocated memory is still 83.9MB. Free memory was 52.0MB in the beginning and 49.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:56:24,913 INFO L158 Benchmark]: RCFGBuilder took 827.24ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 31.2MB in the end (delta: 17.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-01-10 00:56:24,914 INFO L158 Benchmark]: TraceAbstraction took 38522.18ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 30.4MB in the beginning and 101.7MB in the end (delta: -71.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2025-01-10 00:56:24,914 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 101.7MB in the end (delta: 6.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:56:24,915 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.74ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.64ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 54.7MB in the end (delta: 2.7MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.48ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 52.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.50ms. Allocated memory is still 83.9MB. Free memory was 52.0MB in the beginning and 49.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 827.24ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 31.2MB in the end (delta: 17.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38522.18ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 30.4MB in the beginning and 101.7MB in the end (delta: -71.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 101.7MB in the end (delta: 6.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [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 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-687865857:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-687865857:0}, A_mutex={1:0}, B={134217728:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-687865857:0}, A_mutex={1:0}, B={134217728:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-687865857:0}, A_mutex={1:0}, B={134217728:0}, B_mutex={2:0}, \old(arg)={0:0}, p={262144:0}, t1=0] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-687865857:0}, A_mutex={1:0}, B={134217728:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={262144: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: -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: 1254]: 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. - 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, 113 locations, 54 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: 38.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4330 SdHoareTripleChecker+Valid, 15.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3378 mSDsluCounter, 2036 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1689 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10765 IncrementalHoareTripleChecker+Invalid, 11032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 347 mSDtfsCounter, 10765 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=642occurred in iteration=16, InterpolantAutomatonStates: 131, 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, 6.1s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 238 ConstructedInterpolants, 28 QuantifiedInterpolants, 6008 SizeOfPredicates, 102 NumberOfNonLiveVariables, 3283 ConjunctsInSsa, 290 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:56:24,941 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