./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:48:37,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:48:37,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:48:37,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:48:37,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:48:38,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:48:38,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:48:38,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:48:38,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:48:38,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:48:38,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:48:38,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:48:38,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:48:38,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:48:38,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:48:38,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:48:38,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:48:38,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:48:38,022 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-01-09 20:48:38,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:48:38,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:48:38,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:48:38,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:48:38,205 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:48:38,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-01-09 20:48:39,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c667260e/950e54b324b74960a949d989cad6ead4/FLAGa512ce008 [2025-01-09 20:48:39,711 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:48:39,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2025-01-09 20:48:39,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c667260e/950e54b324b74960a949d989cad6ead4/FLAGa512ce008 [2025-01-09 20:48:39,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c667260e/950e54b324b74960a949d989cad6ead4 [2025-01-09 20:48:39,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:48:39,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:48:39,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:48:39,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:48:39,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:48:39,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:48:39" (1/1) ... [2025-01-09 20:48:39,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba96874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:39, skipping insertion in model container [2025-01-09 20:48:39,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:48:39" (1/1) ... [2025-01-09 20:48:39,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:48:40,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i[37435,37448] [2025-01-09 20:48:40,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:48:40,374 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:48:40,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i[37435,37448] [2025-01-09 20:48:40,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:48:40,470 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:48:40,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40 WrapperNode [2025-01-09 20:48:40,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:48:40,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:48:40,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:48:40,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:48:40,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,541 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1239 [2025-01-09 20:48:40,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:48:40,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:48:40,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:48:40,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:48:40,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,604 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-09 20:48:40,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:48:40,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:48:40,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:48:40,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:48:40,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (1/1) ... [2025-01-09 20:48:40,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:48:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:40,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:48:40,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:48:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:48:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:48:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:48:40,707 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:48:40,707 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:48:40,707 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:48:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:48:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:48:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:48:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:48:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:48:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:48:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:48:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:48:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:48:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:48:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:48:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:48:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:48:40,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:48:40,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:48:40,872 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:48:40,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:48:41,899 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-01-09 20:48:41,899 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:48:41,909 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:48:41,909 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 20:48:41,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:41 BoogieIcfgContainer [2025-01-09 20:48:41,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:48:41,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:48:41,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:48:41,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:48:41,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:48:39" (1/3) ... [2025-01-09 20:48:41,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731b3f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:48:41, skipping insertion in model container [2025-01-09 20:48:41,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:48:40" (2/3) ... [2025-01-09 20:48:41,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731b3f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:48:41, skipping insertion in model container [2025-01-09 20:48:41,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:48:41" (3/3) ... [2025-01-09 20:48:41,915 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2025-01-09 20:48:41,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:48:41,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test2-1.i that has 4 procedures, 372 locations, 1 initial locations, 33 loop locations, and 1 error locations. [2025-01-09 20:48:41,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:48:41,976 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=LoopHeads, 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;@414b4fcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:48:41,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:48:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 358 states have (on average 1.611731843575419) internal successors, (577), 359 states have internal predecessors, (577), 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-09 20:48:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 20:48:41,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:41,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:41,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:41,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1494204060, now seen corresponding path program 1 times [2025-01-09 20:48:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441414050] [2025-01-09 20:48:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 20:48:42,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 20:48:42,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:42,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:42,082 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-09 20:48:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441414050] [2025-01-09 20:48:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441414050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:42,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:48:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690817017] [2025-01-09 20:48:42,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:42,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:48:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:42,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:48:42,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:48:42,100 INFO L87 Difference]: Start difference. First operand has 364 states, 358 states have (on average 1.611731843575419) internal successors, (577), 359 states have internal predecessors, (577), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-09 20:48:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:42,131 INFO L93 Difference]: Finished difference Result 725 states and 1162 transitions. [2025-01-09 20:48:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:48:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-01-09 20:48:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:42,138 INFO L225 Difference]: With dead ends: 725 [2025-01-09 20:48:42,138 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 20:48:42,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:48:42,142 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:42,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:48:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 20:48:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-09 20:48:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 355 states have (on average 1.4563380281690141) internal successors, (517), 355 states have internal predecessors, (517), 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-09 20:48:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 523 transitions. [2025-01-09 20:48:42,186 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 523 transitions. Word has length 11 [2025-01-09 20:48:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:42,186 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 523 transitions. [2025-01-09 20:48:42,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-09 20:48:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 523 transitions. [2025-01-09 20:48:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:48:42,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:42,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:42,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:48:42,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:42,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash -361622491, now seen corresponding path program 1 times [2025-01-09 20:48:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:42,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026187770] [2025-01-09 20:48:42,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:42,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:48:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:48:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:42,489 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-09 20:48:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026187770] [2025-01-09 20:48:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026187770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:42,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:48:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138943921] [2025-01-09 20:48:42,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:42,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:48:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:42,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:48:42,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:48:42,493 INFO L87 Difference]: Start difference. First operand 360 states and 523 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 20:48:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:42,586 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2025-01-09 20:48:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:48:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-01-09 20:48:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:42,588 INFO L225 Difference]: With dead ends: 475 [2025-01-09 20:48:42,589 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 20:48:42,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:48:42,591 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 30 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:42,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1247 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:48:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 20:48:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-01-09 20:48:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4057507987220448) internal successors, (440), 313 states have internal predecessors, (440), 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-09 20:48:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 446 transitions. [2025-01-09 20:48:42,606 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 446 transitions. Word has length 65 [2025-01-09 20:48:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:42,607 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 446 transitions. [2025-01-09 20:48:42,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 20:48:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 446 transitions. [2025-01-09 20:48:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:48:42,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:42,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:42,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:48:42,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:42,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1542086863, now seen corresponding path program 1 times [2025-01-09 20:48:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:42,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763530986] [2025-01-09 20:48:42,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:42,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:48:42,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:48:42,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:43,070 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-09 20:48:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763530986] [2025-01-09 20:48:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763530986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:43,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:48:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428417805] [2025-01-09 20:48:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:43,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:48:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:43,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:48:43,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:48:43,072 INFO L87 Difference]: Start difference. First operand 318 states and 446 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-09 20:48:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:43,212 INFO L93 Difference]: Finished difference Result 746 states and 1042 transitions. [2025-01-09 20:48:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:48:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-01-09 20:48:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:43,216 INFO L225 Difference]: With dead ends: 746 [2025-01-09 20:48:43,216 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 20:48:43,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-09 20:48:43,217 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 424 mSDsluCounter, 2117 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:43,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 2544 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:48:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 20:48:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 320. [2025-01-09 20:48:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.403174603174603) internal successors, (442), 315 states have internal predecessors, (442), 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-09 20:48:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2025-01-09 20:48:43,241 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 65 [2025-01-09 20:48:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2025-01-09 20:48:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-09 20:48:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2025-01-09 20:48:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:48:43,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:43,244 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:43,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:48:43,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:43,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1310907661, now seen corresponding path program 1 times [2025-01-09 20:48:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:43,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69556027] [2025-01-09 20:48:43,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:43,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:48:43,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:48:43,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:43,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:48:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69556027] [2025-01-09 20:48:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69556027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:43,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:43,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:48:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437847278] [2025-01-09 20:48:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:43,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:48:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:43,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:48:43,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:48:43,510 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-09 20:48:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:43,575 INFO L93 Difference]: Finished difference Result 593 states and 825 transitions. [2025-01-09 20:48:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:48:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 141 [2025-01-09 20:48:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:43,577 INFO L225 Difference]: With dead ends: 593 [2025-01-09 20:48:43,577 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 20:48:43,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:48:43,578 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 30 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:43,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 998 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:48:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 20:48:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 20:48:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 273 states have (on average 1.336996336996337) internal successors, (365), 273 states have internal predecessors, (365), 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-09 20:48:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2025-01-09 20:48:43,587 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 141 [2025-01-09 20:48:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:43,589 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2025-01-09 20:48:43,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-09 20:48:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2025-01-09 20:48:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:48:43,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:43,592 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:48:43,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 962613887, now seen corresponding path program 1 times [2025-01-09 20:48:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082231821] [2025-01-09 20:48:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:43,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:48:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:48:43,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:43,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:48:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082231821] [2025-01-09 20:48:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082231821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:43,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:48:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922797161] [2025-01-09 20:48:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:43,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:48:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:43,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:48:43,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:48:43,736 INFO L87 Difference]: Start difference. First operand 278 states and 371 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-09 20:48:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:43,789 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2025-01-09 20:48:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:48:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2025-01-09 20:48:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:43,791 INFO L225 Difference]: With dead ends: 732 [2025-01-09 20:48:43,794 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 20:48:43,794 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-09 20:48:43,794 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 176 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:43,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 808 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:48:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 20:48:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2025-01-09 20:48:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 452 states have (on average 1.342920353982301) internal successors, (607), 452 states have internal predecessors, (607), 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-09 20:48:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2025-01-09 20:48:43,810 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2025-01-09 20:48:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2025-01-09 20:48:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-09 20:48:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2025-01-09 20:48:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 20:48:43,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:43,812 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:43,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:48:43,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2037782121, now seen corresponding path program 1 times [2025-01-09 20:48:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941929607] [2025-01-09 20:48:43,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:43,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 20:48:43,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 20:48:43,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:43,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941929607] [2025-01-09 20:48:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941929607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:44,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:48:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708704666] [2025-01-09 20:48:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:44,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:48:44,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:44,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:48:44,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:48:44,065 INFO L87 Difference]: Start difference. First operand 457 states and 613 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:44,336 INFO L93 Difference]: Finished difference Result 902 states and 1210 transitions. [2025-01-09 20:48:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:48:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 20:48:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:44,339 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:48:44,339 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 20:48:44,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 20:48:44,340 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 767 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:44,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 983 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 20:48:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 365. [2025-01-09 20:48:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.336111111111111) internal successors, (481), 360 states have internal predecessors, (481), 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-09 20:48:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 487 transitions. [2025-01-09 20:48:44,353 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 487 transitions. Word has length 156 [2025-01-09 20:48:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:44,353 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 487 transitions. [2025-01-09 20:48:44,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 487 transitions. [2025-01-09 20:48:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 20:48:44,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:44,355 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:44,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:48:44,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:44,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1051528602, now seen corresponding path program 1 times [2025-01-09 20:48:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:44,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648470758] [2025-01-09 20:48:44,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:44,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:48:44,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:48:44,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648470758] [2025-01-09 20:48:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648470758] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375791645] [2025-01-09 20:48:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:44,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:44,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:44,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:44,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:48:45,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:48:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:48:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:45,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 20:48:45,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:45,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:48:45,199 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 16 treesize of output 17 [2025-01-09 20:48:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:45,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375791645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:45,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:48:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964993263] [2025-01-09 20:48:45,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:45,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:48:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:45,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:48:45,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:48:45,921 INFO L87 Difference]: Start difference. First operand 365 states and 487 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:47,340 INFO L93 Difference]: Finished difference Result 867 states and 1161 transitions. [2025-01-09 20:48:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:48:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-01-09 20:48:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:47,342 INFO L225 Difference]: With dead ends: 867 [2025-01-09 20:48:47,342 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 20:48:47,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 20:48:47,343 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 460 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:47,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 2448 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 20:48:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 20:48:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 365. [2025-01-09 20:48:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.3333333333333333) internal successors, (480), 360 states have internal predecessors, (480), 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-09 20:48:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2025-01-09 20:48:47,365 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 166 [2025-01-09 20:48:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2025-01-09 20:48:47,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2025-01-09 20:48:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 20:48:47,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:47,368 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:47,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:48:47,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:47,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1234480493, now seen corresponding path program 1 times [2025-01-09 20:48:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:47,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95858178] [2025-01-09 20:48:47,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:47,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:48:47,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:48:47,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:47,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:47,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:47,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95858178] [2025-01-09 20:48:47,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95858178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:47,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423612115] [2025-01-09 20:48:47,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:47,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:47,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:47,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:47,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:48:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:48:48,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:48:48,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:48,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:48,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 20:48:48,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:48,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423612115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:48:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331517902] [2025-01-09 20:48:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:48,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:48:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:48,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:48:48,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:48:48,279 INFO L87 Difference]: Start difference. First operand 365 states and 486 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:48,377 INFO L93 Difference]: Finished difference Result 685 states and 921 transitions. [2025-01-09 20:48:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:48:48,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-01-09 20:48:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:48,379 INFO L225 Difference]: With dead ends: 685 [2025-01-09 20:48:48,379 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 20:48:48,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:48:48,380 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 17 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:48,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 910 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:48:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 20:48:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-01-09 20:48:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.3277777777777777) internal successors, (478), 360 states have internal predecessors, (478), 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-09 20:48:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 484 transitions. [2025-01-09 20:48:48,390 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 484 transitions. Word has length 167 [2025-01-09 20:48:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:48,390 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 484 transitions. [2025-01-09 20:48:48,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 484 transitions. [2025-01-09 20:48:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:48:48,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:48,391 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:48,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:48:48,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:48,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash -448499841, now seen corresponding path program 1 times [2025-01-09 20:48:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:48,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946720379] [2025-01-09 20:48:48,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:48,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:48:48,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:48:48,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:48,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946720379] [2025-01-09 20:48:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946720379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:48:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166261146] [2025-01-09 20:48:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:48:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:48,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:48:48,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:48:48,912 INFO L87 Difference]: Start difference. First operand 365 states and 484 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:49,079 INFO L93 Difference]: Finished difference Result 688 states and 923 transitions. [2025-01-09 20:48:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:48:49,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-01-09 20:48:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:49,081 INFO L225 Difference]: With dead ends: 688 [2025-01-09 20:48:49,081 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 20:48:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:48:49,082 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 8 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:49,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1180 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 20:48:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-01-09 20:48:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.3224043715846994) internal successors, (484), 366 states have internal predecessors, (484), 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-09 20:48:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 490 transitions. [2025-01-09 20:48:49,091 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 490 transitions. Word has length 168 [2025-01-09 20:48:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:49,092 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 490 transitions. [2025-01-09 20:48:49,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 490 transitions. [2025-01-09 20:48:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:48:49,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:49,093 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:49,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:48:49,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2038650182, now seen corresponding path program 1 times [2025-01-09 20:48:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:49,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825779168] [2025-01-09 20:48:49,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:49,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:48:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:48:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825779168] [2025-01-09 20:48:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825779168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:49,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:48:49,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912331628] [2025-01-09 20:48:49,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:49,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:48:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:49,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:48:49,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:48:49,352 INFO L87 Difference]: Start difference. First operand 371 states and 490 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:49,583 INFO L93 Difference]: Finished difference Result 694 states and 927 transitions. [2025-01-09 20:48:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:48:49,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-01-09 20:48:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:49,585 INFO L225 Difference]: With dead ends: 694 [2025-01-09 20:48:49,585 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 20:48:49,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:48:49,585 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 12 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:49,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1691 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 20:48:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2025-01-09 20:48:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 374 states have (on average 1.320855614973262) internal successors, (494), 374 states have internal predecessors, (494), 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-09 20:48:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 500 transitions. [2025-01-09 20:48:49,595 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 500 transitions. Word has length 169 [2025-01-09 20:48:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 500 transitions. [2025-01-09 20:48:49,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 500 transitions. [2025-01-09 20:48:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:48:49,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:49,596 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:48:49,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:49,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1624755030, now seen corresponding path program 1 times [2025-01-09 20:48:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678475018] [2025-01-09 20:48:49,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:48:49,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:48:49,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:49,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:49,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678475018] [2025-01-09 20:48:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678475018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815693070] [2025-01-09 20:48:49,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:49,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:49,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:49,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:48:50,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:48:50,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:48:50,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:50,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:50,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 20:48:50,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:50,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:48:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:48:50,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815693070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 20:48:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343135524] [2025-01-09 20:48:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:50,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:48:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:50,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:48:50,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:48:50,687 INFO L87 Difference]: Start difference. First operand 379 states and 500 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:51,343 INFO L93 Difference]: Finished difference Result 676 states and 893 transitions. [2025-01-09 20:48:51,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:48:51,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-01-09 20:48:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:51,346 INFO L225 Difference]: With dead ends: 676 [2025-01-09 20:48:51,346 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 20:48:51,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:48:51,347 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 354 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:51,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2046 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:48:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 20:48:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 415. [2025-01-09 20:48:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.302439024390244) internal successors, (534), 410 states have internal predecessors, (534), 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-09 20:48:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 540 transitions. [2025-01-09 20:48:51,359 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 540 transitions. Word has length 169 [2025-01-09 20:48:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:51,359 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 540 transitions. [2025-01-09 20:48:51,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 540 transitions. [2025-01-09 20:48:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 20:48:51,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:51,361 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:51,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 20:48:51,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:51,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1576021524, now seen corresponding path program 1 times [2025-01-09 20:48:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536225095] [2025-01-09 20:48:51,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:51,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:48:51,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:48:51,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:51,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:51,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536225095] [2025-01-09 20:48:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536225095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:51,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631826677] [2025-01-09 20:48:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:51,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:51,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:48:52,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:48:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:48:52,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:52,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:52,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 20:48:52,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:48:52,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631826677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:52,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:52,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-01-09 20:48:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368884894] [2025-01-09 20:48:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:48:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:52,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:48:52,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:48:52,256 INFO L87 Difference]: Start difference. First operand 415 states and 540 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:52,433 INFO L93 Difference]: Finished difference Result 530 states and 694 transitions. [2025-01-09 20:48:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:48:52,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-01-09 20:48:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:52,435 INFO L225 Difference]: With dead ends: 530 [2025-01-09 20:48:52,435 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 20:48:52,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:48:52,436 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 34 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1424 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-09 20:48:52,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1424 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 20:48:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-09 20:48:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.3) internal successors, (533), 410 states have internal predecessors, (533), 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-09 20:48:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 539 transitions. [2025-01-09 20:48:52,450 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 539 transitions. Word has length 170 [2025-01-09 20:48:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:52,450 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 539 transitions. [2025-01-09 20:48:52,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 539 transitions. [2025-01-09 20:48:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 20:48:52,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:52,452 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:52,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:48:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 20:48:52,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:52,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1216751759, now seen corresponding path program 1 times [2025-01-09 20:48:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013912327] [2025-01-09 20:48:52,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:52,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 20:48:52,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 20:48:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:52,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:48:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013912327] [2025-01-09 20:48:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013912327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:48:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494589681] [2025-01-09 20:48:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:52,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:48:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:52,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:48:52,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:48:52,903 INFO L87 Difference]: Start difference. First operand 415 states and 539 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:53,060 INFO L93 Difference]: Finished difference Result 533 states and 697 transitions. [2025-01-09 20:48:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:48:53,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-01-09 20:48:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:53,063 INFO L225 Difference]: With dead ends: 533 [2025-01-09 20:48:53,063 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 20:48:53,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:48:53,064 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 8 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:53,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1176 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:48:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 20:48:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-09 20:48:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 1.297820823244552) internal successors, (536), 413 states have internal predecessors, (536), 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-09 20:48:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 542 transitions. [2025-01-09 20:48:53,078 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 542 transitions. Word has length 171 [2025-01-09 20:48:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:53,078 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 542 transitions. [2025-01-09 20:48:53,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 542 transitions. [2025-01-09 20:48:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:48:53,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:53,079 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:53,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:48:53,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:53,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -48456851, now seen corresponding path program 1 times [2025-01-09 20:48:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989429198] [2025-01-09 20:48:53,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:53,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:48:53,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:48:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:48:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989429198] [2025-01-09 20:48:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989429198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:48:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676779602] [2025-01-09 20:48:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:53,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:48:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:53,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:48:53,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:48:53,323 INFO L87 Difference]: Start difference. First operand 418 states and 542 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:53,545 INFO L93 Difference]: Finished difference Result 541 states and 706 transitions. [2025-01-09 20:48:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:48:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-01-09 20:48:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:53,548 INFO L225 Difference]: With dead ends: 541 [2025-01-09 20:48:53,548 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 20:48:53,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:48:53,549 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 12 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:53,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1685 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 20:48:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 422. [2025-01-09 20:48:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.2973621103117505) internal successors, (541), 417 states have internal predecessors, (541), 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-09 20:48:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 547 transitions. [2025-01-09 20:48:53,561 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 547 transitions. Word has length 172 [2025-01-09 20:48:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 547 transitions. [2025-01-09 20:48:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 547 transitions. [2025-01-09 20:48:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:48:53,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:53,563 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:48:53,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1803604911, now seen corresponding path program 1 times [2025-01-09 20:48:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897768409] [2025-01-09 20:48:53,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:53,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:48:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:48:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897768409] [2025-01-09 20:48:53,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897768409] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724435667] [2025-01-09 20:48:53,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:53,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:53,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:53,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:48:54,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:48:54,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:48:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:54,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 20:48:54,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:54,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724435667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:54,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:48:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394132806] [2025-01-09 20:48:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:48:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:54,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:48:54,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:54,388 INFO L87 Difference]: Start difference. First operand 422 states and 547 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:55,733 INFO L93 Difference]: Finished difference Result 792 states and 1036 transitions. [2025-01-09 20:48:55,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:48:55,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-01-09 20:48:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:55,735 INFO L225 Difference]: With dead ends: 792 [2025-01-09 20:48:55,735 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 20:48:55,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:55,735 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 12 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:55,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1674 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 20:48:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 20:48:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 428. [2025-01-09 20:48:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.293144208037825) internal successors, (547), 423 states have internal predecessors, (547), 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-09 20:48:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 553 transitions. [2025-01-09 20:48:55,766 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 553 transitions. Word has length 172 [2025-01-09 20:48:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:55,767 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 553 transitions. [2025-01-09 20:48:55,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 553 transitions. [2025-01-09 20:48:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 20:48:55,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:55,768 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:55,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 20:48:55,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 20:48:55,973 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:55,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:55,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1650673604, now seen corresponding path program 1 times [2025-01-09 20:48:55,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:55,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699917468] [2025-01-09 20:48:55,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:56,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 20:48:56,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 20:48:56,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:56,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699917468] [2025-01-09 20:48:56,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699917468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:56,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:56,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:48:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816247397] [2025-01-09 20:48:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:56,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:48:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:56,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:48:56,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:56,228 INFO L87 Difference]: Start difference. First operand 428 states and 553 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:56,441 INFO L93 Difference]: Finished difference Result 806 states and 1049 transitions. [2025-01-09 20:48:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:48:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-01-09 20:48:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:56,443 INFO L225 Difference]: With dead ends: 806 [2025-01-09 20:48:56,443 INFO L226 Difference]: Without dead ends: 448 [2025-01-09 20:48:56,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:56,445 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 20 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:56,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1788 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-09 20:48:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 442. [2025-01-09 20:48:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 437 states have (on average 1.2929061784897025) internal successors, (565), 437 states have internal predecessors, (565), 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-09 20:48:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 571 transitions. [2025-01-09 20:48:56,456 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 571 transitions. Word has length 173 [2025-01-09 20:48:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:56,456 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 571 transitions. [2025-01-09 20:48:56,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 571 transitions. [2025-01-09 20:48:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:48:56,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:56,458 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:56,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:48:56,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:56,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1109769887, now seen corresponding path program 1 times [2025-01-09 20:48:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:56,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004051209] [2025-01-09 20:48:56,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:56,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:48:56,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:48:56,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:56,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:56,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004051209] [2025-01-09 20:48:56,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004051209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:56,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:56,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:48:56,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968488101] [2025-01-09 20:48:56,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:56,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:48:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:56,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:48:56,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:48:56,773 INFO L87 Difference]: Start difference. First operand 442 states and 571 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:57,119 INFO L93 Difference]: Finished difference Result 830 states and 1082 transitions. [2025-01-09 20:48:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:48:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-01-09 20:48:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:57,121 INFO L225 Difference]: With dead ends: 830 [2025-01-09 20:48:57,121 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 20:48:57,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:48:57,122 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 26 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:57,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2285 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:48:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 20:48:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 448. [2025-01-09 20:48:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 443 states have (on average 1.2889390519187358) internal successors, (571), 443 states have internal predecessors, (571), 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-09 20:48:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 577 transitions. [2025-01-09 20:48:57,138 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 577 transitions. Word has length 174 [2025-01-09 20:48:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 577 transitions. [2025-01-09 20:48:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 577 transitions. [2025-01-09 20:48:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:48:57,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:57,140 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:48:57,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 499919557, now seen corresponding path program 1 times [2025-01-09 20:48:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116972094] [2025-01-09 20:48:57,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:57,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:48:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:48:57,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:57,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116972094] [2025-01-09 20:48:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116972094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916203619] [2025-01-09 20:48:57,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:57,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:57,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 20:48:57,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:48:57,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:48:57,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:57,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:57,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:48:57,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:48:57,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916203619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:48:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850003481] [2025-01-09 20:48:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:57,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:48:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:57,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:48:57,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:57,799 INFO L87 Difference]: Start difference. First operand 448 states and 577 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:58,008 INFO L93 Difference]: Finished difference Result 830 states and 1077 transitions. [2025-01-09 20:48:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:48:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-01-09 20:48:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:58,010 INFO L225 Difference]: With dead ends: 830 [2025-01-09 20:48:58,010 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 20:48:58,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:48:58,011 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 39 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:58,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1704 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 20:48:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 452. [2025-01-09 20:48:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.2863534675615214) internal successors, (575), 447 states have internal predecessors, (575), 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-09 20:48:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 581 transitions. [2025-01-09 20:48:58,022 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 581 transitions. Word has length 174 [2025-01-09 20:48:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:58,022 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 581 transitions. [2025-01-09 20:48:58,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 581 transitions. [2025-01-09 20:48:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:48:58,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:58,023 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:58,031 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-09 20:48:58,224 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,SelfDestructingSolverStorable17 [2025-01-09 20:48:58,224 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:58,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1963102348, now seen corresponding path program 1 times [2025-01-09 20:48:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555214480] [2025-01-09 20:48:58,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:58,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:48:58,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:48:58,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:48:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555214480] [2025-01-09 20:48:58,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555214480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:48:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887384243] [2025-01-09 20:48:58,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:58,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:58,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:48:58,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:48:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 20:48:58,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:48:58,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:48:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:58,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:48:58,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:48:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:48:58,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:48:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887384243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:58,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:48:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:48:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35072023] [2025-01-09 20:48:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:58,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:48:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:58,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:48:58,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:58,966 INFO L87 Difference]: Start difference. First operand 452 states and 581 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:59,198 INFO L93 Difference]: Finished difference Result 579 states and 750 transitions. [2025-01-09 20:48:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:48:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-01-09 20:48:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:59,200 INFO L225 Difference]: With dead ends: 579 [2025-01-09 20:48:59,200 INFO L226 Difference]: Without dead ends: 457 [2025-01-09 20:48:59,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:59,200 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 12 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:59,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1692 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-09 20:48:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2025-01-09 20:48:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.2863534675615214) internal successors, (575), 447 states have internal predecessors, (575), 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-09 20:48:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 581 transitions. [2025-01-09 20:48:59,210 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 581 transitions. Word has length 174 [2025-01-09 20:48:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:59,211 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 581 transitions. [2025-01-09 20:48:59,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 581 transitions. [2025-01-09 20:48:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 20:48:59,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:59,212 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:59,221 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-09 20:48:59,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:48:59,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:59,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2121721130, now seen corresponding path program 1 times [2025-01-09 20:48:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813643651] [2025-01-09 20:48:59,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:59,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:48:59,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:48:59,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:48:59,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:48:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:48:59,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:48:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813643651] [2025-01-09 20:48:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813643651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:48:59,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:48:59,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:48:59,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278695997] [2025-01-09 20:48:59,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:48:59,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:48:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:48:59,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:48:59,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:59,669 INFO L87 Difference]: Start difference. First operand 452 states and 581 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:48:59,889 INFO L93 Difference]: Finished difference Result 584 states and 756 transitions. [2025-01-09 20:48:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:48:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-01-09 20:48:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:48:59,892 INFO L225 Difference]: With dead ends: 584 [2025-01-09 20:48:59,892 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 20:48:59,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:48:59,892 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 20 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:48:59,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2036 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:48:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 20:48:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2025-01-09 20:48:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 454 states have (on average 1.2863436123348018) internal successors, (584), 454 states have internal predecessors, (584), 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-09 20:48:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 590 transitions. [2025-01-09 20:48:59,907 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 590 transitions. Word has length 175 [2025-01-09 20:48:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:48:59,907 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 590 transitions. [2025-01-09 20:48:59,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:48:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 590 transitions. [2025-01-09 20:48:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 20:48:59,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:48:59,909 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:48:59,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:48:59,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:48:59,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:48:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -748261178, now seen corresponding path program 1 times [2025-01-09 20:48:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:48:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704396454] [2025-01-09 20:48:59,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:48:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:48:59,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:49:00,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:49:00,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:49:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:49:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704396454] [2025-01-09 20:49:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704396454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:49:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618675495] [2025-01-09 20:49:00,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:00,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:00,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:49:00,099 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:49:00,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 20:49:00,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:49:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:49:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:00,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 20:49:00,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:49:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:49:00,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:49:00,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618675495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:49:00,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:49:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:49:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618532139] [2025-01-09 20:49:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:49:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:49:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:49:00,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:49:00,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:49:00,563 INFO L87 Difference]: Start difference. First operand 459 states and 590 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:49:00,768 INFO L93 Difference]: Finished difference Result 593 states and 768 transitions. [2025-01-09 20:49:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:49:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-01-09 20:49:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:49:00,772 INFO L225 Difference]: With dead ends: 593 [2025-01-09 20:49:00,772 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 20:49:00,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:49:00,773 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 17 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:49:00,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1699 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:49:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 20:49:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2025-01-09 20:49:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.2850877192982457) internal successors, (586), 456 states have internal predecessors, (586), 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-09 20:49:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 592 transitions. [2025-01-09 20:49:00,791 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 592 transitions. Word has length 175 [2025-01-09 20:49:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:49:00,791 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 592 transitions. [2025-01-09 20:49:00,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 592 transitions. [2025-01-09 20:49:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:49:00,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:49:00,793 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:49:00,804 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-09 20:49:00,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:00,994 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:49:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:49:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1887449092, now seen corresponding path program 1 times [2025-01-09 20:49:00,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:49:00,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346712417] [2025-01-09 20:49:00,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:49:01,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:49:01,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:49:01,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:01,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:49:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:49:01,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346712417] [2025-01-09 20:49:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346712417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:49:01,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:49:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:49:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076005361] [2025-01-09 20:49:01,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:49:01,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:49:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:49:01,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:49:01,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:49:01,383 INFO L87 Difference]: Start difference. First operand 461 states and 592 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:49:01,705 INFO L93 Difference]: Finished difference Result 601 states and 778 transitions. [2025-01-09 20:49:01,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:49:01,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-01-09 20:49:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:49:01,710 INFO L225 Difference]: With dead ends: 601 [2025-01-09 20:49:01,710 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 20:49:01,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:49:01,712 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 26 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:49:01,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2285 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:49:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 20:49:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 464. [2025-01-09 20:49:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 459 states have (on average 1.2832244008714597) internal successors, (589), 459 states have internal predecessors, (589), 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-09 20:49:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2025-01-09 20:49:01,723 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 176 [2025-01-09 20:49:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:49:01,723 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2025-01-09 20:49:01,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2025-01-09 20:49:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:49:01,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:49:01,725 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:49:01,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:49:01,725 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:49:01,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:49:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -662587424, now seen corresponding path program 1 times [2025-01-09 20:49:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:49:01,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321039376] [2025-01-09 20:49:01,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:49:01,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:49:01,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:49:01,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:01,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:49:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:49:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321039376] [2025-01-09 20:49:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321039376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:49:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315737699] [2025-01-09 20:49:01,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:01,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:49:01,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:49:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 20:49:02,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:49:02,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:49:02,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:02,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:02,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 20:49:02,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:49:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:49:02,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:49:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315737699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:49:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:49:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:49:02,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596662445] [2025-01-09 20:49:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:49:02,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:49:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:49:02,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:49:02,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:49:02,514 INFO L87 Difference]: Start difference. First operand 464 states and 595 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:49:02,891 INFO L93 Difference]: Finished difference Result 861 states and 1115 transitions. [2025-01-09 20:49:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:49:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-01-09 20:49:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:49:02,893 INFO L225 Difference]: With dead ends: 861 [2025-01-09 20:49:02,893 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 20:49:02,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:49:02,894 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 10 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:49:02,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1692 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:49:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 20:49:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 464. [2025-01-09 20:49:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 459 states have (on average 1.2832244008714597) internal successors, (589), 459 states have internal predecessors, (589), 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-09 20:49:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2025-01-09 20:49:02,902 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 176 [2025-01-09 20:49:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:49:02,903 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2025-01-09 20:49:02,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2025-01-09 20:49:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:49:02,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:49:02,904 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:49:02,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 20:49:03,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:03,105 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:49:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:49:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 600471085, now seen corresponding path program 1 times [2025-01-09 20:49:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:49:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712439107] [2025-01-09 20:49:03,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:49:03,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:49:03,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:49:03,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:03,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:49:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:49:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712439107] [2025-01-09 20:49:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712439107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:49:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428892868] [2025-01-09 20:49:03,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:49:03,309 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:49:03,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 20:49:03,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:49:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:49:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:03,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 20:49:03,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:49:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:49:05,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:49:05,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428892868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:49:05,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:49:05,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-09 20:49:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900588496] [2025-01-09 20:49:05,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:49:05,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:49:05,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:49:05,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:49:05,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:49:05,924 INFO L87 Difference]: Start difference. First operand 464 states and 595 transitions. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:09,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:49:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:49:10,041 INFO L93 Difference]: Finished difference Result 618 states and 799 transitions. [2025-01-09 20:49:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 20:49:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 177 [2025-01-09 20:49:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:49:10,043 INFO L225 Difference]: With dead ends: 618 [2025-01-09 20:49:10,043 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 20:49:10,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:49:10,044 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 22 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:49:10,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2808 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 20:49:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 20:49:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 477. [2025-01-09 20:49:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.2838983050847457) internal successors, (606), 472 states have internal predecessors, (606), 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-09 20:49:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 612 transitions. [2025-01-09 20:49:10,053 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 612 transitions. Word has length 177 [2025-01-09 20:49:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:49:10,053 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 612 transitions. [2025-01-09 20:49:10,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:49:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 612 transitions. [2025-01-09 20:49:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:49:10,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:49:10,055 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:49:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 20:49:10,255 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,SelfDestructingSolverStorable23 [2025-01-09 20:49:10,256 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:49:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:49:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 469172916, now seen corresponding path program 1 times [2025-01-09 20:49:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:49:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426949988] [2025-01-09 20:49:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:49:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:49:10,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:49:10,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:10,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:49:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:49:10,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426949988] [2025-01-09 20:49:10,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426949988] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:49:10,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590587334] [2025-01-09 20:49:10,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:10,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:49:10,590 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:49:10,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 20:49:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:49:11,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:49:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:11,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 20:49:11,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:49:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:49:11,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:49:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590587334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:49:11,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:49:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 20:49:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889383847] [2025-01-09 20:49:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:49:11,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:49:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:49:11,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:49:11,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:49:11,054 INFO L87 Difference]: Start difference. First operand 477 states and 612 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 20:49:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:49:11,076 INFO L93 Difference]: Finished difference Result 840 states and 1080 transitions. [2025-01-09 20:49:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:49:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 177 [2025-01-09 20:49:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:49:11,086 INFO L225 Difference]: With dead ends: 840 [2025-01-09 20:49:11,086 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 20:49:11,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:49:11,087 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:49:11,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1049 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:49:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 20:49:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-01-09 20:49:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 474 states have (on average 1.2848101265822784) internal successors, (609), 475 states have internal predecessors, (609), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 20:49:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 616 transitions. [2025-01-09 20:49:11,105 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 616 transitions. Word has length 177 [2025-01-09 20:49:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:49:11,105 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 616 transitions. [2025-01-09 20:49:11,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 20:49:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 616 transitions. [2025-01-09 20:49:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 20:49:11,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:49:11,107 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:49:11,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 20:49:11,308 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,SelfDestructingSolverStorable24 [2025-01-09 20:49:11,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:49:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:49:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1427036562, now seen corresponding path program 1 times [2025-01-09 20:49:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:49:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696224064] [2025-01-09 20:49:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:49:11,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 20:49:11,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 20:49:11,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:11,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:49:11,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:49:11,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696224064] [2025-01-09 20:49:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696224064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:49:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365924145] [2025-01-09 20:49:11,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:49:11,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:49:11,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:49:11,658 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-09 20:49:11,662 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-09 20:49:11,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 20:49:12,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 20:49:12,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:49:12,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:49:12,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-01-09 20:49:12,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:49:12,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:49:12,256 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-09 20:49:12,285 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 14 treesize of output 15 [2025-01-09 20:49:12,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:49:12,686 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-09 20:49:12,700 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-09 20:49:12,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-01-09 20:49:12,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:49:12,757 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 18 treesize of output 10 [2025-01-09 20:49:12,760 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 7 treesize of output 3 [2025-01-09 20:49:12,896 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 20:49:12,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 20:49:12,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11