./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_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_11-arraylist_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 c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:28,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:28,705 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:28,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:28,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:28,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:28,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:28,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:28,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:28,745 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:28,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:28,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:28,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:28,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:28,747 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:28,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:28,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:28,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:28,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:28,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:28,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:28,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:28,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:28,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:28,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:28,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:28,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:28,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:28,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:28,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:28,751 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 -> c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 [2025-01-10 00:55:29,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:29,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:29,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:29,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:29,081 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:29,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-01-10 00:55:30,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b222b5294/da9d7a8bd9d04c2dbed8a1a3f3d16570/FLAG4947924bf [2025-01-10 00:55:30,836 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:30,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-01-10 00:55:30,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b222b5294/da9d7a8bd9d04c2dbed8a1a3f3d16570/FLAG4947924bf [2025-01-10 00:55:30,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b222b5294/da9d7a8bd9d04c2dbed8a1a3f3d16570 [2025-01-10 00:55:30,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:30,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:30,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:30,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:30,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:30,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644a9303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:30, skipping insertion in model container [2025-01-10 00:55:30,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:30" (1/1) ... [2025-01-10 00:55:30,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:31,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:31,377 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:31,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:31,501 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:31,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:31 WrapperNode [2025-01-10 00:55:31,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:31,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:31,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:31,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:31,509 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:31" (1/1) ... [2025-01-10 00:55:31,526 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:31" (1/1) ... [2025-01-10 00:55:31,554 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 182 [2025-01-10 00:55:31,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:31,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:31,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:31,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:31,564 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:31" (1/1) ... [2025-01-10 00:55:31,564 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:31" (1/1) ... [2025-01-10 00:55:31,568 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:31" (1/1) ... [2025-01-10 00:55:31,607 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-01-10 00:55:31,608 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:31" (1/1) ... [2025-01-10 00:55:31,608 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:31" (1/1) ... [2025-01-10 00:55:31,630 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:31" (1/1) ... [2025-01-10 00:55:31,632 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:31" (1/1) ... [2025-01-10 00:55:31,635 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:31" (1/1) ... [2025-01-10 00:55:31,637 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:31" (1/1) ... [2025-01-10 00:55:31,638 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:31" (1/1) ... [2025-01-10 00:55:31,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:31,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:31,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:31,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:31,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:31" (1/1) ... [2025-01-10 00:55:31,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:31,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:31,692 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:31,696 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:31,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:31,724 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:31,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:31,726 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:31,919 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:31,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:32,480 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:32,481 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:32,870 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:32,871 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:32,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:32 BoogieIcfgContainer [2025-01-10 00:55:32,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:32,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:32,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:32,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:32,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:30" (1/3) ... [2025-01-10 00:55:32,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b18e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:32, skipping insertion in model container [2025-01-10 00:55:32,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:31" (2/3) ... [2025-01-10 00:55:32,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b18e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:32, skipping insertion in model container [2025-01-10 00:55:32,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:32" (3/3) ... [2025-01-10 00:55:32,885 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-01-10 00:55:32,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:32,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 72 locations, 1 initial locations, 2 loop locations, and 37 error locations. [2025-01-10 00:55:32,901 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:32,974 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 150 flow [2025-01-10 00:55:33,062 INFO L124 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-01-10 00:55:33,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:33,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 285 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-01-10 00:55:33,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 73 transitions, 150 flow [2025-01-10 00:55:33,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 72 transitions, 147 flow [2025-01-10 00:55:33,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:33,102 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;@567880f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:33,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:55:33,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:33,110 INFO L124 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-01-10 00:55:33,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:33,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:55:33,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 15832139, now seen corresponding path program 1 times [2025-01-10 00:55:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671286017] [2025-01-10 00:55:33,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:33,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:33,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,434 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,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671286017] [2025-01-10 00:55:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671286017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082499503] [2025-01-10 00:55:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:33,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-01-10 00:55:33,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-01-10 00:55:33,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,685 INFO L124 PetriNetUnfolderBase]: 65/268 cut-off events. [2025-01-10 00:55:33,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:33,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 268 events. 65/268 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1374 event pairs, 63 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 376. Up to 155 conditions per place. [2025-01-10 00:55:33,691 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-01-10 00:55:33,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 207 flow [2025-01-10 00:55:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-01-10 00:55:33,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7534246575342466 [2025-01-10 00:55:33,708 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 147 flow. Second operand 3 states and 165 transitions. [2025-01-10 00:55:33,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 207 flow [2025-01-10 00:55:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:33,718 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 158 flow [2025-01-10 00:55:33,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-01-10 00:55:33,724 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-01-10 00:55:33,727 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 158 flow [2025-01-10 00:55:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:55:33,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:33,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 490730470, now seen corresponding path program 1 times [2025-01-10 00:55:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288252613] [2025-01-10 00:55:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:55:33,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:55:33,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288252613] [2025-01-10 00:55:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288252613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700160474] [2025-01-10 00:55:33,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:33,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:33,882 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:33,885 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:33,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:55:34,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:55:34,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:55:34,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:34,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700160474] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:34,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:55:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106243669] [2025-01-10 00:55:34,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:34,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:34,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-01-10 00:55:34,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-01-10 00:55:34,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,207 INFO L124 PetriNetUnfolderBase]: 65/271 cut-off events. [2025-01-10 00:55:34,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:34,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 271 events. 65/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1377 event pairs, 63 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 432. Up to 155 conditions per place. [2025-01-10 00:55:34,210 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-01-10 00:55:34,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 234 flow [2025-01-10 00:55:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2025-01-10 00:55:34,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6963470319634704 [2025-01-10 00:55:34,213 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 158 flow. Second operand 6 states and 305 transitions. [2025-01-10 00:55:34,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 234 flow [2025-01-10 00:55:34,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:34,216 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 190 flow [2025-01-10 00:55:34,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-01-10 00:55:34,217 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2025-01-10 00:55:34,217 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 190 flow [2025-01-10 00:55:34,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,217 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:55:34,226 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:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:34,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -782621941, now seen corresponding path program 2 times [2025-01-10 00:55:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852535943] [2025-01-10 00:55:34,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:55:34,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-01-10 00:55:34,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:34,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:55:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852535943] [2025-01-10 00:55:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852535943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586289374] [2025-01-10 00:55:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:34,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:34,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 73 [2025-01-10 00:55:34,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 73 [2025-01-10 00:55:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,704 INFO L124 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-01-10 00:55:34,704 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:34,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 267 events. 65/267 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1325 event pairs, 63 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 421. Up to 157 conditions per place. [2025-01-10 00:55:34,707 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 30 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-01-10 00:55:34,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 250 flow [2025-01-10 00:55:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-10 00:55:34,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2025-01-10 00:55:34,709 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 190 flow. Second operand 3 states and 151 transitions. [2025-01-10 00:55:34,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 250 flow [2025-01-10 00:55:34,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 236 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:34,714 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 176 flow [2025-01-10 00:55:34,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-01-10 00:55:34,715 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2025-01-10 00:55:34,715 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 176 flow [2025-01-10 00:55:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,716 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:55:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:34,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:34,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash -782621940, now seen corresponding path program 1 times [2025-01-10 00:55:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454998029] [2025-01-10 00:55:34,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:55:34,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:55:34,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454998029] [2025-01-10 00:55:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454998029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818171078] [2025-01-10 00:55:34,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:34,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:34,889 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:34,891 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:34,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:55:34,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:55:34,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:55:35,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:35,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818171078] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:35,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:55:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014287667] [2025-01-10 00:55:35,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:35,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:35,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:35,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:35,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 73 [2025-01-10 00:55:35,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 73 [2025-01-10 00:55:35,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:35,250 INFO L124 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-01-10 00:55:35,250 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 00:55:35,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 273 events. 65/273 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1325 event pairs, 63 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 431. Up to 155 conditions per place. [2025-01-10 00:55:35,255 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 27 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2025-01-10 00:55:35,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 78 transitions, 288 flow [2025-01-10 00:55:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 584 transitions. [2025-01-10 00:55:35,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 00:55:35,261 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 176 flow. Second operand 12 states and 584 transitions. [2025-01-10 00:55:35,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 78 transitions, 288 flow [2025-01-10 00:55:35,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 78 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:35,267 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 252 flow [2025-01-10 00:55:35,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-01-10 00:55:35,268 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2025-01-10 00:55:35,271 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 252 flow [2025-01-10 00:55:35,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.15384615384615) internal successors, (600), 13 states have internal predecessors, (600), 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,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:35,272 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:55:35,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:35,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:35,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 657450284, now seen corresponding path program 2 times [2025-01-10 00:55:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:35,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102284191] [2025-01-10 00:55:35,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:35,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:55:35,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-01-10 00:55:35,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:35,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102284191] [2025-01-10 00:55:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102284191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:35,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:35,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680077013] [2025-01-10 00:55:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:35,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:35,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:35,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:35,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:35,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-01-10 00:55:35,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:35,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-01-10 00:55:35,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:35,762 INFO L124 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-01-10 00:55:35,762 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 00:55:35,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 269 events. 65/269 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1302 event pairs, 63 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 421. Up to 163 conditions per place. [2025-01-10 00:55:35,765 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-01-10 00:55:35,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 74 transitions, 320 flow [2025-01-10 00:55:35,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-01-10 00:55:35,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7077625570776256 [2025-01-10 00:55:35,766 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 252 flow. Second operand 3 states and 155 transitions. [2025-01-10 00:55:35,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 74 transitions, 320 flow [2025-01-10 00:55:35,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 272 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:35,771 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 204 flow [2025-01-10 00:55:35,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, 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=204, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-01-10 00:55:35,771 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2025-01-10 00:55:35,772 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 204 flow [2025-01-10 00:55:35,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:35,772 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:35,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:35,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash 449544320, now seen corresponding path program 1 times [2025-01-10 00:55:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108418388] [2025-01-10 00:55:35,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:35,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:35,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:35,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:36,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:36,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108418388] [2025-01-10 00:55:36,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108418388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:36,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820534713] [2025-01-10 00:55:36,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:36,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:36,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:36,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:36,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-01-10 00:55:36,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:36,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-01-10 00:55:36,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:36,302 INFO L124 PetriNetUnfolderBase]: 74/291 cut-off events. [2025-01-10 00:55:36,302 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 00:55:36,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 291 events. 74/291 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1407 event pairs, 72 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 474. Up to 185 conditions per place. [2025-01-10 00:55:36,304 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 40 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-01-10 00:55:36,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 278 flow [2025-01-10 00:55:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-01-10 00:55:36,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680365296803653 [2025-01-10 00:55:36,306 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 204 flow. Second operand 3 states and 149 transitions. [2025-01-10 00:55:36,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 278 flow [2025-01-10 00:55:36,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:36,309 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 190 flow [2025-01-10 00:55:36,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-01-10 00:55:36,310 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2025-01-10 00:55:36,310 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 190 flow [2025-01-10 00:55:36,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:36,311 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:36,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:36,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:36,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:36,312 INFO L85 PathProgramCache]: Analyzing trace with hash 449544321, now seen corresponding path program 1 times [2025-01-10 00:55:36,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:36,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191438107] [2025-01-10 00:55:36,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:36,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:36,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:36,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:36,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:36,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191438107] [2025-01-10 00:55:36,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191438107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384511838] [2025-01-10 00:55:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:36,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:36,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:36,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 73 [2025-01-10 00:55:36,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 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:36,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:36,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 73 [2025-01-10 00:55:36,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,004 INFO L124 PetriNetUnfolderBase]: 65/277 cut-off events. [2025-01-10 00:55:37,005 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 00:55:37,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 277 events. 65/277 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1231 event pairs, 63 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 472. Up to 166 conditions per place. [2025-01-10 00:55:37,007 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 40 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2025-01-10 00:55:37,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 298 flow [2025-01-10 00:55:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-01-10 00:55:37,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589041095890411 [2025-01-10 00:55:37,008 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 190 flow. Second operand 5 states and 215 transitions. [2025-01-10 00:55:37,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 298 flow [2025-01-10 00:55:37,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:37,011 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 239 flow [2025-01-10 00:55:37,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2025-01-10 00:55:37,012 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-01-10 00:55:37,012 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 239 flow [2025-01-10 00:55:37,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 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:37,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,013 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:37,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash -787189368, now seen corresponding path program 1 times [2025-01-10 00:55:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071775997] [2025-01-10 00:55:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:37,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:55:37,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:55:37,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071775997] [2025-01-10 00:55:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071775997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:37,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328939905] [2025-01-10 00:55:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:37,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:37,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:37,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:37,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-01-10 00:55:37,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-01-10 00:55:37,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,807 INFO L124 PetriNetUnfolderBase]: 65/273 cut-off events. [2025-01-10 00:55:37,807 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-01-10 00:55:37,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 273 events. 65/273 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1213 event pairs, 63 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 491. Up to 160 conditions per place. [2025-01-10 00:55:37,809 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 35 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2025-01-10 00:55:37,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 73 transitions, 327 flow [2025-01-10 00:55:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 285 transitions. [2025-01-10 00:55:37,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5577299412915852 [2025-01-10 00:55:37,811 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 239 flow. Second operand 7 states and 285 transitions. [2025-01-10 00:55:37,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 73 transitions, 327 flow [2025-01-10 00:55:37,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:37,813 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 253 flow [2025-01-10 00:55:37,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2025-01-10 00:55:37,814 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2025-01-10 00:55:37,815 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 253 flow [2025-01-10 00:55:37,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 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,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,815 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:37,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:37,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash -787189367, now seen corresponding path program 1 times [2025-01-10 00:55:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:37,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270063544] [2025-01-10 00:55:37,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:37,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:55:37,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:55:37,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270063544] [2025-01-10 00:55:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270063544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658710127] [2025-01-10 00:55:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:38,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:38,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-01-10 00:55:38,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-01-10 00:55:38,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,843 INFO L124 PetriNetUnfolderBase]: 65/269 cut-off events. [2025-01-10 00:55:38,843 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 00:55:38,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 269 events. 65/269 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1184 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 496. Up to 160 conditions per place. [2025-01-10 00:55:38,844 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2025-01-10 00:55:38,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 71 transitions, 339 flow [2025-01-10 00:55:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2025-01-10 00:55:38,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5146771037181996 [2025-01-10 00:55:38,847 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 253 flow. Second operand 7 states and 263 transitions. [2025-01-10 00:55:38,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 71 transitions, 339 flow [2025-01-10 00:55:38,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 71 transitions, 317 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:38,849 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 249 flow [2025-01-10 00:55:38,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2025-01-10 00:55:38,853 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2025-01-10 00:55:38,853 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 249 flow [2025-01-10 00:55:38,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 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,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,853 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:38,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:38,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:38,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash -574720276, now seen corresponding path program 1 times [2025-01-10 00:55:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:38,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881144458] [2025-01-10 00:55:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:38,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:55:38,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:55:38,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:39,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881144458] [2025-01-10 00:55:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881144458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241175948] [2025-01-10 00:55:39,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:39,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:39,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 00:55:39,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:39,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 00:55:39,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,365 INFO L124 PetriNetUnfolderBase]: 65/267 cut-off events. [2025-01-10 00:55:39,365 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-10 00:55:39,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 267 events. 65/267 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1175 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 490. Up to 162 conditions per place. [2025-01-10 00:55:39,367 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 32 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2025-01-10 00:55:39,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 333 flow [2025-01-10 00:55:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2025-01-10 00:55:39,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6273972602739726 [2025-01-10 00:55:39,369 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 249 flow. Second operand 5 states and 229 transitions. [2025-01-10 00:55:39,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 333 flow [2025-01-10 00:55:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 311 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:39,371 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 247 flow [2025-01-10 00:55:39,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2025-01-10 00:55:39,371 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-01-10 00:55:39,371 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 247 flow [2025-01-10 00:55:39,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,374 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:55:39,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:39,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash -574720277, now seen corresponding path program 1 times [2025-01-10 00:55:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908078564] [2025-01-10 00:55:39,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:39,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:55:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:55:39,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908078564] [2025-01-10 00:55:39,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908078564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442503648] [2025-01-10 00:55:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:39,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:39,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 73 [2025-01-10 00:55:39,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:39,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:39,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 73 [2025-01-10 00:55:39,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,769 INFO L124 PetriNetUnfolderBase]: 65/265 cut-off events. [2025-01-10 00:55:39,769 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-01-10 00:55:39,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 265 events. 65/265 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1167 event pairs, 63 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 492. Up to 162 conditions per place. [2025-01-10 00:55:39,771 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 34 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-01-10 00:55:39,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 69 transitions, 335 flow [2025-01-10 00:55:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-01-10 00:55:39,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054794520547945 [2025-01-10 00:55:39,773 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 247 flow. Second operand 5 states and 221 transitions. [2025-01-10 00:55:39,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 69 transitions, 335 flow [2025-01-10 00:55:39,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 69 transitions, 313 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:39,775 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 245 flow [2025-01-10 00:55:39,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2025-01-10 00:55:39,777 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 11 predicate places. [2025-01-10 00:55:39,777 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 245 flow [2025-01-10 00:55:39,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:39,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,778 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:39,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1536699461, now seen corresponding path program 1 times [2025-01-10 00:55:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622633665] [2025-01-10 00:55:39,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:39,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:55:39,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:55:39,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622633665] [2025-01-10 00:55:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622633665] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021313483] [2025-01-10 00:55:40,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:40,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:40,324 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:40,326 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:40,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:55:40,504 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,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:40,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:40,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 00:55:40,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:40,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:40,671 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:40,733 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:40,733 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 11 treesize of output 11 [2025-01-10 00:55:40,747 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:40,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:40,895 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:40,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:41,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:41,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:55:41,282 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:41,282 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 12 [2025-01-10 00:55:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:41,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021313483] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:41,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:41,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 20 [2025-01-10 00:55:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205461544] [2025-01-10 00:55:41,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:41,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:55:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:41,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:55:41,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-10 00:55:44,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-01-10 00:55:44,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 245 flow. Second operand has 22 states, 22 states have (on average 35.77272727272727) internal successors, (787), 22 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:44,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:44,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-01-10 00:55:44,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:44,536 INFO L124 PetriNetUnfolderBase]: 74/318 cut-off events. [2025-01-10 00:55:44,536 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-01-10 00:55:44,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 318 events. 74/318 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 72 based on Foata normal form. 9/279 useless extension candidates. Maximal degree in co-relation 605. Up to 179 conditions per place. [2025-01-10 00:55:44,538 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 53 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2025-01-10 00:55:44,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 465 flow [2025-01-10 00:55:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:55:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:55:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 369 transitions. [2025-01-10 00:55:44,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5616438356164384 [2025-01-10 00:55:44,540 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 245 flow. Second operand 9 states and 369 transitions. [2025-01-10 00:55:44,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 465 flow [2025-01-10 00:55:44,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 411 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:44,543 INFO L231 Difference]: Finished difference. Result has 92 places, 71 transitions, 278 flow [2025-01-10 00:55:44,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=92, PETRI_TRANSITIONS=71} [2025-01-10 00:55:44,543 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2025-01-10 00:55:44,543 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 71 transitions, 278 flow [2025-01-10 00:55:44,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 35.77272727272727) internal successors, (787), 22 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:44,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:44,544 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-01-10 00:55:44,553 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:44,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:44,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:44,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash -678309487, now seen corresponding path program 2 times [2025-01-10 00:55:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:44,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480395529] [2025-01-10 00:55:44,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:44,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 00:55:44,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 00:55:44,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:55:44,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480395529] [2025-01-10 00:55:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480395529] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703478510] [2025-01-10 00:55:46,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:46,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:46,679 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:46,682 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:46,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 00:55:46,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 00:55:46,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:55:46,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:46,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-01-10 00:55:46,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:47,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:47,111 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:47,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:47,171 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:47,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:47,253 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:47,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:47,307 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:47,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:47,387 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:47,430 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:47,430 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:47,444 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:47,444 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 11 treesize of output 11 [2025-01-10 00:55:47,613 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:47,613 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:47,626 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:47,626 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 11 treesize of output 11 [2025-01-10 00:55:47,713 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 15 treesize of output 1 [2025-01-10 00:55:47,731 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:55:47,731 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:47,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:55:47,747 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 11 treesize of output 11 [2025-01-10 00:55:47,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:55:47,879 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 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:55:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:47,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:48,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:48,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:55:48,175 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:48,176 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 12 [2025-01-10 00:55:48,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:48,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:55:48,444 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:48,445 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 12 [2025-01-10 00:55:48,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:48,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:55:48,705 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:48,706 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 12 [2025-01-10 00:55:48,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:55:48,978 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:55:48,978 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 12 [2025-01-10 00:55:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703478510] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:49,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:49,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 11] total 44 [2025-01-10 00:55:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512613867] [2025-01-10 00:55:49,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:49,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-10 00:55:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:49,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-10 00:55:49,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1698, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 00:55:56,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-01-10 00:55:56,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 71 transitions, 278 flow. Second operand has 46 states, 46 states have (on average 36.21739130434783) internal successors, (1666), 46 states have internal predecessors, (1666), 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:56,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-01-10 00:55:56,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:57,342 INFO L124 PetriNetUnfolderBase]: 74/378 cut-off events. [2025-01-10 00:55:57,342 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-01-10 00:55:57,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 378 events. 74/378 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 72 based on Foata normal form. 12/342 useless extension candidates. Maximal degree in co-relation 758. Up to 179 conditions per place. [2025-01-10 00:55:57,344 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 81 selfloop transitions, 25 changer transitions 0/129 dead transitions. [2025-01-10 00:55:57,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 129 transitions, 738 flow [2025-01-10 00:55:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 00:55:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 00:55:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 788 transitions. [2025-01-10 00:55:57,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397260273972603 [2025-01-10 00:55:57,348 INFO L175 Difference]: Start difference. First operand has 92 places, 71 transitions, 278 flow. Second operand 20 states and 788 transitions. [2025-01-10 00:55:57,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 129 transitions, 738 flow [2025-01-10 00:55:57,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 129 transitions, 727 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:55:57,352 INFO L231 Difference]: Finished difference. Result has 120 places, 86 transitions, 480 flow [2025-01-10 00:55:57,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=480, PETRI_PLACES=120, PETRI_TRANSITIONS=86} [2025-01-10 00:55:57,353 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 46 predicate places. [2025-01-10 00:55:57,353 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 86 transitions, 480 flow [2025-01-10 00:55:57,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 36.21739130434783) internal successors, (1666), 46 states have internal predecessors, (1666), 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,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:57,355 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-01-10 00:55:57,366 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:57,555 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,SelfDestructingSolverStorable12 [2025-01-10 00:55:57,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1540355369, now seen corresponding path program 3 times [2025-01-10 00:55:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407647535] [2025-01-10 00:55:57,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:55:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:57,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 11 equivalence classes. [2025-01-10 00:55:58,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 00:55:58,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 00:55:58,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:59,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407647535] [2025-01-10 00:55:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407647535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:59,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871291793] [2025-01-10 00:55:59,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:55:59,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:59,115 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:59,118 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:59,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 11 equivalence classes.