./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --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/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:15:04,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:15:04,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:15:04,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:15:04,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:15:04,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:15:04,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:15:04,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:15:04,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:15:04,565 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:15:04,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:15:04,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:15:04,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:15:04,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:15:04,566 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:15:04,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:04,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:04,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:04,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:15:04,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:15:04,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:15:04,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:15:04,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:15:04,569 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2025-01-09 22:15:04,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:15:04,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:15:04,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:15:04,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:15:04,739 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:15:04,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2025-01-09 22:15:05,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcc4c7b64/0e37d8702dbd47fabb6bea3ac41bb72c/FLAG834f5ca54 [2025-01-09 22:15:06,094 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:15:06,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2025-01-09 22:15:06,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcc4c7b64/0e37d8702dbd47fabb6bea3ac41bb72c/FLAG834f5ca54 [2025-01-09 22:15:06,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcc4c7b64/0e37d8702dbd47fabb6bea3ac41bb72c [2025-01-09 22:15:06,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:15:06,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:15:06,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:06,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:15:06,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:15:06,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6cd4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06, skipping insertion in model container [2025-01-09 22:15:06,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:15:06,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:06,551 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:15:06,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:06,589 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:15:06,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06 WrapperNode [2025-01-09 22:15:06,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:06,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:06,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:15:06,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:15:06,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,620 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 126 [2025-01-09 22:15:06,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:06,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:15:06,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:15:06,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:15:06,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,646 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 7, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 3, 1]. [2025-01-09 22:15:06,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:15:06,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:15:06,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:15:06,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:15:06,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (1/1) ... [2025-01-09 22:15:06,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:06,682 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-09 22:15:06,684 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-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 22:15:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:15:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:15:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:15:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:15:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:15:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:15:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:15:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 22:15:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 22:15:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:15:06,770 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:15:06,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:15:06,966 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 22:15:06,966 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:15:06,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:15:06,977 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:15:06,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:06 BoogieIcfgContainer [2025-01-09 22:15:06,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:15:06,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:15:06,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:15:06,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:15:06,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:15:06" (1/3) ... [2025-01-09 22:15:06,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2580f79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:06, skipping insertion in model container [2025-01-09 22:15:06,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:06" (2/3) ... [2025-01-09 22:15:06,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2580f79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:06, skipping insertion in model container [2025-01-09 22:15:06,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:06" (3/3) ... [2025-01-09 22:15:06,987 INFO L128 eAbstractionObserver]: Analyzing ICFG duplets.c [2025-01-09 22:15:06,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:15:06,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG duplets.c that has 3 procedures, 99 locations, 1 initial locations, 2 loop locations, and 37 error locations. [2025-01-09 22:15:07,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:15:07,031 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;@1a8d3023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:15:07,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 22:15:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:15:07,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:07,037 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:07,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:07,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2118782027, now seen corresponding path program 1 times [2025-01-09 22:15:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:07,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466661621] [2025-01-09 22:15:07,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:07,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:07,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:15:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:15:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:15:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466661621] [2025-01-09 22:15:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466661621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966254724] [2025-01-09 22:15:07,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:07,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:07,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:07,142 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-09 22:15:07,143 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-09 22:15:07,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:15:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:15:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:07,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 22:15:07,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:15:07,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:15:07,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966254724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:07,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:15:07,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 22:15:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183608039] [2025-01-09 22:15:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:15:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:07,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:15:07,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:15:07,227 INFO L87 Difference]: Start difference. First operand has 99 states, 50 states have (on average 1.88) internal successors, (94), 87 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:07,238 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2025-01-09 22:15:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:15:07,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-01-09 22:15:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:07,242 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:15:07,242 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:15:07,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:15:07,245 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:07,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:15:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 22:15:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 84 states have internal predecessors, (89), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2025-01-09 22:15:07,270 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 26 [2025-01-09 22:15:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:07,270 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2025-01-09 22:15:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2025-01-09 22:15:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:15:07,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:07,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:07,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:15:07,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 22:15:07,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 666593099, now seen corresponding path program 1 times [2025-01-09 22:15:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817683464] [2025-01-09 22:15:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:07,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:15:07,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:15:07,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:07,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817683464] [2025-01-09 22:15:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817683464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:07,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:07,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:07,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490232581] [2025-01-09 22:15:07,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:07,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:07,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:07,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:07,714 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:07,807 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-01-09 22:15:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-01-09 22:15:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:07,808 INFO L225 Difference]: With dead ends: 94 [2025-01-09 22:15:07,808 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 22:15:07,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:07,809 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:07,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 217 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 22:15:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 22:15:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 48 states have (on average 1.8125) internal successors, (87), 82 states have internal predecessors, (87), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2025-01-09 22:15:07,817 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 26 [2025-01-09 22:15:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:07,818 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2025-01-09 22:15:07,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2025-01-09 22:15:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:15:07,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:07,819 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:07,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:15:07,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash 666593100, now seen corresponding path program 1 times [2025-01-09 22:15:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370990108] [2025-01-09 22:15:07,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:07,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:07,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:15:07,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:15:07,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:07,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:15:08,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:08,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370990108] [2025-01-09 22:15:08,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370990108] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:08,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123348414] [2025-01-09 22:15:08,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:08,145 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-09 22:15:08,153 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-09 22:15:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:15:08,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:15:08,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:08,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:08,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:15:08,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:08,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:15:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:15:08,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:15:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123348414] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:08,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 19 [2025-01-09 22:15:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519034746] [2025-01-09 22:15:08,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:15:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:08,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:15:08,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:15:08,893 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 20 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 22:15:12,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:15:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:13,497 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-01-09 22:15:13,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:15:13,501 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 26 [2025-01-09 22:15:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:13,502 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:15:13,502 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:15:13,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:15:13,503 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 374 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:13,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 668 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 681 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 22:15:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:15:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2025-01-09 22:15:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 84 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2025-01-09 22:15:13,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 26 [2025-01-09 22:15:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2025-01-09 22:15:13,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 22:15:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2025-01-09 22:15:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:15:13,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:13,518 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:13,529 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-09 22:15:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:13,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:13,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -810450418, now seen corresponding path program 1 times [2025-01-09 22:15:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378423347] [2025-01-09 22:15:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:15:13,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:15:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:13,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:15:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378423347] [2025-01-09 22:15:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378423347] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742334456] [2025-01-09 22:15:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:13,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:13,943 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-09 22:15:13,944 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-09 22:15:13,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:15:13,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:15:13,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:13,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:14,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 22:15:14,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:14,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-09 22:15:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:15:14,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:15:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742334456] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:14,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:14,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 7] total 20 [2025-01-09 22:15:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478477426] [2025-01-09 22:15:14,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:14,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:15:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:14,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:15:14,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:15:14,764 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 21 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 22:15:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:15,283 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2025-01-09 22:15:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:15:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 27 [2025-01-09 22:15:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:15,284 INFO L225 Difference]: With dead ends: 128 [2025-01-09 22:15:15,286 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 22:15:15,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:15:15,286 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 268 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:15,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 523 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:15:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 22:15:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2025-01-09 22:15:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 83 states have internal predecessors, (88), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-01-09 22:15:15,296 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 27 [2025-01-09 22:15:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:15,296 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-01-09 22:15:15,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 22:15:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-01-09 22:15:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:15:15,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:15,298 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:15,312 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-09 22:15:15,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:15,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:15,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1210719598, now seen corresponding path program 1 times [2025-01-09 22:15:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720488336] [2025-01-09 22:15:15,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:15,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:15:15,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:15:15,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:15,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:15,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720488336] [2025-01-09 22:15:15,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720488336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:15,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:15:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65313344] [2025-01-09 22:15:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:15,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:15:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:15,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:15:15,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:15,675 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:15,785 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-01-09 22:15:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:15:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2025-01-09 22:15:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:15,786 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:15:15,786 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:15:15,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:15,786 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 72 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:15,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 191 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:15:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 22:15:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 78 states have internal predecessors, (83), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-01-09 22:15:15,790 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 31 [2025-01-09 22:15:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-01-09 22:15:15,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-01-09 22:15:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:15:15,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:15,791 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:15:15,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:15,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1210719597, now seen corresponding path program 1 times [2025-01-09 22:15:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380682939] [2025-01-09 22:15:15,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:15,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:15:15,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:15:15,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:15,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:15,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:15,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380682939] [2025-01-09 22:15:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380682939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:15,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:15:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783530781] [2025-01-09 22:15:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:15,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:15:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:15,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:15:15,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:15,988 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:16,144 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2025-01-09 22:15:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:15:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2025-01-09 22:15:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:16,145 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:15:16,145 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:15:16,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:15:16,146 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 75 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:16,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 193 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:15:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-01-09 22:15:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.625) internal successors, (91), 82 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-01-09 22:15:16,149 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 31 [2025-01-09 22:15:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:16,150 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-01-09 22:15:16,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-01-09 22:15:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:15:16,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:16,151 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:16,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:15:16,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:16,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1122398135, now seen corresponding path program 1 times [2025-01-09 22:15:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148209147] [2025-01-09 22:15:16,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:15:16,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:15:16,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:16,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:16,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148209147] [2025-01-09 22:15:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148209147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:15:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603027552] [2025-01-09 22:15:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:16,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:15:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:16,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:15:16,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:15:16,474 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:16,841 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2025-01-09 22:15:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:15:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-01-09 22:15:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:16,842 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:15:16,842 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:15:16,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:15:16,847 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 95 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:16,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 246 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:15:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2025-01-09 22:15:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 85 states have internal predecessors, (95), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2025-01-09 22:15:16,854 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 32 [2025-01-09 22:15:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:16,854 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2025-01-09 22:15:16,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2025-01-09 22:15:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:15:16,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:16,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:16,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:15:16,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:16,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1357670877, now seen corresponding path program 1 times [2025-01-09 22:15:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394949842] [2025-01-09 22:15:16,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:15:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:15:16,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:16,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394949842] [2025-01-09 22:15:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394949842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591820589] [2025-01-09 22:15:17,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:17,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:17,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:17,031 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-09 22:15:17,034 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-09 22:15:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:15:17,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:15:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:17,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 22:15:17,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:17,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:17,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591820589] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:17,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:17,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 15 [2025-01-09 22:15:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791775993] [2025-01-09 22:15:17,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:17,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:15:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:17,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:15:17,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:15:17,252 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 15 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 22:15:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:17,392 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2025-01-09 22:15:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:15:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2025-01-09 22:15:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:17,393 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:15:17,393 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:15:17,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:15:17,394 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 248 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:17,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 753 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:15:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2025-01-09 22:15:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 85 states have internal predecessors, (94), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2025-01-09 22:15:17,398 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 34 [2025-01-09 22:15:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:17,398 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-01-09 22:15:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 22:15:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2025-01-09 22:15:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:15:17,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:17,399 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:17,405 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-09 22:15:17,599 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,SelfDestructingSolverStorable7 [2025-01-09 22:15:17,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash 435194683, now seen corresponding path program 1 times [2025-01-09 22:15:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:17,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039938298] [2025-01-09 22:15:17,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:17,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:15:17,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:15:17,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:17,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039938298] [2025-01-09 22:15:17,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039938298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:17,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7293978] [2025-01-09 22:15:17,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:17,644 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-09 22:15:17,650 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-09 22:15:17,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:15:17,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:15:17,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:17,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:17,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:15:17,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:17,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:15:17,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7293978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:17,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:15:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-01-09 22:15:17,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550954130] [2025-01-09 22:15:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:17,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:17,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:17,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:17,705 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:17,727 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2025-01-09 22:15:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-01-09 22:15:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:17,727 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:15:17,727 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:15:17,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:17,728 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:17,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 259 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:15:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2025-01-09 22:15:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 87 states have internal predecessors, (97), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2025-01-09 22:15:17,731 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 33 [2025-01-09 22:15:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:17,731 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2025-01-09 22:15:17,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2025-01-09 22:15:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:15:17,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:17,732 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:17,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:17,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 587815895, now seen corresponding path program 1 times [2025-01-09 22:15:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:17,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674137953] [2025-01-09 22:15:17,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:17,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:15:17,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:15:17,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:17,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674137953] [2025-01-09 22:15:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674137953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:18,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:18,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:18,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42366251] [2025-01-09 22:15:18,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:18,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:18,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:18,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,005 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:18,033 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2025-01-09 22:15:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:18,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-01-09 22:15:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:18,034 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:15:18,034 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:15:18,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,035 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:18,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:15:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-01-09 22:15:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2025-01-09 22:15:18,037 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 34 [2025-01-09 22:15:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:18,038 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2025-01-09 22:15:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2025-01-09 22:15:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:15:18,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:18,038 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:18,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:15:18,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 587815896, now seen corresponding path program 1 times [2025-01-09 22:15:18,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:18,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479044726] [2025-01-09 22:15:18,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:18,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:15:18,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:15:18,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:18,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479044726] [2025-01-09 22:15:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479044726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:18,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:18,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077175346] [2025-01-09 22:15:18,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:18,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:18,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:18,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,113 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:18,144 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-01-09 22:15:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-01-09 22:15:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:18,145 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:15:18,145 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:15:18,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,145 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:18,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 146 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:15:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-01-09 22:15:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 85 states have internal predecessors, (95), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2025-01-09 22:15:18,148 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 34 [2025-01-09 22:15:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:18,148 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2025-01-09 22:15:18,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2025-01-09 22:15:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:15:18,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:18,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:18,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:15:18,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:18,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1042423578, now seen corresponding path program 1 times [2025-01-09 22:15:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:18,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259930967] [2025-01-09 22:15:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:18,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:15:18,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:15:18,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259930967] [2025-01-09 22:15:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259930967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421815047] [2025-01-09 22:15:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:18,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:18,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:18,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,191 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:18,219 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2025-01-09 22:15:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-01-09 22:15:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:18,220 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:15:18,220 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:15:18,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,221 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:18,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:15:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-01-09 22:15:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.540983606557377) internal successors, (94), 84 states have internal predecessors, (94), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2025-01-09 22:15:18,224 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 35 [2025-01-09 22:15:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:18,224 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-01-09 22:15:18,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2025-01-09 22:15:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:15:18,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:18,226 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:15:18,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1042423579, now seen corresponding path program 1 times [2025-01-09 22:15:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860333699] [2025-01-09 22:15:18,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:18,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:15:18,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:15:18,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860333699] [2025-01-09 22:15:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860333699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274630498] [2025-01-09 22:15:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:18,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:18,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,289 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:18,338 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2025-01-09 22:15:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-01-09 22:15:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:18,339 INFO L225 Difference]: With dead ends: 97 [2025-01-09 22:15:18,339 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 22:15:18,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:18,339 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:18,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 142 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 22:15:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-01-09 22:15:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 83 states have internal predecessors, (93), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2025-01-09 22:15:18,344 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 35 [2025-01-09 22:15:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:18,345 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2025-01-09 22:15:18,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2025-01-09 22:15:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:15:18,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:18,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:18,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:15:18,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:18,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash -851632075, now seen corresponding path program 1 times [2025-01-09 22:15:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101377375] [2025-01-09 22:15:18,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:18,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:15:18,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:15:18,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:18,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101377375] [2025-01-09 22:15:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101377375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:18,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:18,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 22:15:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563282284] [2025-01-09 22:15:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:18,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:15:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:18,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:15:18,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:15:18,607 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:18,827 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2025-01-09 22:15:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:15:18,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2025-01-09 22:15:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:18,828 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:15:18,828 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:15:18,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:15:18,829 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 81 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:18,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 562 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:15:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:15:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2025-01-09 22:15:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 83 states have internal predecessors, (92), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2025-01-09 22:15:18,834 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 36 [2025-01-09 22:15:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:18,834 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2025-01-09 22:15:18,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:15:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2025-01-09 22:15:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:15:18,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:18,835 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:18,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:15:18,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:18,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2044349304, now seen corresponding path program 1 times [2025-01-09 22:15:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737168133] [2025-01-09 22:15:18,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:18,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:15:18,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:15:18,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:18,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737168133] [2025-01-09 22:15:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737168133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008460176] [2025-01-09 22:15:19,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:19,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:19,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:19,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:19,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:15:19,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:15:19,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:15:19,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:19,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:19,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 22:15:19,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:19,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-01-09 22:15:19,820 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2025-01-09 22:15:19,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 22:15:19,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2025-01-09 22:15:19,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:19,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:15:19,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:19,972 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 27 treesize of output 20 [2025-01-09 22:15:19,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:19,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:19,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-01-09 22:15:19,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:15:19,999 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-09 22:15:20,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2025-01-09 22:15:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:15:20,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:20,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:15:20,796 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 97 treesize of output 99 [2025-01-09 22:15:20,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:15:20,812 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 81 treesize of output 99 [2025-01-09 22:15:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008460176] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:29,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:15:29,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2025-01-09 22:15:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023252369] [2025-01-09 22:15:29,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:29,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 22:15:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:29,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 22:15:29,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1361, Unknown=2, NotChecked=0, Total=1482 [2025-01-09 22:15:29,219 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:15:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,133 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2025-01-09 22:15:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:15:32,134 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 36 [2025-01-09 22:15:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,134 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:15:32,134 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:15:32,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=316, Invalid=2544, Unknown=2, NotChecked=0, Total=2862 [2025-01-09 22:15:32,135 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 213 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 656 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 22:15:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:15:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2025-01-09 22:15:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 84 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2025-01-09 22:15:32,138 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 36 [2025-01-09 22:15:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,139 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2025-01-09 22:15:32,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:15:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2025-01-09 22:15:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:15:32,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:32,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:32,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:15:32,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:32,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1050271882, now seen corresponding path program 1 times [2025-01-09 22:15:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317213215] [2025-01-09 22:15:32,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:15:32,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:15:32,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317213215] [2025-01-09 22:15:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317213215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124326915] [2025-01-09 22:15:32,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:32,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:32,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:15:32,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:15:32,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:15:32,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:15:32,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:32,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:32,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124326915] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:32,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:32,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-01-09 22:15:32,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091728948] [2025-01-09 22:15:32,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:15:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:15:32,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:32,509 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,557 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2025-01-09 22:15:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:15:32,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-01-09 22:15:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,559 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:15:32,560 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:15:32,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:32,561 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 405 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:15:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2025-01-09 22:15:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 94 states have internal predecessors, (109), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2025-01-09 22:15:32,564 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 37 [2025-01-09 22:15:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,564 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2025-01-09 22:15:32,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2025-01-09 22:15:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:15:32,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:32,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:15:32,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:32,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 582718598, now seen corresponding path program 1 times [2025-01-09 22:15:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719043340] [2025-01-09 22:15:32,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:32,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:15:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:15:32,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719043340] [2025-01-09 22:15:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719043340] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285790600] [2025-01-09 22:15:32,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:32,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:32,806 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:32,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:15:32,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:15:32,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:15:32,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:32,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:32,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:15:32,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:32,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285790600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:32,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-01-09 22:15:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676768198] [2025-01-09 22:15:32,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:32,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:15:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:32,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:15:32,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:32,915 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:32,948 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2025-01-09 22:15:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:15:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-01-09 22:15:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:32,949 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:15:32,949 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:15:32,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:32,949 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 8 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:32,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 244 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:15:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 22:15:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:15:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2025-01-09 22:15:32,952 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 40 [2025-01-09 22:15:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:32,952 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2025-01-09 22:15:32,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2025-01-09 22:15:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:15:32,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:32,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:32,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:15:33,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 22:15:33,159 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:33,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash 17932654, now seen corresponding path program 1 times [2025-01-09 22:15:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597821086] [2025-01-09 22:15:33,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:15:33,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:15:33,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:33,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597821086] [2025-01-09 22:15:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597821086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:15:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591979232] [2025-01-09 22:15:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:15:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:15:33,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:33,241 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:33,288 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2025-01-09 22:15:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:15:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-01-09 22:15:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:33,289 INFO L225 Difference]: With dead ends: 162 [2025-01-09 22:15:33,289 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 22:15:33,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:33,289 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:33,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 437 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 22:15:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 114. [2025-01-09 22:15:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 99 states have internal predecessors, (111), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2025-01-09 22:15:33,295 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 41 [2025-01-09 22:15:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2025-01-09 22:15:33,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:15:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2025-01-09 22:15:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:15:33,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:33,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:33,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:15:33,295 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:33,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1729497511, now seen corresponding path program 2 times [2025-01-09 22:15:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:33,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714304229] [2025-01-09 22:15:33,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:33,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 22:15:33,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:15:33,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:33,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 22:15:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714304229] [2025-01-09 22:15:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714304229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227852279] [2025-01-09 22:15:33,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:33,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:33,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:33,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:33,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:15:33,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 22:15:33,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:15:33,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:33,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:33,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 22:15:33,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 22:15:33,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:33,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 22:15:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 22:15:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227852279] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:33,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-01-09 22:15:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418412528] [2025-01-09 22:15:33,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 22:15:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:33,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 22:15:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-01-09 22:15:33,930 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 22:15:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:34,341 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2025-01-09 22:15:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:15:34,341 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 41 [2025-01-09 22:15:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:34,343 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:15:34,343 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:15:34,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=935, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:15:34,343 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 99 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:34,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 778 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:15:34,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:15:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-01-09 22:15:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2025-01-09 22:15:34,346 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 41 [2025-01-09 22:15:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:34,346 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2025-01-09 22:15:34,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 22:15:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2025-01-09 22:15:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:15:34,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:34,346 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:34,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:15:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:34,553 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:34,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1743537310, now seen corresponding path program 2 times [2025-01-09 22:15:34,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:34,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766367677] [2025-01-09 22:15:34,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:34,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:15:34,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:15:34,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:34,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 22:15:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766367677] [2025-01-09 22:15:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766367677] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:15:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182445183] [2025-01-09 22:15:35,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:15:35,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:35,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:35,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:15:35,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:15:35,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:15:35,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:15:35,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:15:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 22:15:35,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:15:36,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:15:36,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:36,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2025-01-09 22:15:36,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:15:36,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:15:36,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2025-01-09 22:15:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:36,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:15:37,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:15:37,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 515 treesize of output 447 [2025-01-09 22:15:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 22:15:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182445183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:15:48,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:15:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 44 [2025-01-09 22:15:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805371323] [2025-01-09 22:15:48,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:15:48,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:15:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:48,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:15:48,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 22:15:48,739 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 44 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 39 states have internal predecessors, (59), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-09 22:15:53,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:15:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:59,466 INFO L93 Difference]: Finished difference Result 160 states and 188 transitions. [2025-01-09 22:15:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:15:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 39 states have internal predecessors, (59), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 42 [2025-01-09 22:15:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:59,467 INFO L225 Difference]: With dead ends: 160 [2025-01-09 22:15:59,467 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 22:15:59,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=377, Invalid=3163, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 22:15:59,470 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 245 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:59,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1698 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1085 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 22:15:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 22:15:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 114. [2025-01-09 22:15:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 99 states have internal predecessors, (108), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2025-01-09 22:15:59,474 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 42 [2025-01-09 22:15:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2025-01-09 22:15:59,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 39 states have internal predecessors, (59), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-09 22:15:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2025-01-09 22:15:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:15:59,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:59,475 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:59,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:15:59,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:15:59,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:59,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash 53601339, now seen corresponding path program 1 times [2025-01-09 22:15:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:59,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617802028] [2025-01-09 22:15:59,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:59,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:59,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:15:59,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:15:59,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:59,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617802028] [2025-01-09 22:15:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617802028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:59,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902547811] [2025-01-09 22:15:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:59,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:59,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:59,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:59,716 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:15:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:59,777 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2025-01-09 22:15:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:59,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-01-09 22:15:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:59,780 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:15:59,780 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:15:59,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:59,780 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:59,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 133 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:15:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 22:15:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 95 states have internal predecessors, (104), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2025-01-09 22:15:59,786 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 43 [2025-01-09 22:15:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:59,786 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2025-01-09 22:15:59,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:15:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2025-01-09 22:15:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:15:59,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:59,786 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:59,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:15:59,787 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 53601340, now seen corresponding path program 1 times [2025-01-09 22:15:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835620296] [2025-01-09 22:15:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:59,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:15:59,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:15:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:15:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835620296] [2025-01-09 22:15:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835620296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:59,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:15:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147257726] [2025-01-09 22:15:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:59,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:15:59,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:59,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:15:59,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:15:59,843 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:15:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:59,909 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2025-01-09 22:15:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:15:59,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-01-09 22:15:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:59,911 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:15:59,911 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:15:59,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:15:59,912 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:59,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:15:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:15:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 22:15:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 91 states have internal predecessors, (100), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 22:15:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2025-01-09 22:15:59,917 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 43 [2025-01-09 22:15:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:59,917 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2025-01-09 22:15:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:15:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2025-01-09 22:15:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:15:59,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:59,918 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:59,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:15:59,918 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:15:59,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1826849874, now seen corresponding path program 1 times [2025-01-09 22:15:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936419534] [2025-01-09 22:15:59,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:59,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:15:59,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:15:59,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:59,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:16:00,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936419534] [2025-01-09 22:16:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936419534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:00,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:00,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:16:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698796936] [2025-01-09 22:16:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:00,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:16:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:00,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:16:00,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:16:00,007 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:16:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:00,074 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2025-01-09 22:16:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:16:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-01-09 22:16:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:00,075 INFO L225 Difference]: With dead ends: 136 [2025-01-09 22:16:00,076 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 22:16:00,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:16:00,076 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:00,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 345 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 22:16:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2025-01-09 22:16:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 98 states have internal predecessors, (107), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:16:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2025-01-09 22:16:00,082 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 49 [2025-01-09 22:16:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:00,082 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2025-01-09 22:16:00,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:16:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2025-01-09 22:16:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:16:00,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:00,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:00,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:16:00,083 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:16:00,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1992800843, now seen corresponding path program 1 times [2025-01-09 22:16:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:00,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951414540] [2025-01-09 22:16:00,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:16:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:00,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:16:00,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:16:00,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:16:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:16:00,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:00,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951414540] [2025-01-09 22:16:00,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951414540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:16:00,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:16:00,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:16:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273784094] [2025-01-09 22:16:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:16:00,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:16:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:00,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:16:00,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:16:00,284 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:16:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:16:00,467 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2025-01-09 22:16:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:16:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2025-01-09 22:16:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:16:00,468 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:16:00,468 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:16:00,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:16:00,469 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:16:00,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 595 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:16:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:16:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 121. [2025-01-09 22:16:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 104 states have internal predecessors, (112), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 22:16:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2025-01-09 22:16:00,477 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 51 [2025-01-09 22:16:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:16:00,477 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2025-01-09 22:16:00,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:16:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2025-01-09 22:16:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:16:00,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:16:00,478 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:16:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:16:00,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2025-01-09 22:16:00,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:16:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -184272616, now seen corresponding path program 3 times [2025-01-09 22:16:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:16:00,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286385760] [2025-01-09 22:16:00,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:16:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:16:00,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 5 equivalence classes. [2025-01-09 22:16:00,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:16:00,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:16:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:16:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:16:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286385760] [2025-01-09 22:16:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286385760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373380079] [2025-01-09 22:16:03,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:16:03,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:16:03,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:16:03,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:16:03,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:16:03,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 5 equivalence classes. [2025-01-09 22:16:03,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:16:03,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:16:03,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:16:03,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-01-09 22:16:03,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:16:03,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-01-09 22:16:04,297 INFO L349 Elim1Store]: treesize reduction 26, result has 25.7 percent of original size [2025-01-09 22:16:04,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 22:16:04,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2025-01-09 22:16:09,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 85 [2025-01-09 22:16:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:16:09,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:16:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373380079] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:16:23,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:16:23,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2025-01-09 22:16:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157257213] [2025-01-09 22:16:23,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:16:23,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:16:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:16:23,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:16:23,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=3950, Unknown=5, NotChecked=0, Total=4290 [2025-01-09 22:16:23,656 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 48 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8)