./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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_SAX_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:52:47,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:52:47,791 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:52:47,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:52:47,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:52:47,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:52:47,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:52:47,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:52:47,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:52:47,820 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:52:47,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:52:47,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:52:47,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:52:47,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:52:47,821 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:52:47,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:52:47,822 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:52:47,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:52:47,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:52:47,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:52:47,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:52:47,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:52:47,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:52:47,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:52:47,825 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:52:48,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:52:48,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:52:48,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:52:48,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:52:48,054 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:52:48,055 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_SAX_nondet_test2-1.i [2025-01-09 20:52:49,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aec3bfdd/817a0da777f0412a98bf5797e6180dc5/FLAG84c626e98 [2025-01-09 20:52:49,418 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:52:49,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-01-09 20:52:49,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aec3bfdd/817a0da777f0412a98bf5797e6180dc5/FLAG84c626e98 [2025-01-09 20:52:49,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aec3bfdd/817a0da777f0412a98bf5797e6180dc5 [2025-01-09 20:52:49,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:52:49,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:52:49,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:52:49,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:52:49,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:52:49,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:52:49" (1/1) ... [2025-01-09 20:52:49,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4c42be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:49, skipping insertion in model container [2025-01-09 20:52:49,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:52:49" (1/1) ... [2025-01-09 20:52:49,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:52:50,011 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_SAX_nondet_test2-1.i[37435,37448] [2025-01-09 20:52:50,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:52:50,109 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:52:50,137 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_SAX_nondet_test2-1.i[37435,37448] [2025-01-09 20:52:50,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:52:50,214 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:52:50,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50 WrapperNode [2025-01-09 20:52:50,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:52:50,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:52:50,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:52:50,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:52:50,222 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:52:50" (1/1) ... [2025-01-09 20:52:50,243 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:52:50" (1/1) ... [2025-01-09 20:52:50,283 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1239 [2025-01-09 20:52:50,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:52:50,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:52:50,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:52:50,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:52:50,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,342 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 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, 42, 4]. [2025-01-09 20:52:50,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:52:50,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:52:50,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:52:50,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:52:50,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (1/1) ... [2025-01-09 20:52:50,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:52:50,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:52:50,445 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:52:50,450 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:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:52:50,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:52:50,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:52:50,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:52:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:52:50,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:52:50,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:52:50,594 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:52:50,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:52:51,586 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-01-09 20:52:51,587 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:52:51,606 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:52:51,608 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 20:52:51,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:52:51 BoogieIcfgContainer [2025-01-09 20:52:51,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:52:51,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:52:51,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:52:51,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:52:51,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:52:49" (1/3) ... [2025-01-09 20:52:51,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467cd0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:52:51, skipping insertion in model container [2025-01-09 20:52:51,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:52:50" (2/3) ... [2025-01-09 20:52:51,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467cd0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:52:51, skipping insertion in model container [2025-01-09 20:52:51,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:52:51" (3/3) ... [2025-01-09 20:52:51,614 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2025-01-09 20:52:51,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:52:51,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 372 locations, 1 initial locations, 33 loop locations, and 1 error locations. [2025-01-09 20:52:51,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:52:51,677 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;@45775d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:52:51,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:52:51,684 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:52:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 20:52:51,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:51,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:52:51,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1494204060, now seen corresponding path program 1 times [2025-01-09 20:52:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320652329] [2025-01-09 20:52:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:51,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 20:52:51,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 20:52:51,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:51,809 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:52:51,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320652329] [2025-01-09 20:52:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320652329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:52:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068581485] [2025-01-09 20:52:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:52:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:52:51,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:52:51,828 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:52:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:51,871 INFO L93 Difference]: Finished difference Result 725 states and 1162 transitions. [2025-01-09 20:52:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:52:51,875 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:52:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:51,882 INFO L225 Difference]: With dead ends: 725 [2025-01-09 20:52:51,883 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 20:52:51,887 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:52:51,891 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:52:51,893 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:52:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 20:52:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-09 20:52:51,937 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:52:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 523 transitions. [2025-01-09 20:52:51,945 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 523 transitions. Word has length 11 [2025-01-09 20:52:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:51,945 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 523 transitions. [2025-01-09 20:52:51,945 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:52:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 523 transitions. [2025-01-09 20:52:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:52:51,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:51,949 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:52:51,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:52:51,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:51,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -361622491, now seen corresponding path program 1 times [2025-01-09 20:52:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957270706] [2025-01-09 20:52:51,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:51,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:51,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:52:52,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:52:52,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:52,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:52,253 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:52:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957270706] [2025-01-09 20:52:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957270706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:52,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:52,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:52:52,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483615307] [2025-01-09 20:52:52,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:52,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:52:52,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:52,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:52:52,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:52:52,256 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:52:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:52,354 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2025-01-09 20:52:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:52:52,355 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:52:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:52,358 INFO L225 Difference]: With dead ends: 475 [2025-01-09 20:52:52,359 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 20:52:52,360 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:52:52,360 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 30 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:52:52,362 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:52:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 20:52:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-01-09 20:52:52,379 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:52:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 446 transitions. [2025-01-09 20:52:52,380 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 446 transitions. Word has length 65 [2025-01-09 20:52:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:52,382 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 446 transitions. [2025-01-09 20:52:52,382 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:52:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 446 transitions. [2025-01-09 20:52:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:52:52,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:52,384 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:52:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:52:52,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:52,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1542086863, now seen corresponding path program 1 times [2025-01-09 20:52:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398762137] [2025-01-09 20:52:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:52,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:52:52,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:52:52,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:52,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:52,880 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:52:52,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:52,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398762137] [2025-01-09 20:52:52,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398762137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:52,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:52,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:52:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926827179] [2025-01-09 20:52:52,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:52,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:52:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:52,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:52:52,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:52:52,882 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:52:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:53,020 INFO L93 Difference]: Finished difference Result 746 states and 1042 transitions. [2025-01-09 20:52:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:52:53,021 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:52:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:53,023 INFO L225 Difference]: With dead ends: 746 [2025-01-09 20:52:53,023 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 20:52:53,024 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:52:53,024 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:52:53,024 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:52:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 20:52:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 320. [2025-01-09 20:52:53,045 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:52:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2025-01-09 20:52:53,048 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 65 [2025-01-09 20:52:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2025-01-09 20:52:53,049 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:52:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2025-01-09 20:52:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:52:53,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:53,056 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:52:53,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:52:53,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:53,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1310907661, now seen corresponding path program 1 times [2025-01-09 20:52:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730100003] [2025-01-09 20:52:53,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:53,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:52:53,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:52:53,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:53,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:53,317 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:52:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730100003] [2025-01-09 20:52:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730100003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:53,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:52:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163311423] [2025-01-09 20:52:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:53,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:52:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:52:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:52:53,321 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:52:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:53,397 INFO L93 Difference]: Finished difference Result 593 states and 825 transitions. [2025-01-09 20:52:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:52:53,398 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:52:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:53,400 INFO L225 Difference]: With dead ends: 593 [2025-01-09 20:52:53,401 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 20:52:53,402 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:52:53,402 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:52:53,403 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.1s Time] [2025-01-09 20:52:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 20:52:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 20:52:53,410 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:52:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2025-01-09 20:52:53,412 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 141 [2025-01-09 20:52:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:53,412 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2025-01-09 20:52:53,412 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:52:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2025-01-09 20:52:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:52:53,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:53,413 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:52:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:52:53,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:53,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 962613887, now seen corresponding path program 1 times [2025-01-09 20:52:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59583935] [2025-01-09 20:52:53,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:53,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:52:53,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:52:53,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:53,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:53,563 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:52:53,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59583935] [2025-01-09 20:52:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59583935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:52:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468388971] [2025-01-09 20:52:53,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:52:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:52:53,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:52:53,566 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:52:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:53,630 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2025-01-09 20:52:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:52:53,630 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:52:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:53,632 INFO L225 Difference]: With dead ends: 732 [2025-01-09 20:52:53,635 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 20:52:53,636 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:52:53,636 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:52:53,636 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.1s Time] [2025-01-09 20:52:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 20:52:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2025-01-09 20:52:53,651 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:52:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2025-01-09 20:52:53,656 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2025-01-09 20:52:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:53,657 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2025-01-09 20:52:53,657 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:52:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2025-01-09 20:52:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 20:52:53,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:53,658 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:52:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:52:53,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:53,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1862797417, now seen corresponding path program 1 times [2025-01-09 20:52:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782411217] [2025-01-09 20:52:53,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:53,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 20:52:53,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 20:52:53,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:53,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:53,899 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:52:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782411217] [2025-01-09 20:52:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782411217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:52:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:52:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648290541] [2025-01-09 20:52:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:53,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:52:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:53,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:52:53,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:52:53,902 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:52:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:54,219 INFO L93 Difference]: Finished difference Result 902 states and 1210 transitions. [2025-01-09 20:52:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:52:54,219 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:52:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:54,222 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:52:54,222 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 20:52:54,223 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:52:54,223 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:52:54,223 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.3s Time] [2025-01-09 20:52:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 20:52:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 365. [2025-01-09 20:52:54,237 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:52:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 487 transitions. [2025-01-09 20:52:54,238 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 487 transitions. Word has length 156 [2025-01-09 20:52:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:54,239 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 487 transitions. [2025-01-09 20:52:54,239 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:52:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 487 transitions. [2025-01-09 20:52:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 20:52:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:54,241 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:52:54,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:52:54,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1677229978, now seen corresponding path program 1 times [2025-01-09 20:52:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876200097] [2025-01-09 20:52:54,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:54,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:52:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:52:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:54,729 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:52:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876200097] [2025-01-09 20:52:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876200097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:52:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149190403] [2025-01-09 20:52:54,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:52:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:52:54,733 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:52:54,734 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:52:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:52:55,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:52:55,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:55,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:55,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 20:52:55,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:52:55,083 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:52:55,694 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:52:55,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:52:55,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149190403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:55,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:52:55,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 20:52:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171142023] [2025-01-09 20:52:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:55,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:52:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:55,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:52:55,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:52:55,696 INFO L87 Difference]: Start difference. First operand 365 states and 487 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:52:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:56,289 INFO L93 Difference]: Finished difference Result 662 states and 880 transitions. [2025-01-09 20:52:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:52:56,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:52:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:56,292 INFO L225 Difference]: With dead ends: 662 [2025-01-09 20:52:56,292 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 20:52:56,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 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:52:56,293 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 358 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:52:56,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2018 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:52:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 20:52:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 401. [2025-01-09 20:52:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3156565656565657) internal successors, (521), 396 states have internal predecessors, (521), 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:52:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 527 transitions. [2025-01-09 20:52:56,315 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 527 transitions. Word has length 166 [2025-01-09 20:52:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:56,316 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 527 transitions. [2025-01-09 20:52:56,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:52:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 527 transitions. [2025-01-09 20:52:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 20:52:56,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:56,317 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:52:56,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:52:56,521 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:52:56,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1092222384, now seen corresponding path program 1 times [2025-01-09 20:52:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:56,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666651251] [2025-01-09 20:52:56,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:52:56,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:52:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:56,912 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:52:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666651251] [2025-01-09 20:52:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666651251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:52:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498519634] [2025-01-09 20:52:56,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:56,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:52:56,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:52:56,915 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:52:56,916 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:52:57,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:52:57,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:52:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:57,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:57,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 20:52:57,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:52:57,219 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:52:57,235 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:52:57,847 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:52:57,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:52:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498519634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:52:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:52:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102792679] [2025-01-09 20:52:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:57,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:52:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:57,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:52:57,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:52:57,849 INFO L87 Difference]: Start difference. First operand 401 states and 527 transitions. Second operand has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 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:52:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:52:58,989 INFO L93 Difference]: Finished difference Result 903 states and 1200 transitions. [2025-01-09 20:52:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:52:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 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:52:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:52:58,995 INFO L225 Difference]: With dead ends: 903 [2025-01-09 20:52:58,995 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 20:52:58,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 159 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:52:58,996 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 461 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 20:52:58,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 2016 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 20:52:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 20:52:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 401. [2025-01-09 20:52:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3131313131313131) internal successors, (520), 396 states have internal predecessors, (520), 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:52:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 526 transitions. [2025-01-09 20:52:59,009 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 526 transitions. Word has length 167 [2025-01-09 20:52:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:52:59,010 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 526 transitions. [2025-01-09 20:52:59,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 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:52:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 526 transitions. [2025-01-09 20:52:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:52:59,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:52:59,014 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:52:59,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:52:59,219 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:52:59,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:52:59,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:52:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1055939703, now seen corresponding path program 1 times [2025-01-09 20:52:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:52:59,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94146999] [2025-01-09 20:52:59,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:52:59,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:52:59,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:52:59,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:59,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:59,501 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:52:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:52:59,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94146999] [2025-01-09 20:52:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94146999] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:52:59,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448843075] [2025-01-09 20:52:59,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:52:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:52:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:52:59,504 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:52:59,505 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:52:59,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:52:59,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:52:59,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:52:59,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:52:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 20:52:59,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:52:59,972 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:52:59,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:52:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448843075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:52:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:52:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-01-09 20:52:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305421022] [2025-01-09 20:52:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:52:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:52:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:52:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:52:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:52:59,974 INFO L87 Difference]: Start difference. First operand 401 states and 526 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 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:53:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:00,124 INFO L93 Difference]: Finished difference Result 516 states and 680 transitions. [2025-01-09 20:53:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:53:00,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 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 168 [2025-01-09 20:53:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:00,126 INFO L225 Difference]: With dead ends: 516 [2025-01-09 20:53:00,126 INFO L226 Difference]: Without dead ends: 401 [2025-01-09 20:53:00,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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:53:00,127 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 17 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:00,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1196 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-01-09 20:53:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-01-09 20:53:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3106060606060606) internal successors, (519), 396 states have internal predecessors, (519), 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:53:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 525 transitions. [2025-01-09 20:53:00,138 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 525 transitions. Word has length 168 [2025-01-09 20:53:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 525 transitions. [2025-01-09 20:53:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 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:53:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 525 transitions. [2025-01-09 20:53:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:53:00,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:00,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] [2025-01-09 20:53:00,149 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:53:00,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:00,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -159419026, now seen corresponding path program 1 times [2025-01-09 20:53:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971960819] [2025-01-09 20:53:00,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:00,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:00,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:53:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:53:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:00,669 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:53:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971960819] [2025-01-09 20:53:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971960819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:53:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43030425] [2025-01-09 20:53:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:53:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:00,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:53:00,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:53:00,670 INFO L87 Difference]: Start difference. First operand 401 states and 525 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:53:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:00,872 INFO L93 Difference]: Finished difference Result 519 states and 683 transitions. [2025-01-09 20:53:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:53:00,873 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 169 [2025-01-09 20:53:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:00,874 INFO L225 Difference]: With dead ends: 519 [2025-01-09 20:53:00,874 INFO L226 Difference]: Without dead ends: 404 [2025-01-09 20:53:00,874 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:53:00,875 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 8 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:00,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1430 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:53:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-09 20:53:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-01-09 20:53:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 399 states have (on average 1.3082706766917294) internal successors, (522), 399 states have internal predecessors, (522), 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:53:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 528 transitions. [2025-01-09 20:53:00,888 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 528 transitions. Word has length 169 [2025-01-09 20:53:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:00,889 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 528 transitions. [2025-01-09 20:53:00,889 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:53:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 528 transitions. [2025-01-09 20:53:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 20:53:00,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:00,890 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:53:00,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:53:00,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:00,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1630880496, now seen corresponding path program 1 times [2025-01-09 20:53:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:00,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357635163] [2025-01-09 20:53:00,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:00,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:53:00,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:53:00,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:00,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:01,204 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:53:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357635163] [2025-01-09 20:53:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357635163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:01,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:01,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:53:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128825753] [2025-01-09 20:53:01,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:01,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:53:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:01,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:53:01,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:53:01,206 INFO L87 Difference]: Start difference. First operand 404 states and 528 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:53:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:01,461 INFO L93 Difference]: Finished difference Result 527 states and 692 transitions. [2025-01-09 20:53:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:53:01,462 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 170 [2025-01-09 20:53:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:01,463 INFO L225 Difference]: With dead ends: 527 [2025-01-09 20:53:01,463 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 20:53:01,464 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:53:01,464 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:53:01,464 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:53:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 20:53:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 408. [2025-01-09 20:53:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.3076923076923077) internal successors, (527), 403 states have internal predecessors, (527), 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:53:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 533 transitions. [2025-01-09 20:53:01,481 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 533 transitions. Word has length 170 [2025-01-09 20:53:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:01,481 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 533 transitions. [2025-01-09 20:53:01,481 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:53:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 533 transitions. [2025-01-09 20:53:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 20:53:01,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:01,484 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:53:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:53:01,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:01,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 908938740, now seen corresponding path program 1 times [2025-01-09 20:53:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062359730] [2025-01-09 20:53:01,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:01,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:53:01,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:53:01,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:01,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:01,809 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:53:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062359730] [2025-01-09 20:53:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062359730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329350114] [2025-01-09 20:53:01,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:01,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:01,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:01,813 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:53:01,815 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:53:02,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:53:02,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:53:02,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:02,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:02,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 20:53:02,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:02,123 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:53:02,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:53:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329350114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:53:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:53:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183770636] [2025-01-09 20:53:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:53:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:02,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:53:02,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:53:02,126 INFO L87 Difference]: Start difference. First operand 408 states and 533 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 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:53:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:02,229 INFO L93 Difference]: Finished difference Result 771 states and 1015 transitions. [2025-01-09 20:53:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:53:02,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 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 170 [2025-01-09 20:53:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:02,231 INFO L225 Difference]: With dead ends: 771 [2025-01-09 20:53:02,232 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 20:53:02,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 169 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:53:02,233 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 17 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 907 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:53:02,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 907 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 20:53:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-01-09 20:53:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 403 states have (on average 1.3027295285359801) internal successors, (525), 403 states have internal predecessors, (525), 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:53:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 531 transitions. [2025-01-09 20:53:02,245 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 531 transitions. Word has length 170 [2025-01-09 20:53:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:02,245 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 531 transitions. [2025-01-09 20:53:02,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 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:53:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 531 transitions. [2025-01-09 20:53:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 20:53:02,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:02,247 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:53:02,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 20:53:02,451 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:53:02,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:02,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash -103155320, now seen corresponding path program 1 times [2025-01-09 20:53:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32750732] [2025-01-09 20:53:02,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 20:53:02,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 20:53:02,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:02,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:02,699 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:53:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32750732] [2025-01-09 20:53:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32750732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:53:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078288343] [2025-01-09 20:53:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:53:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:02,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:53:02,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:53:02,701 INFO L87 Difference]: Start difference. First operand 408 states and 531 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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:53:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:02,898 INFO L93 Difference]: Finished difference Result 774 states and 1017 transitions. [2025-01-09 20:53:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:53:02,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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 171 [2025-01-09 20:53:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:02,900 INFO L225 Difference]: With dead ends: 774 [2025-01-09 20:53:02,900 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 20:53:02,900 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:53:02,901 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 8 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:02,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1425 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:53:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 20:53:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-01-09 20:53:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 409 states have (on average 1.2982885085574571) internal successors, (531), 409 states have internal predecessors, (531), 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:53:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 537 transitions. [2025-01-09 20:53:02,915 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 537 transitions. Word has length 171 [2025-01-09 20:53:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:02,916 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 537 transitions. [2025-01-09 20:53:02,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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:53:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 537 transitions. [2025-01-09 20:53:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:53:02,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:02,917 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:53:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:53:02,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1217310829, now seen corresponding path program 1 times [2025-01-09 20:53:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94505800] [2025-01-09 20:53:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:53:02,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:53:02,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:02,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:03,164 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:53:03,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:03,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94505800] [2025-01-09 20:53:03,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94505800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:53:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294056948] [2025-01-09 20:53:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:03,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:53:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:03,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:53:03,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:53:03,167 INFO L87 Difference]: Start difference. First operand 414 states and 537 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:53:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:03,405 INFO L93 Difference]: Finished difference Result 780 states and 1021 transitions. [2025-01-09 20:53:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:53:03,405 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:53:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:03,407 INFO L225 Difference]: With dead ends: 780 [2025-01-09 20:53:03,407 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 20:53:03,407 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:53:03,408 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:53:03,408 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:53:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 20:53:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2025-01-09 20:53:03,419 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:53:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 547 transitions. [2025-01-09 20:53:03,420 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 547 transitions. Word has length 172 [2025-01-09 20:53:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:03,421 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 547 transitions. [2025-01-09 20:53:03,421 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:53:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 547 transitions. [2025-01-09 20:53:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:53:03,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:03,423 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:53:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:53:03,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:03,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1691977135, now seen corresponding path program 1 times [2025-01-09 20:53:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:03,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980616433] [2025-01-09 20:53:03,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:03,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:53:03,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:53:03,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:03,742 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:53:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980616433] [2025-01-09 20:53:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980616433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884466767] [2025-01-09 20:53:03,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:03,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:03,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:03,745 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:53:03,746 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:53:03,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:53:04,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:53:04,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:04,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:04,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:53:04,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:04,183 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:53:04,217 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:53:04,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:53:04,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884466767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:04,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:53:04,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-01-09 20:53:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83187866] [2025-01-09 20:53:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:53:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:04,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:53:04,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:53:04,218 INFO L87 Difference]: Start difference. First operand 422 states and 547 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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:53:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:04,290 INFO L93 Difference]: Finished difference Result 798 states and 1039 transitions. [2025-01-09 20:53:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:53:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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 172 [2025-01-09 20:53:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:04,293 INFO L225 Difference]: With dead ends: 798 [2025-01-09 20:53:04,293 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 20:53:04,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:53:04,295 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 187 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:04,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1700 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 20:53:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 425. [2025-01-09 20:53:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 419 states have (on average 1.298329355608592) internal successors, (544), 420 states have internal predecessors, (544), 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:53:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 551 transitions. [2025-01-09 20:53:04,308 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 551 transitions. Word has length 172 [2025-01-09 20:53:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:04,308 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 551 transitions. [2025-01-09 20:53:04,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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:53:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 551 transitions. [2025-01-09 20:53:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:53:04,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:04,310 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] [2025-01-09 20:53:04,321 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:53:04,510 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:53:04,511 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash -699237201, now seen corresponding path program 1 times [2025-01-09 20:53:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762754563] [2025-01-09 20:53:04,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:04,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:53:04,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:53:04,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:04,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:04,849 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:53:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762754563] [2025-01-09 20:53:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762754563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36182457] [2025-01-09 20:53:04,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:04,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:04,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:04,852 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:53:04,853 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:53:05,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:53:05,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:53:05,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:05,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:05,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 20:53:05,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:53:05,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:53:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36182457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:53:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 20:53:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95282072] [2025-01-09 20:53:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:05,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:53:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:05,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:53:05,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:53:05,385 INFO L87 Difference]: Start difference. First operand 425 states and 551 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:53:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:07,279 INFO L93 Difference]: Finished difference Result 798 states and 1044 transitions. [2025-01-09 20:53:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:53:07,280 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:53:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:07,281 INFO L225 Difference]: With dead ends: 798 [2025-01-09 20:53:07,281 INFO L226 Difference]: Without dead ends: 435 [2025-01-09 20:53:07,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:53:07,282 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 12 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.9s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:07,282 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.9s Time] [2025-01-09 20:53:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-09 20:53:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2025-01-09 20:53:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 425 states have (on average 1.2941176470588236) internal successors, (550), 426 states have internal predecessors, (550), 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:53:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 557 transitions. [2025-01-09 20:53:07,294 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 557 transitions. Word has length 174 [2025-01-09 20:53:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:07,294 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 557 transitions. [2025-01-09 20:53:07,294 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:53:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 557 transitions. [2025-01-09 20:53:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 20:53:07,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:07,296 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] [2025-01-09 20:53:07,305 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:53:07,496 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,SelfDestructingSolverStorable15 [2025-01-09 20:53:07,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:07,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 238860762, now seen corresponding path program 1 times [2025-01-09 20:53:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795407597] [2025-01-09 20:53:07,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:07,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:53:07,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:53:07,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:07,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:53:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795407597] [2025-01-09 20:53:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795407597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:53:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063469009] [2025-01-09 20:53:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:07,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:53:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:07,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:53:07,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:53:07,793 INFO L87 Difference]: Start difference. First operand 431 states and 557 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:53:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:08,064 INFO L93 Difference]: Finished difference Result 812 states and 1057 transitions. [2025-01-09 20:53:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:53:08,065 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:53:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:08,066 INFO L225 Difference]: With dead ends: 812 [2025-01-09 20:53:08,066 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 20:53:08,067 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:53:08,067 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 20 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:08,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2298 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:53:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 20:53:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2025-01-09 20:53:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 439 states have (on average 1.2938496583143508) internal successors, (568), 440 states have internal predecessors, (568), 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:53:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 575 transitions. [2025-01-09 20:53:08,082 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 575 transitions. Word has length 175 [2025-01-09 20:53:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:08,082 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 575 transitions. [2025-01-09 20:53:08,082 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:53:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 575 transitions. [2025-01-09 20:53:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:53:08,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:08,083 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] [2025-01-09 20:53:08,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:53:08,084 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:08,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 356289983, now seen corresponding path program 1 times [2025-01-09 20:53:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052275718] [2025-01-09 20:53:08,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:08,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:53:08,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:53:08,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:08,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:53:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052275718] [2025-01-09 20:53:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052275718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:53:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384026033] [2025-01-09 20:53:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:08,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:53:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:08,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:53:08,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:53:08,421 INFO L87 Difference]: Start difference. First operand 445 states and 575 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:53:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:08,762 INFO L93 Difference]: Finished difference Result 836 states and 1090 transitions. [2025-01-09 20:53:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:53:08,762 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:53:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:08,765 INFO L225 Difference]: With dead ends: 836 [2025-01-09 20:53:08,765 INFO L226 Difference]: Without dead ends: 463 [2025-01-09 20:53:08,766 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:53:08,766 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:53:08,766 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:53:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-09 20:53:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 451. [2025-01-09 20:53:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 445 states have (on average 1.2898876404494382) internal successors, (574), 446 states have internal predecessors, (574), 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:53:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 581 transitions. [2025-01-09 20:53:08,778 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 581 transitions. Word has length 176 [2025-01-09 20:53:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:08,779 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 581 transitions. [2025-01-09 20:53:08,779 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:53:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 581 transitions. [2025-01-09 20:53:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:53:08,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:08,781 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] [2025-01-09 20:53:08,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:53:08,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1079619107, now seen corresponding path program 1 times [2025-01-09 20:53:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375814783] [2025-01-09 20:53:08,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:08,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:53:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:53:08,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:08,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:09,069 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:53:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375814783] [2025-01-09 20:53:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375814783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744799266] [2025-01-09 20:53:09,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:09,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:09,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:09,072 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:53:09,073 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:53:09,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:53:09,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:53:09,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:09,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:09,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:53:09,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:53:09,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:53:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744799266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:53:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 20:53:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283087783] [2025-01-09 20:53:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:53:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:53:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:53:09,508 INFO L87 Difference]: Start difference. First operand 451 states and 581 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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:53:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:09,728 INFO L93 Difference]: Finished difference Result 836 states and 1085 transitions. [2025-01-09 20:53:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:53:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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:53:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:09,730 INFO L225 Difference]: With dead ends: 836 [2025-01-09 20:53:09,730 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 20:53:09,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:53:09,731 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:53:09,731 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:53:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 20:53:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 455. [2025-01-09 20:53:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 449 states have (on average 1.287305122494432) internal successors, (578), 450 states have internal predecessors, (578), 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:53:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 585 transitions. [2025-01-09 20:53:09,745 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 585 transitions. Word has length 176 [2025-01-09 20:53:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:09,745 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 585 transitions. [2025-01-09 20:53:09,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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:53:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 585 transitions. [2025-01-09 20:53:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:53:09,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:09,747 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] [2025-01-09 20:53:09,756 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:53:09,948 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:53:09,948 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:09,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1550991830, now seen corresponding path program 1 times [2025-01-09 20:53:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579258628] [2025-01-09 20:53:09,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:09,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:53:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:53:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:10,298 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:53:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579258628] [2025-01-09 20:53:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579258628] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78871061] [2025-01-09 20:53:10,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:10,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:10,300 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:53:10,302 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:53:10,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:53:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:53:10,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:10,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:53:10,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 20:53:10,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:53:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78871061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:10,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:53:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 20:53:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840605274] [2025-01-09 20:53:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:53:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:10,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:53:10,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:53:10,846 INFO L87 Difference]: Start difference. First operand 455 states and 585 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:53:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:11,077 INFO L93 Difference]: Finished difference Result 582 states and 754 transitions. [2025-01-09 20:53:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:53:11,078 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 176 [2025-01-09 20:53:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:11,081 INFO L225 Difference]: With dead ends: 582 [2025-01-09 20:53:11,081 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 20:53:11,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:53:11,081 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:53:11,081 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:53:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 20:53:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 455. [2025-01-09 20:53:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 449 states have (on average 1.287305122494432) internal successors, (578), 450 states have internal predecessors, (578), 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:53:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 585 transitions. [2025-01-09 20:53:11,095 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 585 transitions. Word has length 176 [2025-01-09 20:53:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:11,095 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 585 transitions. [2025-01-09 20:53:11,095 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:53:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 585 transitions. [2025-01-09 20:53:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:53:11,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:11,096 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] [2025-01-09 20:53:11,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 20:53:11,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:11,301 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 558984012, now seen corresponding path program 1 times [2025-01-09 20:53:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780068516] [2025-01-09 20:53:11,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:11,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:53:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:53:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 20:53:11,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780068516] [2025-01-09 20:53:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780068516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:11,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:53:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793231995] [2025-01-09 20:53:11,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:11,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:53:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:11,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:53:11,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:53:11,560 INFO L87 Difference]: Start difference. First operand 455 states and 585 transitions. Second operand has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 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:53:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:11,776 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2025-01-09 20:53:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:53:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 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 177 [2025-01-09 20:53:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:11,778 INFO L225 Difference]: With dead ends: 587 [2025-01-09 20:53:11,778 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 20:53:11,779 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:53:11,780 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:53:11,780 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:53:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 20:53:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2025-01-09 20:53:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 456 states have (on average 1.287280701754386) internal successors, (587), 457 states have internal predecessors, (587), 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:53:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 594 transitions. [2025-01-09 20:53:11,791 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 594 transitions. Word has length 177 [2025-01-09 20:53:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:11,791 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 594 transitions. [2025-01-09 20:53:11,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 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:53:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 594 transitions. [2025-01-09 20:53:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:53:11,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:11,792 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] [2025-01-09 20:53:11,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:53:11,793 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:11,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1983969000, now seen corresponding path program 1 times [2025-01-09 20:53:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080676162] [2025-01-09 20:53:11,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:11,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:53:11,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:53:11,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:11,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:12,071 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:53:12,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:12,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080676162] [2025-01-09 20:53:12,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080676162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:12,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047079636] [2025-01-09 20:53:12,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:12,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:12,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:12,073 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:53:12,075 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:53:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:53:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:53:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:12,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-01-09 20:53:12,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:12,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 20:53:12,741 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-09 20:53:12,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-01-09 20:53:12,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:53:12,794 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 26 treesize of output 14 [2025-01-09 20:53:12,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 20:53:12,908 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-01-09 20:53:19,186 INFO L224 Elim1Store]: Index analysis took 239 ms