./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_FNV_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:41:22,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:41:22,337 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:41:22,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:41:22,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:41:22,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:41:22,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:41:22,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:41:22,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:41:22,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:41:22,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:41:22,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:41:22,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:41:22,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:41:22,375 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:41:22,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:41:22,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:41:22,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:41:22,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:41:22,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:41:22,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:41:22,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:41:22,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:41:22,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:41:22,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:22,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:41:22,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:41:22,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:41:22,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:41:22,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:22,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:41:22,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:41:22,381 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:41:22,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:41:22,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:41:22,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:41:22,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:41:22,664 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:41:22,665 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_FNV_nondet_test2-1.i [2025-01-09 20:41:24,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438a7efed/6c2ae2ce90444a12ba2426de2f2a02a1/FLAGdefccbc85 [2025-01-09 20:41:24,353 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:41:24,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-01-09 20:41:24,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438a7efed/6c2ae2ce90444a12ba2426de2f2a02a1/FLAGdefccbc85 [2025-01-09 20:41:24,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438a7efed/6c2ae2ce90444a12ba2426de2f2a02a1 [2025-01-09 20:41:24,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:41:24,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:41:24,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:41:24,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:41:24,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:41:24,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:41:24" (1/1) ... [2025-01-09 20:41:24,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b52c778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:24, skipping insertion in model container [2025-01-09 20:41:24,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:41:24" (1/1) ... [2025-01-09 20:41:24,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:41:24,857 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_FNV_nondet_test2-1.i[37435,37448] [2025-01-09 20:41:24,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:41:24,978 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:41:25,013 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_FNV_nondet_test2-1.i[37435,37448] [2025-01-09 20:41:25,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:41:25,122 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:41:25,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25 WrapperNode [2025-01-09 20:41:25,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:41:25,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:41:25,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:41:25,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:41:25,129 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:41:25" (1/1) ... [2025-01-09 20:41:25,151 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:41:25" (1/1) ... [2025-01-09 20:41:25,208 INFO L138 Inliner]: procedures = 207, calls = 221, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1239 [2025-01-09 20:41:25,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:41:25,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:41:25,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:41:25,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:41:25,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,299 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-09 20:41:25,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:41:25,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:41:25,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:41:25,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:41:25,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (1/1) ... [2025-01-09 20:41:25,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:41:25,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:25,410 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:41:25,412 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:41:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:41:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:41:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:41:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:41:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:41:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:41:25,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:41:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:41:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:41:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:41:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:41:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:41:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:41:25,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:41:25,619 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:41:25,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:41:26,983 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-01-09 20:41:26,983 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:41:27,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:41:27,006 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 20:41:27,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:41:27 BoogieIcfgContainer [2025-01-09 20:41:27,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:41:27,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:41:27,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:41:27,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:41:27,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:41:24" (1/3) ... [2025-01-09 20:41:27,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cc2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:41:27, skipping insertion in model container [2025-01-09 20:41:27,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:41:25" (2/3) ... [2025-01-09 20:41:27,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cc2673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:41:27, skipping insertion in model container [2025-01-09 20:41:27,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:41:27" (3/3) ... [2025-01-09 20:41:27,017 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2025-01-09 20:41:27,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:41:27,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-1.i that has 4 procedures, 372 locations, 1 initial locations, 33 loop locations, and 1 error locations. [2025-01-09 20:41:27,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:41:27,109 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;@79cdd43c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:41:27,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:41:27,116 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:41:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 20:41:27,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:27,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:27,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1494204060, now seen corresponding path program 1 times [2025-01-09 20:41:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:27,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960083244] [2025-01-09 20:41:27,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:27,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 20:41:27,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 20:41:27,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:27,286 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:41:27,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:27,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960083244] [2025-01-09 20:41:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960083244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:27,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:41:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720594463] [2025-01-09 20:41:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:27,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:41:27,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:27,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:41:27,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:41:27,311 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:41:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:27,370 INFO L93 Difference]: Finished difference Result 725 states and 1162 transitions. [2025-01-09 20:41:27,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:41:27,375 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:41:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:27,384 INFO L225 Difference]: With dead ends: 725 [2025-01-09 20:41:27,385 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 20:41:27,392 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:41:27,395 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:41:27,397 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:41:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 20:41:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-09 20:41:27,454 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:41:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 523 transitions. [2025-01-09 20:41:27,466 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 523 transitions. Word has length 11 [2025-01-09 20:41:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 523 transitions. [2025-01-09 20:41:27,467 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:41:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 523 transitions. [2025-01-09 20:41:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:41:27,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:27,473 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:41:27,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:41:27,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:27,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash -361622491, now seen corresponding path program 1 times [2025-01-09 20:41:27,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:27,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40605886] [2025-01-09 20:41:27,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:27,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:27,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:41:27,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:41:27,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:27,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:27,855 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:41:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40605886] [2025-01-09 20:41:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40605886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:27,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:41:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144973619] [2025-01-09 20:41:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:27,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:41:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:27,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:41:27,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:41:27,859 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:41:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:27,963 INFO L93 Difference]: Finished difference Result 475 states and 689 transitions. [2025-01-09 20:41:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:41:27,963 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:41:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:27,966 INFO L225 Difference]: With dead ends: 475 [2025-01-09 20:41:27,968 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 20:41:27,968 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:41:27,970 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:41:27,970 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:41:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 20:41:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-01-09 20:41:27,993 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:41:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 446 transitions. [2025-01-09 20:41:27,995 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 446 transitions. Word has length 65 [2025-01-09 20:41:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:27,995 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 446 transitions. [2025-01-09 20:41:27,995 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:41:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 446 transitions. [2025-01-09 20:41:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:41:28,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:28,004 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:41:28,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:41:28,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:28,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1542086863, now seen corresponding path program 1 times [2025-01-09 20:41:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:28,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142054986] [2025-01-09 20:41:28,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:28,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:41:28,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:41:28,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:28,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:28,666 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:41:28,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142054986] [2025-01-09 20:41:28,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142054986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:28,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:41:28,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043360834] [2025-01-09 20:41:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:28,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:28,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:28,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:41:28,670 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:41:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:28,879 INFO L93 Difference]: Finished difference Result 746 states and 1042 transitions. [2025-01-09 20:41:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:41:28,881 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:41:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:28,885 INFO L225 Difference]: With dead ends: 746 [2025-01-09 20:41:28,886 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 20:41:28,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:28,888 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:41:28,889 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:41:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 20:41:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 320. [2025-01-09 20:41:28,908 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:41:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2025-01-09 20:41:28,914 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 65 [2025-01-09 20:41:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2025-01-09 20:41:28,915 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:41:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2025-01-09 20:41:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:41:28,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:28,923 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:41:28,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:41:28,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1310907661, now seen corresponding path program 1 times [2025-01-09 20:41:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310905269] [2025-01-09 20:41:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:29,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:41:29,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:41:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:29,275 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:41:29,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310905269] [2025-01-09 20:41:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310905269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:29,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:41:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343613412] [2025-01-09 20:41:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:41:29,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:41:29,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:41:29,280 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:41:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:29,375 INFO L93 Difference]: Finished difference Result 593 states and 825 transitions. [2025-01-09 20:41:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:41:29,376 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:41:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:29,378 INFO L225 Difference]: With dead ends: 593 [2025-01-09 20:41:29,381 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 20:41:29,382 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:41:29,383 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 30 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:41:29,383 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:41:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 20:41:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 20:41:29,392 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:41:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2025-01-09 20:41:29,393 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 141 [2025-01-09 20:41:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:29,394 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2025-01-09 20:41:29,394 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:41:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2025-01-09 20:41:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:41:29,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:29,399 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:41:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:41:29,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:29,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash 962613887, now seen corresponding path program 1 times [2025-01-09 20:41:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095417278] [2025-01-09 20:41:29,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:29,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:41:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:41:29,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:29,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:29,620 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:41:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095417278] [2025-01-09 20:41:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095417278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:41:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547693759] [2025-01-09 20:41:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:41:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:29,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:41:29,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:41:29,622 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:41:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:29,702 INFO L93 Difference]: Finished difference Result 732 states and 982 transitions. [2025-01-09 20:41:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:41:29,702 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:41:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:29,704 INFO L225 Difference]: With dead ends: 732 [2025-01-09 20:41:29,705 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 20:41:29,705 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:41:29,708 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 176 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:41:29,709 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:41:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 20:41:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2025-01-09 20:41:29,727 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:41:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 613 transitions. [2025-01-09 20:41:29,734 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 613 transitions. Word has length 141 [2025-01-09 20:41:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:29,735 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 613 transitions. [2025-01-09 20:41:29,735 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:41:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 613 transitions. [2025-01-09 20:41:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 20:41:29,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:29,739 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:41:29,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:41:29,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:29,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2037782121, now seen corresponding path program 1 times [2025-01-09 20:41:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876183488] [2025-01-09 20:41:29,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:29,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 20:41:29,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 20:41:29,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:30,100 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:41:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876183488] [2025-01-09 20:41:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876183488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:30,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:41:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112060456] [2025-01-09 20:41:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:30,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:41:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:30,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:41:30,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:41:30,104 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:41:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:30,512 INFO L93 Difference]: Finished difference Result 902 states and 1210 transitions. [2025-01-09 20:41:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:41:30,513 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:41:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:30,516 INFO L225 Difference]: With dead ends: 902 [2025-01-09 20:41:30,516 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 20:41:30,517 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:41:30,517 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 767 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:30,518 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.4s Time] [2025-01-09 20:41:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 20:41:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 365. [2025-01-09 20:41:30,530 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:41:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 487 transitions. [2025-01-09 20:41:30,533 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 487 transitions. Word has length 156 [2025-01-09 20:41:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:30,533 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 487 transitions. [2025-01-09 20:41:30,533 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:41:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 487 transitions. [2025-01-09 20:41:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 20:41:30,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:30,535 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:41:30,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:41:30,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:30,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1051528602, now seen corresponding path program 1 times [2025-01-09 20:41:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:30,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733778472] [2025-01-09 20:41:30,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:30,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:41:30,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:41:30,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:30,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:31,214 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:41:31,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733778472] [2025-01-09 20:41:31,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733778472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618427051] [2025-01-09 20:41:31,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:31,228 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:41:31,236 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:41:31,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:41:31,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:41:31,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:31,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 20:41:31,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:31,674 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:41:31,701 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:41:32,707 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:41:32,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618427051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:32,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:41:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788330357] [2025-01-09 20:41:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:41:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:32,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:41:32,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:41:32,709 INFO L87 Difference]: Start difference. First operand 365 states and 487 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:34,565 INFO L93 Difference]: Finished difference Result 867 states and 1161 transitions. [2025-01-09 20:41:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:41:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-01-09 20:41:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:34,570 INFO L225 Difference]: With dead ends: 867 [2025-01-09 20:41:34,570 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 20:41:34,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 20:41:34,572 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 460 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:34,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 2448 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 20:41:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 20:41:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 365. [2025-01-09 20:41:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.3333333333333333) internal successors, (480), 360 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2025-01-09 20:41:34,604 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 166 [2025-01-09 20:41:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:34,605 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2025-01-09 20:41:34,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2025-01-09 20:41:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 20:41:34,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:34,608 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:41:34,622 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:41:34,815 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:41:34,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:34,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1234480493, now seen corresponding path program 1 times [2025-01-09 20:41:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:34,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9387755] [2025-01-09 20:41:34,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:34,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:41:35,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:41:35,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:35,409 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:41:35,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9387755] [2025-01-09 20:41:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9387755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526897191] [2025-01-09 20:41:35,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:35,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:35,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:35,412 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:41:35,415 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:41:35,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 20:41:35,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 20:41:35,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:35,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:35,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 20:41:35,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:35,857 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:41:35,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526897191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:41:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274779389] [2025-01-09 20:41:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:41:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:35,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:41:35,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:41:35,859 INFO L87 Difference]: Start difference. First operand 365 states and 486 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:35,970 INFO L93 Difference]: Finished difference Result 685 states and 921 transitions. [2025-01-09 20:41:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:41:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-01-09 20:41:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:35,972 INFO L225 Difference]: With dead ends: 685 [2025-01-09 20:41:35,972 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 20:41:35,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:41:35,973 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 17 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:35,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 910 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:41:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 20:41:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-01-09 20:41:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.3277777777777777) internal successors, (478), 360 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 484 transitions. [2025-01-09 20:41:35,990 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 484 transitions. Word has length 167 [2025-01-09 20:41:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:35,990 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 484 transitions. [2025-01-09 20:41:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 484 transitions. [2025-01-09 20:41:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 20:41:35,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:35,995 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:41:36,007 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:41:36,199 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:41:36,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:36,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -448499841, now seen corresponding path program 1 times [2025-01-09 20:41:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609753524] [2025-01-09 20:41:36,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:36,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 20:41:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 20:41:36,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:36,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:36,637 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:41:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609753524] [2025-01-09 20:41:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609753524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:41:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779405249] [2025-01-09 20:41:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:41:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:36,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:41:36,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:41:36,639 INFO L87 Difference]: Start difference. First operand 365 states and 484 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:36,873 INFO L93 Difference]: Finished difference Result 688 states and 923 transitions. [2025-01-09 20:41:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:41:36,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-01-09 20:41:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:36,876 INFO L225 Difference]: With dead ends: 688 [2025-01-09 20:41:36,876 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 20:41:36,877 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:41:36,877 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 8 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:36,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1180 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:41:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 20:41:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-01-09 20:41:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 366 states have (on average 1.3224043715846994) internal successors, (484), 366 states have internal predecessors, (484), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 490 transitions. [2025-01-09 20:41:36,895 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 490 transitions. Word has length 168 [2025-01-09 20:41:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:36,895 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 490 transitions. [2025-01-09 20:41:36,895 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:41:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 490 transitions. [2025-01-09 20:41:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:41:36,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:36,897 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:41:36,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:41:36,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:36,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2038650182, now seen corresponding path program 1 times [2025-01-09 20:41:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217896128] [2025-01-09 20:41:36,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:36,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:36,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:41:36,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:41:36,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:36,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:37,303 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:41:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:37,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217896128] [2025-01-09 20:41:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217896128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:37,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:37,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:41:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902767622] [2025-01-09 20:41:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:37,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:37,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:37,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:41:37,305 INFO L87 Difference]: Start difference. First operand 371 states and 490 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:37,631 INFO L93 Difference]: Finished difference Result 694 states and 927 transitions. [2025-01-09 20:41:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:41:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-01-09 20:41:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:37,634 INFO L225 Difference]: With dead ends: 694 [2025-01-09 20:41:37,634 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 20:41:37,635 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:41:37,636 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 12 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:37,637 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.3s Time] [2025-01-09 20:41:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 20:41:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2025-01-09 20:41:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 374 states have (on average 1.320855614973262) internal successors, (494), 374 states have internal predecessors, (494), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 500 transitions. [2025-01-09 20:41:37,653 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 500 transitions. Word has length 169 [2025-01-09 20:41:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:37,654 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 500 transitions. [2025-01-09 20:41:37,654 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:41:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 500 transitions. [2025-01-09 20:41:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:41:37,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:37,656 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:41:37,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:41:37,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:37,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1624755030, now seen corresponding path program 1 times [2025-01-09 20:41:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:37,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566661114] [2025-01-09 20:41:37,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:37,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:41:37,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:41:37,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:37,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:38,125 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:41:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566661114] [2025-01-09 20:41:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566661114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176649117] [2025-01-09 20:41:38,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:38,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:38,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:38,129 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:41:38,132 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:41:38,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:41:38,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:41:38,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:38,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:38,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 20:41:38,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:38,521 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:41:39,221 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:41:39,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176649117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 20:41:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861586219] [2025-01-09 20:41:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:39,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:41:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:39,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:41:39,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:41:39,224 INFO L87 Difference]: Start difference. First operand 379 states and 500 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:40,138 INFO L93 Difference]: Finished difference Result 676 states and 893 transitions. [2025-01-09 20:41:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:41:40,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-01-09 20:41:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:40,143 INFO L225 Difference]: With dead ends: 676 [2025-01-09 20:41:40,143 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 20:41:40,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:41:40,145 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 354 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:40,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2046 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 20:41:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 20:41:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 415. [2025-01-09 20:41:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.302439024390244) internal successors, (534), 410 states have internal predecessors, (534), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 540 transitions. [2025-01-09 20:41:40,166 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 540 transitions. Word has length 169 [2025-01-09 20:41:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:40,167 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 540 transitions. [2025-01-09 20:41:40,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 540 transitions. [2025-01-09 20:41:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 20:41:40,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:40,170 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:41:40,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 20:41:40,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:40,370 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1576021524, now seen corresponding path program 1 times [2025-01-09 20:41:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487638623] [2025-01-09 20:41:40,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:41:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:41:40,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:40,869 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:41:40,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487638623] [2025-01-09 20:41:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487638623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981075999] [2025-01-09 20:41:40,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:40,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:40,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:40,875 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:41:40,878 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:41:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 20:41:41,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 20:41:41,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:41,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:41,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 20:41:41,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:41,348 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:41:41,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981075999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-01-09 20:41:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888710335] [2025-01-09 20:41:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:41,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:41:41,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:41,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:41:41,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:41:41,352 INFO L87 Difference]: Start difference. First operand 415 states and 540 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:41,588 INFO L93 Difference]: Finished difference Result 530 states and 694 transitions. [2025-01-09 20:41:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:41:41,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-01-09 20:41:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:41,591 INFO L225 Difference]: With dead ends: 530 [2025-01-09 20:41:41,592 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 20:41:41,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:41:41,595 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 34 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:41,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1424 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:41:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 20:41:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-09 20:41:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.3) internal successors, (533), 410 states have internal predecessors, (533), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 539 transitions. [2025-01-09 20:41:41,611 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 539 transitions. Word has length 170 [2025-01-09 20:41:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:41,611 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 539 transitions. [2025-01-09 20:41:41,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 539 transitions. [2025-01-09 20:41:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 20:41:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:41,613 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:41:41,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:41:41,813 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:41:41,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1216751759, now seen corresponding path program 1 times [2025-01-09 20:41:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77742873] [2025-01-09 20:41:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:41,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 20:41:41,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 20:41:41,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:41,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:42,167 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:41:42,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77742873] [2025-01-09 20:41:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77742873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:42,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:42,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:41:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699980212] [2025-01-09 20:41:42,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:42,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:41:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:42,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:41:42,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:41:42,170 INFO L87 Difference]: Start difference. First operand 415 states and 539 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:42,373 INFO L93 Difference]: Finished difference Result 533 states and 697 transitions. [2025-01-09 20:41:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:41:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-01-09 20:41:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:42,376 INFO L225 Difference]: With dead ends: 533 [2025-01-09 20:41:42,376 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 20:41:42,376 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:41:42,377 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 8 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:42,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1176 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:41:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 20:41:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-09 20:41:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 1.297820823244552) internal successors, (536), 413 states have internal predecessors, (536), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 542 transitions. [2025-01-09 20:41:42,393 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 542 transitions. Word has length 171 [2025-01-09 20:41:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:42,393 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 542 transitions. [2025-01-09 20:41:42,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 542 transitions. [2025-01-09 20:41:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:41:42,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:42,396 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:41:42,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:41:42,396 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash -48456851, now seen corresponding path program 1 times [2025-01-09 20:41:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967683990] [2025-01-09 20:41:42,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:42,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:41:42,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:41:42,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:42,733 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:41:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967683990] [2025-01-09 20:41:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967683990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:41:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132107327] [2025-01-09 20:41:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:42,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:42,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:41:42,735 INFO L87 Difference]: Start difference. First operand 418 states and 542 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:43,017 INFO L93 Difference]: Finished difference Result 541 states and 706 transitions. [2025-01-09 20:41:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:41:43,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-01-09 20:41:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:43,020 INFO L225 Difference]: With dead ends: 541 [2025-01-09 20:41:43,020 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 20:41:43,020 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:41:43,021 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:43,021 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.3s Time] [2025-01-09 20:41:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 20:41:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 422. [2025-01-09 20:41:43,034 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:41:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 547 transitions. [2025-01-09 20:41:43,036 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 547 transitions. Word has length 172 [2025-01-09 20:41:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:43,036 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 547 transitions. [2025-01-09 20:41:43,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 547 transitions. [2025-01-09 20:41:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 20:41:43,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:43,039 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:41:43,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:41:43,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:43,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1803604911, now seen corresponding path program 1 times [2025-01-09 20:41:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475775573] [2025-01-09 20:41:43,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:43,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:41:43,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:41:43,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:43,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:43,420 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:41:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475775573] [2025-01-09 20:41:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475775573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197729227] [2025-01-09 20:41:43,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:43,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:43,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:43,423 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:41:43,425 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:41:43,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 20:41:43,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 20:41:43,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:43,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:43,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 20:41:43,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:44,084 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:41:44,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197729227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:44,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:44,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:41:44,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486083234] [2025-01-09 20:41:44,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:44,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:44,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:44,086 INFO L87 Difference]: Start difference. First operand 422 states and 547 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:45,558 INFO L93 Difference]: Finished difference Result 792 states and 1036 transitions. [2025-01-09 20:41:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:41:45,559 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:41:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:45,561 INFO L225 Difference]: With dead ends: 792 [2025-01-09 20:41:45,561 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 20:41:45,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:45,562 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 12 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:45,562 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.4s Time] [2025-01-09 20:41:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 20:41:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 428. [2025-01-09 20:41:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.293144208037825) internal successors, (547), 423 states have internal predecessors, (547), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 553 transitions. [2025-01-09 20:41:45,583 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 553 transitions. Word has length 172 [2025-01-09 20:41:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:45,583 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 553 transitions. [2025-01-09 20:41:45,584 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:41:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 553 transitions. [2025-01-09 20:41:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 20:41:45,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:45,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:45,597 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:41:45,787 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:41:45,787 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1650673604, now seen corresponding path program 1 times [2025-01-09 20:41:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929358281] [2025-01-09 20:41:45,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:45,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 20:41:45,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 20:41:45,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:45,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:46,207 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:41:46,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:46,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929358281] [2025-01-09 20:41:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929358281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:41:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909811974] [2025-01-09 20:41:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:41:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:46,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:41:46,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:46,210 INFO L87 Difference]: Start difference. First operand 428 states and 553 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:46,497 INFO L93 Difference]: Finished difference Result 806 states and 1049 transitions. [2025-01-09 20:41:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:41:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-01-09 20:41:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:46,500 INFO L225 Difference]: With dead ends: 806 [2025-01-09 20:41:46,500 INFO L226 Difference]: Without dead ends: 448 [2025-01-09 20:41:46,501 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:41:46,502 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:46,502 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.3s Time] [2025-01-09 20:41:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-09 20:41:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 442. [2025-01-09 20:41:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 437 states have (on average 1.2929061784897025) internal successors, (565), 437 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 571 transitions. [2025-01-09 20:41:46,520 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 571 transitions. Word has length 173 [2025-01-09 20:41:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 571 transitions. [2025-01-09 20:41:46,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 571 transitions. [2025-01-09 20:41:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:41:46,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:46,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:41:46,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:46,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1109769887, now seen corresponding path program 1 times [2025-01-09 20:41:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654031071] [2025-01-09 20:41:46,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:46,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:41:46,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:41:46,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:46,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:46,989 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:41:46,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:46,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654031071] [2025-01-09 20:41:46,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654031071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:46,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:46,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:41:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415253375] [2025-01-09 20:41:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:46,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:41:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:46,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:41:46,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:41:46,992 INFO L87 Difference]: Start difference. First operand 442 states and 571 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:47,405 INFO L93 Difference]: Finished difference Result 830 states and 1082 transitions. [2025-01-09 20:41:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:41:47,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-01-09 20:41:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:47,409 INFO L225 Difference]: With dead ends: 830 [2025-01-09 20:41:47,409 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 20:41:47,410 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:41:47,411 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:47,411 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.4s Time] [2025-01-09 20:41:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 20:41:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 448. [2025-01-09 20:41:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 443 states have (on average 1.2889390519187358) internal successors, (571), 443 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 577 transitions. [2025-01-09 20:41:47,429 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 577 transitions. Word has length 174 [2025-01-09 20:41:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:47,429 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 577 transitions. [2025-01-09 20:41:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 577 transitions. [2025-01-09 20:41:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:41:47,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:47,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:47,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:41:47,431 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 499919557, now seen corresponding path program 1 times [2025-01-09 20:41:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269848310] [2025-01-09 20:41:47,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:47,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:41:47,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:41:47,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:47,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:47,752 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:41:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269848310] [2025-01-09 20:41:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269848310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414636298] [2025-01-09 20:41:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:47,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:47,756 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:41:47,759 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:41:48,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:41:48,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:41:48,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:48,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:48,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:41:48,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:48,293 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:41:48,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414636298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:48,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:48,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:41:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141458409] [2025-01-09 20:41:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:48,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:48,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:48,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:48,295 INFO L87 Difference]: Start difference. First operand 448 states and 577 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:48,562 INFO L93 Difference]: Finished difference Result 830 states and 1077 transitions. [2025-01-09 20:41:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:41:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-01-09 20:41:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:48,565 INFO L225 Difference]: With dead ends: 830 [2025-01-09 20:41:48,565 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 20:41:48,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:41:48,566 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:41:48,566 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:41:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 20:41:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 452. [2025-01-09 20:41:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.2863534675615214) internal successors, (575), 447 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 581 transitions. [2025-01-09 20:41:48,584 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 581 transitions. Word has length 174 [2025-01-09 20:41:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 581 transitions. [2025-01-09 20:41:48,585 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:41:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 581 transitions. [2025-01-09 20:41:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 20:41:48,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:48,587 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:48,598 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:41:48,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 20:41:48,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1963102348, now seen corresponding path program 1 times [2025-01-09 20:41:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477124605] [2025-01-09 20:41:48,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:48,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:41:48,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:41:48,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:48,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:49,125 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:41:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:49,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477124605] [2025-01-09 20:41:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477124605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:49,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795806467] [2025-01-09 20:41:49,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:49,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:49,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:49,129 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:41:49,134 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:41:49,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 20:41:49,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 20:41:49,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:49,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:49,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:41:49,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:49,851 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:41:49,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795806467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:49,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:41:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582372532] [2025-01-09 20:41:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:49,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:49,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:49,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:49,856 INFO L87 Difference]: Start difference. First operand 452 states and 581 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:50,218 INFO L93 Difference]: Finished difference Result 579 states and 750 transitions. [2025-01-09 20:41:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:41:50,218 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:41:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:50,221 INFO L225 Difference]: With dead ends: 579 [2025-01-09 20:41:50,222 INFO L226 Difference]: Without dead ends: 457 [2025-01-09 20:41:50,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:50,223 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 12 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:50,223 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.3s Time] [2025-01-09 20:41:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-09 20:41:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 452. [2025-01-09 20:41:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 1.2863534675615214) internal successors, (575), 447 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 581 transitions. [2025-01-09 20:41:50,239 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 581 transitions. Word has length 174 [2025-01-09 20:41:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:50,240 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 581 transitions. [2025-01-09 20:41:50,240 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:41:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 581 transitions. [2025-01-09 20:41:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 20:41:50,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:50,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:50,253 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:41:50,442 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:41:50,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:50,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2121721130, now seen corresponding path program 1 times [2025-01-09 20:41:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241435020] [2025-01-09 20:41:50,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:50,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:41:50,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:41:50,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:50,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:50,859 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:41:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241435020] [2025-01-09 20:41:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241435020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:50,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:50,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:41:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067486519] [2025-01-09 20:41:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:50,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:41:50,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:50,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:41:50,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:50,862 INFO L87 Difference]: Start difference. First operand 452 states and 581 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:51,166 INFO L93 Difference]: Finished difference Result 584 states and 756 transitions. [2025-01-09 20:41:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:41:51,167 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:41:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:51,169 INFO L225 Difference]: With dead ends: 584 [2025-01-09 20:41:51,169 INFO L226 Difference]: Without dead ends: 462 [2025-01-09 20:41:51,169 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:41:51,170 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 20 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:51,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2036 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:41:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-09 20:41:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2025-01-09 20:41:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 454 states have (on average 1.2863436123348018) internal successors, (584), 454 states have internal predecessors, (584), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 590 transitions. [2025-01-09 20:41:51,185 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 590 transitions. Word has length 175 [2025-01-09 20:41:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:51,185 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 590 transitions. [2025-01-09 20:41:51,185 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:41:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 590 transitions. [2025-01-09 20:41:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 20:41:51,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:51,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:51,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:41:51,187 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -748261178, now seen corresponding path program 1 times [2025-01-09 20:41:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174183957] [2025-01-09 20:41:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:41:51,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:41:51,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:51,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:51,495 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:41:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174183957] [2025-01-09 20:41:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174183957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913514192] [2025-01-09 20:41:51,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:51,498 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:41:51,500 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:41:51,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:41:51,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:41:51,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:51,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:51,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 20:41:51,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:52,048 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:41:52,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913514192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:52,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:41:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276303557] [2025-01-09 20:41:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:52,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:52,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:52,051 INFO L87 Difference]: Start difference. First operand 459 states and 590 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:52,309 INFO L93 Difference]: Finished difference Result 593 states and 768 transitions. [2025-01-09 20:41:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:41:52,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-01-09 20:41:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:52,312 INFO L225 Difference]: With dead ends: 593 [2025-01-09 20:41:52,312 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 20:41:52,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:52,313 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 17 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:52,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1699 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:41:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 20:41:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2025-01-09 20:41:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.2850877192982457) internal successors, (586), 456 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 592 transitions. [2025-01-09 20:41:52,333 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 592 transitions. Word has length 175 [2025-01-09 20:41:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:52,334 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 592 transitions. [2025-01-09 20:41:52,334 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:41:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 592 transitions. [2025-01-09 20:41:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:41:52,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:52,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:52,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 20:41:52,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:52,540 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:52,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1887449092, now seen corresponding path program 1 times [2025-01-09 20:41:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007638252] [2025-01-09 20:41:52,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:52,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:41:52,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:41:52,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:52,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:52,982 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:41:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:52,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007638252] [2025-01-09 20:41:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007638252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:52,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:52,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:41:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332517829] [2025-01-09 20:41:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:41:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:52,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:41:52,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:41:52,985 INFO L87 Difference]: Start difference. First operand 461 states and 592 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:53,396 INFO L93 Difference]: Finished difference Result 601 states and 778 transitions. [2025-01-09 20:41:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:41:53,396 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:41:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:53,401 INFO L225 Difference]: With dead ends: 601 [2025-01-09 20:41:53,401 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 20:41:53,401 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:41:53,403 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:53,403 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.4s Time] [2025-01-09 20:41:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 20:41:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 464. [2025-01-09 20:41:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 459 states have (on average 1.2832244008714597) internal successors, (589), 459 states have internal predecessors, (589), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2025-01-09 20:41:53,419 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 176 [2025-01-09 20:41:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:53,419 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2025-01-09 20:41:53,419 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:41:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2025-01-09 20:41:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 20:41:53,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:53,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:53,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:41:53,421 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:53,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash -662587424, now seen corresponding path program 1 times [2025-01-09 20:41:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:53,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544877843] [2025-01-09 20:41:53,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:53,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:41:53,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:41:53,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:53,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:53,770 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:41:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544877843] [2025-01-09 20:41:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544877843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326611559] [2025-01-09 20:41:53,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:53,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:53,773 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:41:53,775 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:41:54,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 20:41:54,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 20:41:54,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:54,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:54,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 20:41:54,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:54,455 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:41:54,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326611559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:41:54,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779879985] [2025-01-09 20:41:54,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:54,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:41:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:54,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:41:54,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:54,457 INFO L87 Difference]: Start difference. First operand 464 states and 595 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:54,916 INFO L93 Difference]: Finished difference Result 861 states and 1115 transitions. [2025-01-09 20:41:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:41:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-01-09 20:41:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:54,919 INFO L225 Difference]: With dead ends: 861 [2025-01-09 20:41:54,919 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 20:41:54,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:41:54,920 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 10 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:54,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1692 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:41:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 20:41:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 464. [2025-01-09 20:41:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 459 states have (on average 1.2832244008714597) internal successors, (589), 459 states have internal predecessors, (589), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:41:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2025-01-09 20:41:54,934 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 176 [2025-01-09 20:41:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:54,935 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2025-01-09 20:41:54,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:41:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2025-01-09 20:41:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:41:54,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:54,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:41:54,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 20:41:55,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:55,137 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash 600471085, now seen corresponding path program 1 times [2025-01-09 20:41:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135566466] [2025-01-09 20:41:55,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:41:55,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:41:55,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:55,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:55,456 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:41:55,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135566466] [2025-01-09 20:41:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135566466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:41:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185298323] [2025-01-09 20:41:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:41:55,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:55,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:41:55,459 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:41:55,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 20:41:55,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:41:55,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:41:55,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:41:55,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:55,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 20:41:55,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:41:58,132 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:41:58,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:41:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185298323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:58,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:41:58,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-09 20:41:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351996077] [2025-01-09 20:41:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:58,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:41:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:58,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:41:58,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:41:58,152 INFO L87 Difference]: Start difference. First operand 464 states and 595 transitions. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:42:02,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:42:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:02,363 INFO L93 Difference]: Finished difference Result 618 states and 799 transitions. [2025-01-09 20:42:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 20:42:02,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 177 [2025-01-09 20:42:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:02,365 INFO L225 Difference]: With dead ends: 618 [2025-01-09 20:42:02,365 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 20:42:02,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:42:02,366 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 22 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:02,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2808 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 20:42:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 20:42:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 477. [2025-01-09 20:42:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.2838983050847457) internal successors, (606), 472 states have internal predecessors, (606), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 20:42:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 612 transitions. [2025-01-09 20:42:02,383 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 612 transitions. Word has length 177 [2025-01-09 20:42:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:02,383 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 612 transitions. [2025-01-09 20:42:02,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:42:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 612 transitions. [2025-01-09 20:42:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:42:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:02,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:02,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 20:42:02,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 20:42:02,589 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:02,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 469172916, now seen corresponding path program 1 times [2025-01-09 20:42:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021418473] [2025-01-09 20:42:02,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:02,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:42:02,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:42:02,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:02,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:02,955 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:42:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021418473] [2025-01-09 20:42:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021418473] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800542842] [2025-01-09 20:42:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:02,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:02,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:42:02,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 20:42:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:42:03,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:42:03,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:03,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:03,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 20:42:03,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:42:03,476 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:42:03,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:42:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800542842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:42:03,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:42:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 20:42:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976960558] [2025-01-09 20:42:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:42:03,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:42:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:42:03,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:42:03,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:42:03,480 INFO L87 Difference]: Start difference. First operand 477 states and 612 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 20:42:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:42:03,514 INFO L93 Difference]: Finished difference Result 840 states and 1080 transitions. [2025-01-09 20:42:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:42:03,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 177 [2025-01-09 20:42:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:42:03,520 INFO L225 Difference]: With dead ends: 840 [2025-01-09 20:42:03,521 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 20:42:03,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:42:03,522 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:42:03,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1049 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:42:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 20:42:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-01-09 20:42:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 474 states have (on average 1.2848101265822784) internal successors, (609), 475 states have internal predecessors, (609), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 20:42:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 616 transitions. [2025-01-09 20:42:03,549 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 616 transitions. Word has length 177 [2025-01-09 20:42:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:42:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 616 transitions. [2025-01-09 20:42:03,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 20:42:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 616 transitions. [2025-01-09 20:42:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 20:42:03,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:42:03,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:42:03,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 20:42:03,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 20:42:03,753 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:42:03,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:42:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1427036562, now seen corresponding path program 1 times [2025-01-09 20:42:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:42:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679982671] [2025-01-09 20:42:03,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:42:03,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 20:42:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 20:42:03,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:03,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:04,107 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:42:04,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:42:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679982671] [2025-01-09 20:42:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679982671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:42:04,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144745336] [2025-01-09 20:42:04,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:42:04,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:42:04,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:42:04,110 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:42:04,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 20:42:04,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 20:42:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 20:42:04,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:42:04,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:42:04,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-01-09 20:42:04,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:42:04,774 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:42:04,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 20:42:04,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 20:42:05,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 20:42:05,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 20:42:05,214 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-09 20:42:05,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-01-09 20:42:05,222 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:42:05,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 20:42:05,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 20:42:05,413 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 20:42:05,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 20:42:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11