./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:05:39,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:05:39,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:05:39,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:05:39,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:05:39,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:05:39,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:05:39,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:05:39,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:05:39,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:05:39,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:05:39,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:05:39,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:05:39,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:05:39,876 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:05:39,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:05:39,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:05:39,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:05:39,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:39,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:05:39,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:39,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:05:39,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:05:39,880 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-01-10 00:05:40,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:05:40,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:05:40,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:05:40,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:05:40,173 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:05:40,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-01-10 00:05:41,545 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e8763a7c/2a400ed5f0584526bc6790c447dc7e75/FLAG5f28d43fd [2025-01-10 00:05:41,928 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:05:41,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-01-10 00:05:41,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e8763a7c/2a400ed5f0584526bc6790c447dc7e75/FLAG5f28d43fd [2025-01-10 00:05:41,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e8763a7c/2a400ed5f0584526bc6790c447dc7e75 [2025-01-10 00:05:41,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:05:41,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:05:41,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:05:41,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:05:41,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:05:41,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:05:41" (1/1) ... [2025-01-10 00:05:41,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2ddbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:41, skipping insertion in model container [2025-01-10 00:05:41,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:05:41" (1/1) ... [2025-01-10 00:05:42,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:05:42,582 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,600 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,604 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,613 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,629 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,630 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,631 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,633 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,637 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,654 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:42,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:05:42,695 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:05:42,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:05:42,876 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:05:42,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42 WrapperNode [2025-01-10 00:05:42,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:05:42,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:05:42,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:05:42,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:05:42,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:42,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:42,969 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 729 [2025-01-10 00:05:42,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:05:42,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:05:42,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:05:42,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:05:42,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:42,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:42,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,021 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 12, 2, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 5, 2, 1, 2]. [2025-01-10 00:05:43,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:05:43,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:05:43,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:05:43,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:05:43,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (1/1) ... [2025-01-10 00:05:43,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:43,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:43,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:05:43,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:05:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:05:43,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:05:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:05:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:05:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:05:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 00:05:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 00:05:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 00:05:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 00:05:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 00:05:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 00:05:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 00:05:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:05:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 00:05:43,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 00:05:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 00:05:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:05:43,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:05:43,580 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:05:43,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:05:44,534 INFO L? ?]: Removed 258 outVars from TransFormulas that were not future-live. [2025-01-10 00:05:44,534 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:05:44,559 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:05:44,561 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:05:44,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:05:44 BoogieIcfgContainer [2025-01-10 00:05:44,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:05:44,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:05:44,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:05:44,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:05:44,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:05:41" (1/3) ... [2025-01-10 00:05:44,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48403ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:05:44, skipping insertion in model container [2025-01-10 00:05:44,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:42" (2/3) ... [2025-01-10 00:05:44,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48403ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:05:44, skipping insertion in model container [2025-01-10 00:05:44,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:05:44" (3/3) ... [2025-01-10 00:05:44,575 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-01-10 00:05:44,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:05:44,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 242 locations, 1 initial locations, 7 loop locations, and 96 error locations. [2025-01-10 00:05:44,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:05:44,658 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;@4dfc2e94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:05:44,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-01-10 00:05:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 142 states have (on average 1.943661971830986) internal successors, (276), 238 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:05:44,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:44,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:05:44,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:44,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2025-01-10 00:05:44,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632697442] [2025-01-10 00:05:44,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:44,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:05:44,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:05:44,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:44,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632697442] [2025-01-10 00:05:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632697442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:05:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662016456] [2025-01-10 00:05:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:05:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:45,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:05:45,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:05:45,338 INFO L87 Difference]: Start difference. First operand has 242 states, 142 states have (on average 1.943661971830986) internal successors, (276), 238 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:45,599 INFO L93 Difference]: Finished difference Result 251 states and 283 transitions. [2025-01-10 00:05:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:05:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:05:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:45,612 INFO L225 Difference]: With dead ends: 251 [2025-01-10 00:05:45,613 INFO L226 Difference]: Without dead ends: 249 [2025-01-10 00:05:45,615 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-10 00:05:45,617 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 235 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:45,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 199 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-10 00:05:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2025-01-10 00:05:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 138 states have (on average 1.8840579710144927) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-01-10 00:05:45,683 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 3 [2025-01-10 00:05:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:45,683 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-01-10 00:05:45,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-01-10 00:05:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:05:45,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:45,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:05:45,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:05:45,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:45,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2025-01-10 00:05:45,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:45,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902891447] [2025-01-10 00:05:45,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:45,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:45,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:05:45,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:05:45,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:45,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:46,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902891447] [2025-01-10 00:05:46,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902891447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:46,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:46,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:05:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785964793] [2025-01-10 00:05:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:46,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:05:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:46,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:05:46,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:05:46,056 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:46,264 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2025-01-10 00:05:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:05:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:05:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:46,266 INFO L225 Difference]: With dead ends: 232 [2025-01-10 00:05:46,266 INFO L226 Difference]: Without dead ends: 232 [2025-01-10 00:05:46,266 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-10 00:05:46,267 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:46,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 421 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-10 00:05:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-01-10 00:05:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 138 states have (on average 1.8768115942028984) internal successors, (259), 228 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 263 transitions. [2025-01-10 00:05:46,291 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 263 transitions. Word has length 3 [2025-01-10 00:05:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:46,291 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 263 transitions. [2025-01-10 00:05:46,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 263 transitions. [2025-01-10 00:05:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:05:46,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:46,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:05:46,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:05:46,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:46,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113833, now seen corresponding path program 1 times [2025-01-10 00:05:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550637476] [2025-01-10 00:05:46,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:46,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:05:46,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:05:46,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:46,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:46,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:46,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550637476] [2025-01-10 00:05:46,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550637476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:46,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:46,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:05:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54380371] [2025-01-10 00:05:46,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:46,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:05:46,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:46,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:05:46,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:05:46,674 INFO L87 Difference]: Start difference. First operand 232 states and 263 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:46,866 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-01-10 00:05:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:05:46,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:05:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:46,869 INFO L225 Difference]: With dead ends: 235 [2025-01-10 00:05:46,870 INFO L226 Difference]: Without dead ends: 235 [2025-01-10 00:05:46,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:05:46,871 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 11 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:46,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 421 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-10 00:05:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2025-01-10 00:05:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 140 states have (on average 1.8642857142857143) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-01-10 00:05:46,892 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 6 [2025-01-10 00:05:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:46,893 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-01-10 00:05:46,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-01-10 00:05:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:05:46,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:46,894 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:46,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:05:46,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:46,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 67611986, now seen corresponding path program 1 times [2025-01-10 00:05:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888206498] [2025-01-10 00:05:46,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:46,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:05:46,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:05:46,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:46,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888206498] [2025-01-10 00:05:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888206498] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:05:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094885375] [2025-01-10 00:05:47,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:47,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:05:47,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:05:47,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:05:47,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:05:47,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:47,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:47,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:05:47,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:05:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:47,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:05:47,856 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 7 treesize of output 5 [2025-01-10 00:05:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094885375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:05:47,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:05:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:05:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107181322] [2025-01-10 00:05:47,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:05:47,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:05:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:47,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:05:47,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:05:47,875 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:48,290 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2025-01-10 00:05:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:05:48,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:05:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:48,293 INFO L225 Difference]: With dead ends: 238 [2025-01-10 00:05:48,294 INFO L226 Difference]: Without dead ends: 238 [2025-01-10 00:05:48,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:05:48,295 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 500 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:48,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 915 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:05:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-10 00:05:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-01-10 00:05:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 145 states have (on average 1.8275862068965518) internal successors, (265), 234 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2025-01-10 00:05:48,309 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 9 [2025-01-10 00:05:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:48,309 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2025-01-10 00:05:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2025-01-10 00:05:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:05:48,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:48,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:48,327 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-10 00:05:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:48,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -413815119, now seen corresponding path program 1 times [2025-01-10 00:05:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767547194] [2025-01-10 00:05:48,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:48,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:05:48,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:05:48,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:48,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767547194] [2025-01-10 00:05:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767547194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:05:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608831910] [2025-01-10 00:05:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:48,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:48,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:48,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:05:48,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:05:48,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:05:49,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:05:49,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:49,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:49,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:05:49,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:05:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:49,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:05:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608831910] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:05:49,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:05:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 00:05:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817479346] [2025-01-10 00:05:49,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:05:49,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:05:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:49,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:05:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:05:49,154 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:49,211 INFO L93 Difference]: Finished difference Result 253 states and 284 transitions. [2025-01-10 00:05:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:05:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 00:05:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:49,213 INFO L225 Difference]: With dead ends: 253 [2025-01-10 00:05:49,213 INFO L226 Difference]: Without dead ends: 253 [2025-01-10 00:05:49,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:05:49,214 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 4 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:49,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1027 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:05:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-10 00:05:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-10 00:05:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 160 states have (on average 1.75) internal successors, (280), 249 states have internal predecessors, (280), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2025-01-10 00:05:49,223 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 15 [2025-01-10 00:05:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2025-01-10 00:05:49,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2025-01-10 00:05:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:05:49,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:49,225 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:49,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:05:49,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:49,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1609432984, now seen corresponding path program 2 times [2025-01-10 00:05:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:49,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985666232] [2025-01-10 00:05:49,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:05:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:49,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:05:49,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-01-10 00:05:49,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:05:49,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-10 00:05:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985666232] [2025-01-10 00:05:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985666232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:05:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267739355] [2025-01-10 00:05:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:05:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:49,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:05:49,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:49,726 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:49,884 INFO L93 Difference]: Finished difference Result 268 states and 300 transitions. [2025-01-10 00:05:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:05:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 00:05:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:49,886 INFO L225 Difference]: With dead ends: 268 [2025-01-10 00:05:49,886 INFO L226 Difference]: Without dead ends: 268 [2025-01-10 00:05:49,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:49,887 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 473 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:49,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 228 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:05:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-10 00:05:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2025-01-10 00:05:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 160 states have (on average 1.74375) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-01-10 00:05:49,896 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 30 [2025-01-10 00:05:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-01-10 00:05:49,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-01-10 00:05:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:05:49,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:49,897 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:49,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:05:49,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:49,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1609432983, now seen corresponding path program 1 times [2025-01-10 00:05:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585468789] [2025-01-10 00:05:49,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:49,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:05:49,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:05:49,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:49,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585468789] [2025-01-10 00:05:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585468789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:05:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173834483] [2025-01-10 00:05:50,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:50,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:50,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:05:50,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:05:50,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:05:50,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:05:50,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:50,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:05:50,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:05:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:50,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:05:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:05:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173834483] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:05:50,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:05:50,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-01-10 00:05:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987576841] [2025-01-10 00:05:50,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:05:50,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:05:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:50,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:05:50,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:05:50,782 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:50,846 INFO L93 Difference]: Finished difference Result 258 states and 289 transitions. [2025-01-10 00:05:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:05:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 00:05:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:50,848 INFO L225 Difference]: With dead ends: 258 [2025-01-10 00:05:50,848 INFO L226 Difference]: Without dead ends: 258 [2025-01-10 00:05:50,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:05:50,850 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:50,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 768 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:05:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-10 00:05:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-01-10 00:05:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 166 states have (on average 1.716867469879518) internal successors, (285), 254 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 289 transitions. [2025-01-10 00:05:50,859 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 289 transitions. Word has length 30 [2025-01-10 00:05:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:50,859 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 289 transitions. [2025-01-10 00:05:50,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 289 transitions. [2025-01-10 00:05:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:05:50,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:50,861 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:50,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:05:51,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:51,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:51,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1927765047, now seen corresponding path program 2 times [2025-01-10 00:05:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95282072] [2025-01-10 00:05:51,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:05:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:51,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:05:51,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:05:51,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:05:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:51,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95282072] [2025-01-10 00:05:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95282072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:05:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325285710] [2025-01-10 00:05:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:51,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:05:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:51,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:05:51,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:05:51,368 INFO L87 Difference]: Start difference. First operand 258 states and 289 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:51,619 INFO L93 Difference]: Finished difference Result 273 states and 305 transitions. [2025-01-10 00:05:51,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:05:51,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-10 00:05:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:51,621 INFO L225 Difference]: With dead ends: 273 [2025-01-10 00:05:51,621 INFO L226 Difference]: Without dead ends: 273 [2025-01-10 00:05:51,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:51,622 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 501 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:51,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 144 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-10 00:05:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 257. [2025-01-10 00:05:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 166 states have (on average 1.7108433734939759) internal successors, (284), 253 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 288 transitions. [2025-01-10 00:05:51,634 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 288 transitions. Word has length 36 [2025-01-10 00:05:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:51,635 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 288 transitions. [2025-01-10 00:05:51,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:05:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 288 transitions. [2025-01-10 00:05:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:05:51,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:51,636 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:51,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:05:51,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:51,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash -734440912, now seen corresponding path program 1 times [2025-01-10 00:05:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:51,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731116179] [2025-01-10 00:05:51,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:51,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:05:51,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:05:51,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:51,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:51,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731116179] [2025-01-10 00:05:51,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731116179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:51,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:05:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349460206] [2025-01-10 00:05:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:51,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:05:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:51,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:05:51,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:05:51,976 INFO L87 Difference]: Start difference. First operand 257 states and 288 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:52,119 INFO L93 Difference]: Finished difference Result 268 states and 300 transitions. [2025-01-10 00:05:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:05:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:05:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:52,121 INFO L225 Difference]: With dead ends: 268 [2025-01-10 00:05:52,121 INFO L226 Difference]: Without dead ends: 268 [2025-01-10 00:05:52,121 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-10 00:05:52,122 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 215 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:52,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 201 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:05:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-10 00:05:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2025-01-10 00:05:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 166 states have (on average 1.680722891566265) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-01-10 00:05:52,132 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 44 [2025-01-10 00:05:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:52,133 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-01-10 00:05:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-01-10 00:05:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:05:52,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:52,136 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:52,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:05:52,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:52,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -734440911, now seen corresponding path program 1 times [2025-01-10 00:05:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:52,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365446925] [2025-01-10 00:05:52,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:52,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:52,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:05:52,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:05:52,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:52,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365446925] [2025-01-10 00:05:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365446925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:05:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481735211] [2025-01-10 00:05:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:05:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:52,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:05:52,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:05:52,938 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:53,270 INFO L93 Difference]: Finished difference Result 411 states and 472 transitions. [2025-01-10 00:05:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:05:53,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:05:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:53,273 INFO L225 Difference]: With dead ends: 411 [2025-01-10 00:05:53,273 INFO L226 Difference]: Without dead ends: 411 [2025-01-10 00:05:53,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:05:53,274 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 590 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:53,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 757 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:05:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-10 00:05:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 251. [2025-01-10 00:05:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 166 states have (on average 1.6746987951807228) internal successors, (278), 247 states have internal predecessors, (278), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 282 transitions. [2025-01-10 00:05:53,290 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 282 transitions. Word has length 44 [2025-01-10 00:05:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:53,291 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 282 transitions. [2025-01-10 00:05:53,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 282 transitions. [2025-01-10 00:05:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:05:53,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:53,292 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:53,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:05:53,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1165799466, now seen corresponding path program 1 times [2025-01-10 00:05:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370146076] [2025-01-10 00:05:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:53,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:05:53,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:05:53,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:53,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370146076] [2025-01-10 00:05:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370146076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:05:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010429334] [2025-01-10 00:05:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:05:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:53,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:05:53,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:53,734 INFO L87 Difference]: Start difference. First operand 251 states and 282 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:54,023 INFO L93 Difference]: Finished difference Result 285 states and 320 transitions. [2025-01-10 00:05:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:05:54,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:05:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:54,025 INFO L225 Difference]: With dead ends: 285 [2025-01-10 00:05:54,025 INFO L226 Difference]: Without dead ends: 285 [2025-01-10 00:05:54,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:54,026 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 289 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:54,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 301 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:05:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-10 00:05:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2025-01-10 00:05:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 180 states have (on average 1.6611111111111112) internal successors, (299), 260 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2025-01-10 00:05:54,042 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 47 [2025-01-10 00:05:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:54,042 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2025-01-10 00:05:54,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2025-01-10 00:05:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:05:54,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:54,045 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:54,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:05:54,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:54,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1165798379, now seen corresponding path program 1 times [2025-01-10 00:05:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:54,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809043633] [2025-01-10 00:05:54,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:54,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:05:54,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:05:54,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:54,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809043633] [2025-01-10 00:05:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809043633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:05:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423024775] [2025-01-10 00:05:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:54,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:05:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:54,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:05:54,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:05:54,244 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:54,434 INFO L93 Difference]: Finished difference Result 295 states and 341 transitions. [2025-01-10 00:05:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:05:54,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:05:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:54,436 INFO L225 Difference]: With dead ends: 295 [2025-01-10 00:05:54,436 INFO L226 Difference]: Without dead ends: 295 [2025-01-10 00:05:54,437 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-10 00:05:54,437 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 383 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:54,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 254 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-10 00:05:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 257. [2025-01-10 00:05:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 180 states have (on average 1.6222222222222222) internal successors, (292), 253 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 296 transitions. [2025-01-10 00:05:54,444 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 296 transitions. Word has length 47 [2025-01-10 00:05:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:54,444 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 296 transitions. [2025-01-10 00:05:54,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 296 transitions. [2025-01-10 00:05:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:05:54,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:54,445 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:54,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:05:54,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1165798378, now seen corresponding path program 1 times [2025-01-10 00:05:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973137568] [2025-01-10 00:05:54,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:05:54,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:05:54,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:54,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973137568] [2025-01-10 00:05:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973137568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:05:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113324594] [2025-01-10 00:05:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:54,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:05:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:54,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:05:54,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:54,753 INFO L87 Difference]: Start difference. First operand 257 states and 296 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:54,832 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2025-01-10 00:05:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:05:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:05:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:54,834 INFO L225 Difference]: With dead ends: 262 [2025-01-10 00:05:54,834 INFO L226 Difference]: Without dead ends: 262 [2025-01-10 00:05:54,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:54,834 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 228 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:54,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 936 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:05:54,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-10 00:05:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 257. [2025-01-10 00:05:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 253 states have internal predecessors, (291), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 295 transitions. [2025-01-10 00:05:54,841 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 295 transitions. Word has length 47 [2025-01-10 00:05:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:54,841 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 295 transitions. [2025-01-10 00:05:54,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 295 transitions. [2025-01-10 00:05:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:05:54,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:54,843 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:05:54,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:54,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1226353989, now seen corresponding path program 1 times [2025-01-10 00:05:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697818190] [2025-01-10 00:05:54,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:54,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:05:54,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:05:54,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:54,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:55,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697818190] [2025-01-10 00:05:55,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697818190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:55,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:55,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:05:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093782255] [2025-01-10 00:05:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:55,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:05:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:55,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:05:55,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:05:55,676 INFO L87 Difference]: Start difference. First operand 257 states and 295 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:56,415 INFO L93 Difference]: Finished difference Result 419 states and 484 transitions. [2025-01-10 00:05:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:05:56,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 00:05:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:56,418 INFO L225 Difference]: With dead ends: 419 [2025-01-10 00:05:56,419 INFO L226 Difference]: Without dead ends: 419 [2025-01-10 00:05:56,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:05:56,420 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 613 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:56,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 492 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:05:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-01-10 00:05:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 258. [2025-01-10 00:05:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.6043956043956045) internal successors, (292), 254 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 296 transitions. [2025-01-10 00:05:56,429 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 296 transitions. Word has length 50 [2025-01-10 00:05:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:56,430 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 296 transitions. [2025-01-10 00:05:56,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2025-01-10 00:05:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:05:56,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:56,431 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:05:56,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1319877412, now seen corresponding path program 1 times [2025-01-10 00:05:56,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:56,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764024423] [2025-01-10 00:05:56,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:56,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:05:56,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:05:56,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:56,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:56,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:56,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764024423] [2025-01-10 00:05:56,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764024423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:56,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:56,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:05:56,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785987688] [2025-01-10 00:05:56,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:56,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:05:56,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:56,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:05:56,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:05:56,778 INFO L87 Difference]: Start difference. First operand 258 states and 296 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:56,993 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2025-01-10 00:05:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:05:56,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-01-10 00:05:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:56,994 INFO L225 Difference]: With dead ends: 257 [2025-01-10 00:05:56,994 INFO L226 Difference]: Without dead ends: 257 [2025-01-10 00:05:56,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:56,995 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 12 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:56,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 697 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-10 00:05:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-01-10 00:05:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 253 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 294 transitions. [2025-01-10 00:05:57,003 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 294 transitions. Word has length 53 [2025-01-10 00:05:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:57,003 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 294 transitions. [2025-01-10 00:05:57,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 294 transitions. [2025-01-10 00:05:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:05:57,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:57,005 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:05:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:05:57,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:57,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1319877411, now seen corresponding path program 1 times [2025-01-10 00:05:57,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:57,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722002132] [2025-01-10 00:05:57,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:57,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:57,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:05:57,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:05:57,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:57,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:57,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722002132] [2025-01-10 00:05:57,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722002132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:57,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:57,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:05:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352363016] [2025-01-10 00:05:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:57,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:05:57,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:57,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:05:57,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:05:57,560 INFO L87 Difference]: Start difference. First operand 257 states and 294 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:57,798 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2025-01-10 00:05:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:05:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-01-10 00:05:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:57,800 INFO L225 Difference]: With dead ends: 256 [2025-01-10 00:05:57,800 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 00:05:57,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:57,800 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 11 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:57,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 699 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 00:05:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-01-10 00:05:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 182 states have (on average 1.5824175824175823) internal successors, (288), 252 states have internal predecessors, (288), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2025-01-10 00:05:57,810 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 53 [2025-01-10 00:05:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:57,810 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2025-01-10 00:05:57,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2025-01-10 00:05:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 00:05:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:57,811 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-01-10 00:05:57,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:05:57,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1313153108, now seen corresponding path program 1 times [2025-01-10 00:05:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398411763] [2025-01-10 00:05:57,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:57,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 00:05:57,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 00:05:57,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:57,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398411763] [2025-01-10 00:05:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398411763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:05:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356412806] [2025-01-10 00:05:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:57,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:05:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:57,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:05:57,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:05:57,955 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:57,970 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2025-01-10 00:05:57,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:05:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-01-10 00:05:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:57,973 INFO L225 Difference]: With dead ends: 268 [2025-01-10 00:05:57,973 INFO L226 Difference]: Without dead ends: 268 [2025-01-10 00:05:57,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:05:57,974 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 6 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:57,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 475 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:05:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-10 00:05:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2025-01-10 00:05:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 184 states have (on average 1.576086956521739) internal successors, (290), 254 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 294 transitions. [2025-01-10 00:05:57,982 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 294 transitions. Word has length 57 [2025-01-10 00:05:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:57,982 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 294 transitions. [2025-01-10 00:05:57,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2025-01-10 00:05:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:05:57,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:57,983 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-10 00:05:57,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:05:57,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:57,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2053315712, now seen corresponding path program 1 times [2025-01-10 00:05:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406072264] [2025-01-10 00:05:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:57,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:58,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:05:58,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:05:58,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:58,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406072264] [2025-01-10 00:05:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406072264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:58,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:58,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:05:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701750456] [2025-01-10 00:05:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:58,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:05:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:58,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:05:58,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:05:58,232 INFO L87 Difference]: Start difference. First operand 258 states and 294 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:58,419 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2025-01-10 00:05:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:05:58,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:05:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:58,421 INFO L225 Difference]: With dead ends: 257 [2025-01-10 00:05:58,421 INFO L226 Difference]: Without dead ends: 257 [2025-01-10 00:05:58,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:05:58,421 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 5 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:58,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 757 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:05:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-10 00:05:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-01-10 00:05:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 184 states have (on average 1.565217391304348) internal successors, (288), 253 states have internal predecessors, (288), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2025-01-10 00:05:58,428 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 58 [2025-01-10 00:05:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:58,429 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2025-01-10 00:05:58,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2025-01-10 00:05:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:05:58,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:58,430 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-10 00:05:58,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:05:58,430 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:58,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2053315711, now seen corresponding path program 1 times [2025-01-10 00:05:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:58,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201527227] [2025-01-10 00:05:58,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:58,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:05:58,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:05:58,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:58,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201527227] [2025-01-10 00:05:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201527227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:05:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:05:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:05:59,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857435088] [2025-01-10 00:05:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:05:59,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:05:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:05:59,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:05:59,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:05:59,328 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:05:59,611 INFO L93 Difference]: Finished difference Result 265 states and 301 transitions. [2025-01-10 00:05:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:05:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:05:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:05:59,613 INFO L225 Difference]: With dead ends: 265 [2025-01-10 00:05:59,613 INFO L226 Difference]: Without dead ends: 265 [2025-01-10 00:05:59,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:05:59,614 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 14 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:05:59,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 696 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:05:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-10 00:05:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-01-10 00:05:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.5526315789473684) internal successors, (295), 259 states have internal predecessors, (295), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:05:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 299 transitions. [2025-01-10 00:05:59,623 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 299 transitions. Word has length 58 [2025-01-10 00:05:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:05:59,623 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 299 transitions. [2025-01-10 00:05:59,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:05:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 299 transitions. [2025-01-10 00:05:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 00:05:59,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:05:59,625 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-01-10 00:05:59,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:05:59,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:05:59,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:05:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash -577699644, now seen corresponding path program 1 times [2025-01-10 00:05:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:05:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805553910] [2025-01-10 00:05:59,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:05:59,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:05:59,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:05:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:05:59,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:05:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:05:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:05:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805553910] [2025-01-10 00:05:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805553910] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:05:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151575455] [2025-01-10 00:05:59,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:05:59,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:05:59,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:59,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:05:59,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:06:00,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:06:00,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:06:00,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:00,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:00,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:06:00,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:00,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151575455] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:00,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:00,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:06:00,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670032399] [2025-01-10 00:06:00,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:00,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:06:00,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:00,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:06:00,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:06:00,251 INFO L87 Difference]: Start difference. First operand 263 states and 299 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:00,288 INFO L93 Difference]: Finished difference Result 290 states and 329 transitions. [2025-01-10 00:06:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:06:00,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-01-10 00:06:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:00,290 INFO L225 Difference]: With dead ends: 290 [2025-01-10 00:06:00,291 INFO L226 Difference]: Without dead ends: 290 [2025-01-10 00:06:00,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:06:00,291 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 14 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:00,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 946 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-10 00:06:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2025-01-10 00:06:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.5186915887850467) internal successors, (325), 283 states have internal predecessors, (325), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 329 transitions. [2025-01-10 00:06:00,302 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 329 transitions. Word has length 62 [2025-01-10 00:06:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:00,302 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 329 transitions. [2025-01-10 00:06:00,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 329 transitions. [2025-01-10 00:06:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:06:00,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:00,304 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 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, 1] [2025-01-10 00:06:00,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:06:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:00,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:00,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash -729094807, now seen corresponding path program 1 times [2025-01-10 00:06:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349051560] [2025-01-10 00:06:00,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:00,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:06:00,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:06:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:01,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349051560] [2025-01-10 00:06:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349051560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064110381] [2025-01-10 00:06:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:01,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:01,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:01,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:06:01,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:06:01,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:06:01,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:01,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:01,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:06:01,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:01,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:06:01,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:06:01,625 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 23 treesize of output 1 [2025-01-10 00:06:01,844 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 36 treesize of output 12 [2025-01-10 00:06:01,851 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 25 treesize of output 9 [2025-01-10 00:06:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:01,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064110381] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:02,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-01-10 00:06:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506181538] [2025-01-10 00:06:02,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:02,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 00:06:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:02,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 00:06:02,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:06:02,145 INFO L87 Difference]: Start difference. First operand 287 states and 329 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:02,890 INFO L93 Difference]: Finished difference Result 286 states and 323 transitions. [2025-01-10 00:06:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:06:02,890 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 00:06:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:02,892 INFO L225 Difference]: With dead ends: 286 [2025-01-10 00:06:02,892 INFO L226 Difference]: Without dead ends: 286 [2025-01-10 00:06:02,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2025-01-10 00:06:02,894 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 30 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:02,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1750 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:06:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-10 00:06:02,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-01-10 00:06:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 282 states have internal predecessors, (319), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 323 transitions. [2025-01-10 00:06:02,902 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 323 transitions. Word has length 63 [2025-01-10 00:06:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:02,902 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 323 transitions. [2025-01-10 00:06:02,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 323 transitions. [2025-01-10 00:06:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 00:06:02,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:02,903 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 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] [2025-01-10 00:06:02,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:06:03,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:03,108 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1239285164, now seen corresponding path program 2 times [2025-01-10 00:06:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940358934] [2025-01-10 00:06:03,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:06:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:03,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-10 00:06:03,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:06:03,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:06:03,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940358934] [2025-01-10 00:06:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940358934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:03,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835927525] [2025-01-10 00:06:03,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:06:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:03,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:03,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:06:03,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-10 00:06:03,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:06:03,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:06:03,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:03,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:06:03,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:03,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835927525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:03,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:03,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:06:03,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27113226] [2025-01-10 00:06:03,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:03,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:06:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:03,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:06:03,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:06:03,983 INFO L87 Difference]: Start difference. First operand 286 states and 323 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:04,042 INFO L93 Difference]: Finished difference Result 355 states and 389 transitions. [2025-01-10 00:06:04,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:06:04,046 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-01-10 00:06:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:04,048 INFO L225 Difference]: With dead ends: 355 [2025-01-10 00:06:04,048 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 00:06:04,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:06:04,050 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 31 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:04,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 964 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 00:06:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2025-01-10 00:06:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 274 states have (on average 1.405109489051095) internal successors, (385), 342 states have internal predecessors, (385), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 389 transitions. [2025-01-10 00:06:04,058 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 389 transitions. Word has length 77 [2025-01-10 00:06:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:04,059 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 389 transitions. [2025-01-10 00:06:04,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 389 transitions. [2025-01-10 00:06:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 00:06:04,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:04,060 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-01-10 00:06:04,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:06:04,260 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,SelfDestructingSolverStorable21 [2025-01-10 00:06:04,262 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 906758828, now seen corresponding path program 3 times [2025-01-10 00:06:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533782699] [2025-01-10 00:06:04,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:06:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:04,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-01-10 00:06:04,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-01-10 00:06:04,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 00:06:04,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533782699] [2025-01-10 00:06:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533782699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140735062] [2025-01-10 00:06:04,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:06:04,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:04,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:04,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:04,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:06:05,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-01-10 00:06:05,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-01-10 00:06:05,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 00:06:05,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:05,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:06:05,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:05,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:06:05,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:06:05,279 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 19 treesize of output 14 [2025-01-10 00:06:05,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:06:05,398 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 8 treesize of output 4 [2025-01-10 00:06:05,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:06:05,903 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 16 treesize of output 11 [2025-01-10 00:06:05,913 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:06:05,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:06:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:05,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:07,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:06:07,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:06:07,554 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 49 treesize of output 45 [2025-01-10 00:06:07,584 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-01-10 00:06:07,584 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 36 treesize of output 49 [2025-01-10 00:06:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:07,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140735062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:07,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:07,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-01-10 00:06:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627278288] [2025-01-10 00:06:07,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:07,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 00:06:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:07,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 00:06:07,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-01-10 00:06:07,633 INFO L87 Difference]: Start difference. First operand 346 states and 389 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:08,426 INFO L93 Difference]: Finished difference Result 409 states and 445 transitions. [2025-01-10 00:06:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:06:08,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-01-10 00:06:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:08,428 INFO L225 Difference]: With dead ends: 409 [2025-01-10 00:06:08,428 INFO L226 Difference]: Without dead ends: 409 [2025-01-10 00:06:08,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2025-01-10 00:06:08,430 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 801 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:08,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 837 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:06:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-10 00:06:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 287. [2025-01-10 00:06:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 219 states have (on average 1.4429223744292237) internal successors, (316), 283 states have internal predecessors, (316), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 320 transitions. [2025-01-10 00:06:08,437 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 320 transitions. Word has length 107 [2025-01-10 00:06:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:08,437 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 320 transitions. [2025-01-10 00:06:08,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 320 transitions. [2025-01-10 00:06:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 00:06:08,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:08,440 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:08,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 00:06:08,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:08,641 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:08,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 906759916, now seen corresponding path program 1 times [2025-01-10 00:06:08,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:08,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128612625] [2025-01-10 00:06:08,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:08,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 00:06:08,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 00:06:08,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128612625] [2025-01-10 00:06:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128612625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665287153] [2025-01-10 00:06:09,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:09,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:09,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:09,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:09,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:06:09,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 00:06:09,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 00:06:09,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:09,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:09,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:06:09,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:10,032 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:06:10,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-10 00:06:10,072 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:06:10,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:06:10,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:06:10,188 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 12 treesize of output 4 [2025-01-10 00:06:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-10 00:06:10,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:10,687 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 49 treesize of output 45 [2025-01-10 00:06:10,713 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-01-10 00:06:10,713 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 36 treesize of output 49 [2025-01-10 00:06:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665287153] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:10,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 19 [2025-01-10 00:06:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531075186] [2025-01-10 00:06:10,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:10,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:06:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:10,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:06:10,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:06:10,753 INFO L87 Difference]: Start difference. First operand 287 states and 320 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:11,432 INFO L93 Difference]: Finished difference Result 355 states and 389 transitions. [2025-01-10 00:06:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:06:11,433 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-01-10 00:06:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:11,435 INFO L225 Difference]: With dead ends: 355 [2025-01-10 00:06:11,436 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 00:06:11,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2025-01-10 00:06:11,437 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1687 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:11,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 744 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:06:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 00:06:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 284. [2025-01-10 00:06:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 280 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 317 transitions. [2025-01-10 00:06:11,445 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 317 transitions. Word has length 107 [2025-01-10 00:06:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:11,447 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 317 transitions. [2025-01-10 00:06:11,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 20 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2025-01-10 00:06:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 00:06:11,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:11,448 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:11,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:06:11,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:11,649 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2092064731, now seen corresponding path program 1 times [2025-01-10 00:06:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:11,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089324978] [2025-01-10 00:06:11,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:11,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 00:06:11,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 00:06:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:12,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089324978] [2025-01-10 00:06:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089324978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:12,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208610309] [2025-01-10 00:06:12,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:12,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:12,986 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:12,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:06:13,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 00:06:13,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 00:06:13,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:13,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:13,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-10 00:06:13,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:13,464 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:06:13,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-10 00:06:13,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-01-10 00:06:13,694 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-01-10 00:06:13,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 45 [2025-01-10 00:06:13,744 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-10 00:06:13,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:06:13,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:06:14,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 00:06:15,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:06:15,542 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:06:15,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2025-01-10 00:06:15,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:06:15,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:06:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-10 00:06:15,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:16,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:06:16,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-01-10 00:06:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208610309] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:16,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:16,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 23 [2025-01-10 00:06:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235885465] [2025-01-10 00:06:16,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:16,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:06:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:16,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:06:16,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-01-10 00:06:16,900 INFO L87 Difference]: Start difference. First operand 284 states and 317 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:18,007 INFO L93 Difference]: Finished difference Result 405 states and 442 transitions. [2025-01-10 00:06:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:06:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2025-01-10 00:06:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:18,009 INFO L225 Difference]: With dead ends: 405 [2025-01-10 00:06:18,009 INFO L226 Difference]: Without dead ends: 405 [2025-01-10 00:06:18,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-01-10 00:06:18,010 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1375 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:18,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 795 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 00:06:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-10 00:06:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 279. [2025-01-10 00:06:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 275 states have internal predecessors, (308), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2025-01-10 00:06:18,017 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 110 [2025-01-10 00:06:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:18,017 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2025-01-10 00:06:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2025-01-10 00:06:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 00:06:18,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:18,018 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:18,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:06:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:18,219 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:18,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2059504008, now seen corresponding path program 1 times [2025-01-10 00:06:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72380606] [2025-01-10 00:06:18,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:18,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 00:06:18,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 00:06:18,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:18,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:18,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72380606] [2025-01-10 00:06:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72380606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:18,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:06:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387334713] [2025-01-10 00:06:18,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:18,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:06:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:18,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:06:18,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:06:18,783 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:19,003 INFO L93 Difference]: Finished difference Result 326 states and 370 transitions. [2025-01-10 00:06:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:06:19,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-01-10 00:06:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:19,005 INFO L225 Difference]: With dead ends: 326 [2025-01-10 00:06:19,005 INFO L226 Difference]: Without dead ends: 326 [2025-01-10 00:06:19,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:06:19,008 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 353 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:19,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 639 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:06:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-10 00:06:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 282. [2025-01-10 00:06:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 218 states have (on average 1.4311926605504588) internal successors, (312), 278 states have internal predecessors, (312), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 00:06:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 316 transitions. [2025-01-10 00:06:19,015 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 316 transitions. Word has length 110 [2025-01-10 00:06:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:19,016 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 316 transitions. [2025-01-10 00:06:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 316 transitions. [2025-01-10 00:06:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-10 00:06:19,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:19,018 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:19,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:06:19,018 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:19,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash 796713345, now seen corresponding path program 1 times [2025-01-10 00:06:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:19,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669762701] [2025-01-10 00:06:19,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:19,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-10 00:06:19,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-10 00:06:19,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:19,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669762701] [2025-01-10 00:06:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669762701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013672350] [2025-01-10 00:06:19,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:19,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:19,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:19,449 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:19,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:06:19,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-10 00:06:19,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-10 00:06:19,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:19,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:19,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:06:19,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:20,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:20,348 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 22 treesize of output 18 [2025-01-10 00:06:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013672350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:20,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:20,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-01-10 00:06:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973276050] [2025-01-10 00:06:20,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:20,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:06:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:20,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:06:20,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:06:20,385 INFO L87 Difference]: Start difference. First operand 282 states and 316 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:20,827 INFO L93 Difference]: Finished difference Result 408 states and 456 transitions. [2025-01-10 00:06:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:06:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-01-10 00:06:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:20,830 INFO L225 Difference]: With dead ends: 408 [2025-01-10 00:06:20,830 INFO L226 Difference]: Without dead ends: 408 [2025-01-10 00:06:20,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:06:20,831 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 453 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:20,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1128 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 00:06:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-10 00:06:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 325. [2025-01-10 00:06:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 261 states have (on average 1.4674329501915708) internal successors, (383), 320 states have internal predecessors, (383), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:06:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 389 transitions. [2025-01-10 00:06:20,843 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 389 transitions. Word has length 112 [2025-01-10 00:06:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:20,844 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 389 transitions. [2025-01-10 00:06:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 389 transitions. [2025-01-10 00:06:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 00:06:20,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:20,845 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:20,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 00:06:21,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-10 00:06:21,046 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:21,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash -124536705, now seen corresponding path program 1 times [2025-01-10 00:06:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886659364] [2025-01-10 00:06:21,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:21,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 00:06:21,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 00:06:21,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:21,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886659364] [2025-01-10 00:06:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886659364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867918837] [2025-01-10 00:06:22,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:22,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:22,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:22,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:22,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 00:06:23,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 00:06:23,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 00:06:23,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:23,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:23,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:06:23,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:23,380 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-10 00:06:23,386 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-10 00:06:23,463 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-01-10 00:06:23,464 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 1 case distinctions, treesize of input 27 treesize of output 15 [2025-01-10 00:06:23,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 00:06:23,472 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 27 treesize of output 15 [2025-01-10 00:06:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:24,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867918837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:24,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-01-10 00:06:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576496674] [2025-01-10 00:06:24,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:06:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:24,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:06:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:06:24,566 INFO L87 Difference]: Start difference. First operand 325 states and 389 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:25,084 INFO L93 Difference]: Finished difference Result 536 states and 655 transitions. [2025-01-10 00:06:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:06:25,085 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-01-10 00:06:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:25,087 INFO L225 Difference]: With dead ends: 536 [2025-01-10 00:06:25,087 INFO L226 Difference]: Without dead ends: 536 [2025-01-10 00:06:25,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-01-10 00:06:25,088 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 700 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:25,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 2528 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:06:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-10 00:06:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 387. [2025-01-10 00:06:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 323 states have (on average 1.3839009287925697) internal successors, (447), 382 states have internal predecessors, (447), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:06:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 453 transitions. [2025-01-10 00:06:25,097 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 453 transitions. Word has length 113 [2025-01-10 00:06:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:25,098 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 453 transitions. [2025-01-10 00:06:25,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 20 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 453 transitions. [2025-01-10 00:06:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 00:06:25,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:25,099 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:25,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 00:06:25,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 00:06:25,300 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:25,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:25,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1071689739, now seen corresponding path program 1 times [2025-01-10 00:06:25,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:25,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62648594] [2025-01-10 00:06:25,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:25,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:25,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 00:06:25,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 00:06:25,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:25,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62648594] [2025-01-10 00:06:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62648594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579108707] [2025-01-10 00:06:26,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:26,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:26,107 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:26,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 00:06:26,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 00:06:26,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 00:06:26,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:26,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:26,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 00:06:26,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:26,688 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 1 [2025-01-10 00:06:26,741 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-10 00:06:26,832 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 26 treesize of output 14 [2025-01-10 00:06:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-10 00:06:27,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:27,138 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 14 treesize of output 12 [2025-01-10 00:06:27,141 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 18 treesize of output 16 [2025-01-10 00:06:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-10 00:06:27,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579108707] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:27,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:27,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2025-01-10 00:06:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313595583] [2025-01-10 00:06:27,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 00:06:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:27,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 00:06:27,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-01-10 00:06:27,219 INFO L87 Difference]: Start difference. First operand 387 states and 453 transitions. Second operand has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:27,526 INFO L93 Difference]: Finished difference Result 542 states and 663 transitions. [2025-01-10 00:06:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:06:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-01-10 00:06:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:27,529 INFO L225 Difference]: With dead ends: 542 [2025-01-10 00:06:27,529 INFO L226 Difference]: Without dead ends: 542 [2025-01-10 00:06:27,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-01-10 00:06:27,530 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 353 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:27,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 2690 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:06:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-10 00:06:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 496. [2025-01-10 00:06:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 430 states have (on average 1.472093023255814) internal successors, (633), 489 states have internal predecessors, (633), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 643 transitions. [2025-01-10 00:06:27,541 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 643 transitions. Word has length 113 [2025-01-10 00:06:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:27,541 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 643 transitions. [2025-01-10 00:06:27,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 643 transitions. [2025-01-10 00:06:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 00:06:27,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:27,542 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 00:06:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 00:06:27,746 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:27,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1071678786, now seen corresponding path program 1 times [2025-01-10 00:06:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689607009] [2025-01-10 00:06:27,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:27,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:27,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 00:06:27,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 00:06:27,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:27,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:27,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689607009] [2025-01-10 00:06:27,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689607009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:27,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:27,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:27,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837618549] [2025-01-10 00:06:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:27,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:27,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:27,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:27,988 INFO L87 Difference]: Start difference. First operand 496 states and 643 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:28,020 INFO L93 Difference]: Finished difference Result 495 states and 642 transitions. [2025-01-10 00:06:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:28,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-01-10 00:06:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:28,022 INFO L225 Difference]: With dead ends: 495 [2025-01-10 00:06:28,022 INFO L226 Difference]: Without dead ends: 495 [2025-01-10 00:06:28,022 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-10 00:06:28,023 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 173 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:28,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 241 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-10 00:06:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-01-10 00:06:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 430 states have (on average 1.4697674418604652) internal successors, (632), 488 states have internal predecessors, (632), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 642 transitions. [2025-01-10 00:06:28,034 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 642 transitions. Word has length 113 [2025-01-10 00:06:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:28,035 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 642 transitions. [2025-01-10 00:06:28,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 642 transitions. [2025-01-10 00:06:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 00:06:28,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:28,036 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:28,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 00:06:28,036 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1075938859, now seen corresponding path program 1 times [2025-01-10 00:06:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341461540] [2025-01-10 00:06:28,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 00:06:28,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 00:06:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:28,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341461540] [2025-01-10 00:06:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341461540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:06:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292535056] [2025-01-10 00:06:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:28,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:06:28,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:28,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:06:28,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:06:28,582 INFO L87 Difference]: Start difference. First operand 495 states and 642 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:28,699 INFO L93 Difference]: Finished difference Result 537 states and 690 transitions. [2025-01-10 00:06:28,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:06:28,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2025-01-10 00:06:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:28,702 INFO L225 Difference]: With dead ends: 537 [2025-01-10 00:06:28,702 INFO L226 Difference]: Without dead ends: 537 [2025-01-10 00:06:28,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:06:28,703 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 41 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:28,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1276 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-10 00:06:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 493. [2025-01-10 00:06:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 428 states have (on average 1.4532710280373833) internal successors, (622), 486 states have internal predecessors, (622), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 632 transitions. [2025-01-10 00:06:28,716 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 632 transitions. Word has length 113 [2025-01-10 00:06:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:28,716 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 632 transitions. [2025-01-10 00:06:28,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 632 transitions. [2025-01-10 00:06:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-10 00:06:28,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:28,721 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:28,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 00:06:28,721 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:28,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:28,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1137356896, now seen corresponding path program 1 times [2025-01-10 00:06:28,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:28,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736330772] [2025-01-10 00:06:28,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:28,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 00:06:28,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 00:06:28,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:28,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736330772] [2025-01-10 00:06:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736330772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320250344] [2025-01-10 00:06:29,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:29,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:29,845 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:29,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 00:06:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 00:06:30,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 00:06:30,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:30,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:30,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 00:06:30,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:30,410 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 1 [2025-01-10 00:06:30,419 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 17 treesize of output 9 [2025-01-10 00:06:30,427 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 1 [2025-01-10 00:06:30,598 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 17 treesize of output 9 [2025-01-10 00:06:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:30,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:30,692 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 14 treesize of output 12 [2025-01-10 00:06:30,693 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 18 treesize of output 16 [2025-01-10 00:06:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320250344] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:30,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 16 [2025-01-10 00:06:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505681060] [2025-01-10 00:06:30,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:30,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 00:06:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:30,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 00:06:30,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:06:30,754 INFO L87 Difference]: Start difference. First operand 493 states and 632 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:30,957 INFO L93 Difference]: Finished difference Result 532 states and 651 transitions. [2025-01-10 00:06:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:06:30,958 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-01-10 00:06:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:30,959 INFO L225 Difference]: With dead ends: 532 [2025-01-10 00:06:30,959 INFO L226 Difference]: Without dead ends: 532 [2025-01-10 00:06:30,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-10 00:06:30,960 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 525 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:30,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1701 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-10 00:06:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 494. [2025-01-10 00:06:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 429 states have (on average 1.4522144522144522) internal successors, (623), 487 states have internal predecessors, (623), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 633 transitions. [2025-01-10 00:06:30,972 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 633 transitions. Word has length 114 [2025-01-10 00:06:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:30,972 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 633 transitions. [2025-01-10 00:06:30,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 633 transitions. [2025-01-10 00:06:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-10 00:06:30,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:30,974 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:30,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 00:06:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:31,174 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1137696449, now seen corresponding path program 1 times [2025-01-10 00:06:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143050766] [2025-01-10 00:06:31,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:31,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 00:06:31,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 00:06:31,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:31,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143050766] [2025-01-10 00:06:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143050766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:31,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:31,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:31,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753269779] [2025-01-10 00:06:31,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:31,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:31,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:31,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:31,326 INFO L87 Difference]: Start difference. First operand 494 states and 633 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:31,412 INFO L93 Difference]: Finished difference Result 497 states and 636 transitions. [2025-01-10 00:06:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2025-01-10 00:06:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:31,414 INFO L225 Difference]: With dead ends: 497 [2025-01-10 00:06:31,414 INFO L226 Difference]: Without dead ends: 497 [2025-01-10 00:06:31,414 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-10 00:06:31,415 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 175 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:31,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 187 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-10 00:06:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-01-10 00:06:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 432 states have (on average 1.4490740740740742) internal successors, (626), 490 states have internal predecessors, (626), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 636 transitions. [2025-01-10 00:06:31,424 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 636 transitions. Word has length 114 [2025-01-10 00:06:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:31,424 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 636 transitions. [2025-01-10 00:06:31,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 636 transitions. [2025-01-10 00:06:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-10 00:06:31,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:31,426 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:31,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 00:06:31,426 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:31,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash 898325847, now seen corresponding path program 1 times [2025-01-10 00:06:31,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:31,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414564290] [2025-01-10 00:06:31,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:31,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:31,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 00:06:31,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 00:06:31,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:31,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414564290] [2025-01-10 00:06:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414564290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:32,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636137827] [2025-01-10 00:06:32,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:32,245 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:32,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 00:06:32,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 00:06:32,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 00:06:32,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:32,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:32,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:06:32,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:32,775 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 1 [2025-01-10 00:06:32,786 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-10 00:06:32,815 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 19 treesize of output 11 [2025-01-10 00:06:33,011 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 17 treesize of output 9 [2025-01-10 00:06:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-10 00:06:33,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:33,100 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-01-10 00:06:33,100 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 16 treesize of output 15 [2025-01-10 00:06:33,128 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 22 treesize of output 20 [2025-01-10 00:06:33,130 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 34 treesize of output 32 [2025-01-10 00:06:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-10 00:06:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636137827] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:33,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:33,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 17 [2025-01-10 00:06:33,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821761617] [2025-01-10 00:06:33,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:06:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:33,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:06:33,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-01-10 00:06:33,158 INFO L87 Difference]: Start difference. First operand 497 states and 636 transitions. Second operand has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:33,553 INFO L93 Difference]: Finished difference Result 526 states and 642 transitions. [2025-01-10 00:06:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:06:33,553 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-01-10 00:06:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:33,555 INFO L225 Difference]: With dead ends: 526 [2025-01-10 00:06:33,555 INFO L226 Difference]: Without dead ends: 526 [2025-01-10 00:06:33,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-10 00:06:33,556 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 490 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:33,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1674 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:06:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-10 00:06:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 498. [2025-01-10 00:06:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 433 states have (on average 1.4480369515011546) internal successors, (627), 491 states have internal predecessors, (627), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 637 transitions. [2025-01-10 00:06:33,565 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 637 transitions. Word has length 115 [2025-01-10 00:06:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:33,566 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 637 transitions. [2025-01-10 00:06:33,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.882352941176471) internal successors, (83), 18 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 637 transitions. [2025-01-10 00:06:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-10 00:06:33,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:33,567 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:33,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 00:06:33,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-10 00:06:33,768 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1890358621, now seen corresponding path program 1 times [2025-01-10 00:06:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095965424] [2025-01-10 00:06:33,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:33,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 00:06:33,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 00:06:33,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:33,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095965424] [2025-01-10 00:06:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095965424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:34,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516380695] [2025-01-10 00:06:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:34,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:34,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:34,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:34,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:34,007 INFO L87 Difference]: Start difference. First operand 498 states and 637 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:34,041 INFO L93 Difference]: Finished difference Result 497 states and 636 transitions. [2025-01-10 00:06:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:34,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-01-10 00:06:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:34,044 INFO L225 Difference]: With dead ends: 497 [2025-01-10 00:06:34,044 INFO L226 Difference]: Without dead ends: 497 [2025-01-10 00:06:34,044 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-10 00:06:34,044 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 176 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:34,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 234 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-10 00:06:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-01-10 00:06:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 433 states have (on average 1.4457274826789839) internal successors, (626), 490 states have internal predecessors, (626), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 636 transitions. [2025-01-10 00:06:34,054 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 636 transitions. Word has length 116 [2025-01-10 00:06:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:34,055 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 636 transitions. [2025-01-10 00:06:34,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 636 transitions. [2025-01-10 00:06:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-10 00:06:34,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:34,056 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:34,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 00:06:34,056 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:34,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash 68537240, now seen corresponding path program 1 times [2025-01-10 00:06:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103873412] [2025-01-10 00:06:34,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:34,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 00:06:34,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 00:06:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:34,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103873412] [2025-01-10 00:06:34,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103873412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:34,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:34,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:06:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178082820] [2025-01-10 00:06:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:34,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:06:34,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:34,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:06:34,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:06:34,315 INFO L87 Difference]: Start difference. First operand 497 states and 636 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:34,331 INFO L93 Difference]: Finished difference Result 495 states and 627 transitions. [2025-01-10 00:06:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:06:34,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2025-01-10 00:06:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:34,333 INFO L225 Difference]: With dead ends: 495 [2025-01-10 00:06:34,333 INFO L226 Difference]: Without dead ends: 495 [2025-01-10 00:06:34,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10 00:06:34,333 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:34,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-10 00:06:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-01-10 00:06:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 431 states have (on average 1.431554524361949) internal successors, (617), 488 states have internal predecessors, (617), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 627 transitions. [2025-01-10 00:06:34,342 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 627 transitions. Word has length 116 [2025-01-10 00:06:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:34,342 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 627 transitions. [2025-01-10 00:06:34,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 627 transitions. [2025-01-10 00:06:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-10 00:06:34,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:34,343 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:34,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 00:06:34,343 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:34,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2726234, now seen corresponding path program 1 times [2025-01-10 00:06:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:34,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19053299] [2025-01-10 00:06:34,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:34,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:34,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 00:06:34,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 00:06:34,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:34,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19053299] [2025-01-10 00:06:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19053299] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625278680] [2025-01-10 00:06:34,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:34,662 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:34,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 00:06:35,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 00:06:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 00:06:35,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:35,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:35,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:06:35,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:35,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625278680] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:35,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-10 00:06:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786650474] [2025-01-10 00:06:35,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:35,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:06:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:35,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:06:35,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:06:35,393 INFO L87 Difference]: Start difference. First operand 495 states and 627 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:35,500 INFO L93 Difference]: Finished difference Result 575 states and 688 transitions. [2025-01-10 00:06:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:06:35,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-01-10 00:06:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:35,502 INFO L225 Difference]: With dead ends: 575 [2025-01-10 00:06:35,502 INFO L226 Difference]: Without dead ends: 575 [2025-01-10 00:06:35,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:06:35,503 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 96 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:35,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1600 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-10 00:06:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 496. [2025-01-10 00:06:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 432 states have (on average 1.4305555555555556) internal successors, (618), 489 states have internal predecessors, (618), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 628 transitions. [2025-01-10 00:06:35,511 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 628 transitions. Word has length 117 [2025-01-10 00:06:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:35,511 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 628 transitions. [2025-01-10 00:06:35,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 628 transitions. [2025-01-10 00:06:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-10 00:06:35,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:35,512 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-10 00:06:35,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 00:06:35,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-10 00:06:35,713 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:35,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1528425346, now seen corresponding path program 1 times [2025-01-10 00:06:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491996075] [2025-01-10 00:06:35,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:35,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 00:06:35,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 00:06:35,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:35,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491996075] [2025-01-10 00:06:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491996075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598186044] [2025-01-10 00:06:35,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:35,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:35,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:35,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 00:06:36,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 00:06:36,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 00:06:36,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:36,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:06:36,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:36,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598186044] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:36,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-10 00:06:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994279356] [2025-01-10 00:06:36,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:06:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:36,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:06:36,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:06:36,768 INFO L87 Difference]: Start difference. First operand 496 states and 628 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:36,838 INFO L93 Difference]: Finished difference Result 499 states and 627 transitions. [2025-01-10 00:06:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:06:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2025-01-10 00:06:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:36,840 INFO L225 Difference]: With dead ends: 499 [2025-01-10 00:06:36,840 INFO L226 Difference]: Without dead ends: 499 [2025-01-10 00:06:36,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:06:36,841 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 218 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:36,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1266 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-01-10 00:06:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 493. [2025-01-10 00:06:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 429 states have (on average 1.4242424242424243) internal successors, (611), 486 states have internal predecessors, (611), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 621 transitions. [2025-01-10 00:06:36,848 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 621 transitions. Word has length 117 [2025-01-10 00:06:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:36,849 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 621 transitions. [2025-01-10 00:06:36,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 621 transitions. [2025-01-10 00:06:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-10 00:06:36,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:36,850 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1] [2025-01-10 00:06:36,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 00:06:37,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:37,051 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:37,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1440551670, now seen corresponding path program 1 times [2025-01-10 00:06:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711459691] [2025-01-10 00:06:37,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:37,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 00:06:37,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 00:06:37,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:37,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:37,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711459691] [2025-01-10 00:06:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711459691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016516507] [2025-01-10 00:06:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:37,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:37,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:37,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:37,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:37,261 INFO L87 Difference]: Start difference. First operand 493 states and 621 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:37,346 INFO L93 Difference]: Finished difference Result 492 states and 619 transitions. [2025-01-10 00:06:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-01-10 00:06:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:37,348 INFO L225 Difference]: With dead ends: 492 [2025-01-10 00:06:37,348 INFO L226 Difference]: Without dead ends: 492 [2025-01-10 00:06:37,349 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-10 00:06:37,349 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:37,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-10 00:06:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-01-10 00:06:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 485 states have internal predecessors, (609), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 619 transitions. [2025-01-10 00:06:37,357 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 619 transitions. Word has length 118 [2025-01-10 00:06:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:37,358 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 619 transitions. [2025-01-10 00:06:37,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 619 transitions. [2025-01-10 00:06:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-10 00:06:37,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:37,359 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1] [2025-01-10 00:06:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-10 00:06:37,359 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:37,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1440551671, now seen corresponding path program 1 times [2025-01-10 00:06:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157738154] [2025-01-10 00:06:37,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:37,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 00:06:37,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 00:06:37,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:37,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:37,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157738154] [2025-01-10 00:06:37,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157738154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:37,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32903722] [2025-01-10 00:06:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:37,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:37,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:37,624 INFO L87 Difference]: Start difference. First operand 492 states and 619 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:37,710 INFO L93 Difference]: Finished difference Result 491 states and 617 transitions. [2025-01-10 00:06:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2025-01-10 00:06:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:37,713 INFO L225 Difference]: With dead ends: 491 [2025-01-10 00:06:37,713 INFO L226 Difference]: Without dead ends: 491 [2025-01-10 00:06:37,713 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-10 00:06:37,714 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:37,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-10 00:06:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2025-01-10 00:06:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 429 states have (on average 1.4149184149184149) internal successors, (607), 484 states have internal predecessors, (607), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 617 transitions. [2025-01-10 00:06:37,722 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 617 transitions. Word has length 118 [2025-01-10 00:06:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:37,723 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 617 transitions. [2025-01-10 00:06:37,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 617 transitions. [2025-01-10 00:06:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-10 00:06:37,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:37,724 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1] [2025-01-10 00:06:37,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-10 00:06:37,725 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1674704869, now seen corresponding path program 1 times [2025-01-10 00:06:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911906892] [2025-01-10 00:06:37,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:37,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 00:06:37,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 00:06:37,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:37,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:38,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911906892] [2025-01-10 00:06:38,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911906892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:38,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831602767] [2025-01-10 00:06:38,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:38,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:38,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:38,974 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:38,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 00:06:39,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 00:06:39,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 00:06:39,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:39,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:39,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 00:06:39,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:39,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:06:39,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-01-10 00:06:39,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:06:39,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:06:39,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:06:39,620 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 16 treesize of output 8 [2025-01-10 00:06:39,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:06:39,874 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 16 treesize of output 8 [2025-01-10 00:06:39,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:06:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:39,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:40,127 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 6 treesize of output 4 [2025-01-10 00:06:40,128 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 15 treesize of output 13 [2025-01-10 00:06:40,130 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 20 treesize of output 18 [2025-01-10 00:06:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831602767] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:40,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2025-01-10 00:06:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150981358] [2025-01-10 00:06:40,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:06:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:40,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:06:40,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-01-10 00:06:40,206 INFO L87 Difference]: Start difference. First operand 491 states and 617 transitions. Second operand has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:40,742 INFO L93 Difference]: Finished difference Result 521 states and 630 transitions. [2025-01-10 00:06:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:06:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2025-01-10 00:06:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:40,744 INFO L225 Difference]: With dead ends: 521 [2025-01-10 00:06:40,744 INFO L226 Difference]: Without dead ends: 521 [2025-01-10 00:06:40,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-01-10 00:06:40,745 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 379 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:40,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1810 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 00:06:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-10 00:06:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 494. [2025-01-10 00:06:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 432 states have (on average 1.412037037037037) internal successors, (610), 487 states have internal predecessors, (610), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 620 transitions. [2025-01-10 00:06:40,750 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 620 transitions. Word has length 119 [2025-01-10 00:06:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:40,751 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 620 transitions. [2025-01-10 00:06:40,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 620 transitions. [2025-01-10 00:06:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-10 00:06:40,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:40,751 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1] [2025-01-10 00:06:40,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 00:06:40,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:40,952 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash 160095835, now seen corresponding path program 1 times [2025-01-10 00:06:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179657266] [2025-01-10 00:06:40,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:40,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-10 00:06:41,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-10 00:06:41,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:41,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:41,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:41,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179657266] [2025-01-10 00:06:41,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179657266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:41,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:41,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:06:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032646653] [2025-01-10 00:06:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:41,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:06:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:41,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:06:41,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:06:41,224 INFO L87 Difference]: Start difference. First operand 494 states and 620 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:41,251 INFO L93 Difference]: Finished difference Result 492 states and 612 transitions. [2025-01-10 00:06:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:06:41,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2025-01-10 00:06:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:41,253 INFO L225 Difference]: With dead ends: 492 [2025-01-10 00:06:41,253 INFO L226 Difference]: Without dead ends: 492 [2025-01-10 00:06:41,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10 00:06:41,254 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 2 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:41,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 662 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-10 00:06:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 486. [2025-01-10 00:06:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 424 states have (on average 1.400943396226415) internal successors, (594), 479 states have internal predecessors, (594), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 604 transitions. [2025-01-10 00:06:41,264 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 604 transitions. Word has length 121 [2025-01-10 00:06:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:41,264 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 604 transitions. [2025-01-10 00:06:41,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 604 transitions. [2025-01-10 00:06:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-10 00:06:41,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:41,266 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2025-01-10 00:06:41,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-10 00:06:41,266 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:41,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash -792196120, now seen corresponding path program 1 times [2025-01-10 00:06:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:41,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867081021] [2025-01-10 00:06:41,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:41,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:41,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 00:06:41,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 00:06:41,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:41,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:42,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867081021] [2025-01-10 00:06:42,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867081021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203664667] [2025-01-10 00:06:42,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:42,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:42,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:42,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 00:06:43,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 00:06:43,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 00:06:43,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:43,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:43,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 00:06:43,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:43,564 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-10 00:06:43,605 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:06:43,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:06:43,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:06:43,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10 00:06:44,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-01-10 00:06:44,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-10 00:06:44,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:06:44,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 00:06:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-01-10 00:06:44,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:44,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-01-10 00:06:44,606 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 20 treesize of output 18 [2025-01-10 00:06:44,662 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 6 treesize of output 4 [2025-01-10 00:06:44,767 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:06:44,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:06:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203664667] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:44,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 32 [2025-01-10 00:06:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272237878] [2025-01-10 00:06:44,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 00:06:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:44,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 00:06:44,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 00:06:44,788 INFO L87 Difference]: Start difference. First operand 486 states and 604 transitions. Second operand has 33 states, 32 states have (on average 3.40625) internal successors, (109), 33 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:45,614 INFO L93 Difference]: Finished difference Result 517 states and 617 transitions. [2025-01-10 00:06:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 00:06:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.40625) internal successors, (109), 33 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-01-10 00:06:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:45,616 INFO L225 Difference]: With dead ends: 517 [2025-01-10 00:06:45,616 INFO L226 Difference]: Without dead ends: 517 [2025-01-10 00:06:45,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2025-01-10 00:06:45,617 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 945 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:45,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1590 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:06:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-10 00:06:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 489. [2025-01-10 00:06:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 427 states have (on average 1.3981264637002342) internal successors, (597), 482 states have internal predecessors, (597), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 607 transitions. [2025-01-10 00:06:45,623 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 607 transitions. Word has length 122 [2025-01-10 00:06:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:45,623 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 607 transitions. [2025-01-10 00:06:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.40625) internal successors, (109), 33 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 607 transitions. [2025-01-10 00:06:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-10 00:06:45,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:45,624 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2025-01-10 00:06:45,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 00:06:45,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:45,825 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:45,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 721416188, now seen corresponding path program 1 times [2025-01-10 00:06:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788203747] [2025-01-10 00:06:45,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 00:06:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 00:06:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-10 00:06:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788203747] [2025-01-10 00:06:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788203747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:06:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461938711] [2025-01-10 00:06:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:46,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:06:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:46,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:06:46,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:06:46,098 INFO L87 Difference]: Start difference. First operand 489 states and 607 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:46,177 INFO L93 Difference]: Finished difference Result 507 states and 628 transitions. [2025-01-10 00:06:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:06:46,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-01-10 00:06:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:46,179 INFO L225 Difference]: With dead ends: 507 [2025-01-10 00:06:46,179 INFO L226 Difference]: Without dead ends: 507 [2025-01-10 00:06:46,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:06:46,179 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 15 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:46,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1446 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-10 00:06:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2025-01-10 00:06:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 434 states have (on average 1.3894009216589862) internal successors, (603), 489 states have internal predecessors, (603), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 613 transitions. [2025-01-10 00:06:46,185 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 613 transitions. Word has length 122 [2025-01-10 00:06:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:46,185 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 613 transitions. [2025-01-10 00:06:46,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2025-01-10 00:06:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-10 00:06:46,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:46,186 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:46,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-10 00:06:46,186 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:46,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:46,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1211724511, now seen corresponding path program 1 times [2025-01-10 00:06:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:46,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724473863] [2025-01-10 00:06:46,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:46,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 00:06:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 00:06:46,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:46,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-01-10 00:06:46,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:46,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724473863] [2025-01-10 00:06:46,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724473863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:46,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:46,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789407609] [2025-01-10 00:06:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:46,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:46,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:46,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:46,324 INFO L87 Difference]: Start difference. First operand 496 states and 613 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:46,330 INFO L93 Difference]: Finished difference Result 495 states and 612 transitions. [2025-01-10 00:06:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2025-01-10 00:06:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:46,332 INFO L225 Difference]: With dead ends: 495 [2025-01-10 00:06:46,332 INFO L226 Difference]: Without dead ends: 495 [2025-01-10 00:06:46,332 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-10 00:06:46,332 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 169 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 234 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:06:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-10 00:06:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-01-10 00:06:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 434 states have (on average 1.3870967741935485) internal successors, (602), 488 states have internal predecessors, (602), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:06:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 612 transitions. [2025-01-10 00:06:46,338 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 612 transitions. Word has length 123 [2025-01-10 00:06:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:46,338 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 612 transitions. [2025-01-10 00:06:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:06:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 612 transitions. [2025-01-10 00:06:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-10 00:06:46,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:46,340 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-10 00:06:46,340 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:06:46,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -768191812, now seen corresponding path program 1 times [2025-01-10 00:06:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:46,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730159013] [2025-01-10 00:06:46,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:46,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 00:06:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 00:06:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:46,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730159013] [2025-01-10 00:06:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730159013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:46,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732501752] [2025-01-10 00:06:46,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:46,642 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:06:46,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 00:06:47,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-10 00:06:47,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-10 00:06:47,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:47,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 00:06:47,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:47,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-10 00:06:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732501752] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:47,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-10 00:06:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2742091] [2025-01-10 00:06:47,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:47,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:06:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:47,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:06:47,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:06:47,780 INFO L87 Difference]: Start difference. First operand 495 states and 612 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)