./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:47:01,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:47:01,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:47:01,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:47:01,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:47:01,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:47:01,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:47:01,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:47:01,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:47:01,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:47:01,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:47:01,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:47:01,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:47:01,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:47:01,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:47:01,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:47:01,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:47:01,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:47:01,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:47:01,707 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2025-02-06 08:47:01,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:47:01,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:47:01,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:47:01,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:47:01,931 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:47:01,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2025-02-06 08:47:03,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6c0c91d3/8bb2cdccadd04c52a1f5ae93cf273805/FLAGb27b0baa9 [2025-02-06 08:47:03,443 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:47:03,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2025-02-06 08:47:03,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6c0c91d3/8bb2cdccadd04c52a1f5ae93cf273805/FLAGb27b0baa9 [2025-02-06 08:47:03,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6c0c91d3/8bb2cdccadd04c52a1f5ae93cf273805 [2025-02-06 08:47:03,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:47:03,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:47:03,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:47:03,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:47:03,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:47:03,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:03,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d90d842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03, skipping insertion in model container [2025-02-06 08:47:03,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:03,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:47:03,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i[33519,33532] [2025-02-06 08:47:03,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:47:03,811 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:47:03,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i[33519,33532] [2025-02-06 08:47:03,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:47:03,928 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:47:03,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03 WrapperNode [2025-02-06 08:47:03,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:47:03,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:47:03,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:47:03,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:47:03,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:03,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,003 INFO L138 Inliner]: procedures = 177, calls = 324, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1545 [2025-02-06 08:47:04,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:47:04,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:47:04,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:47:04,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:47:04,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,108 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-02-06 08:47:04,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:47:04,182 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:47:04,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:47:04,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:47:04,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (1/1) ... [2025-02-06 08:47:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:47:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:47:04,210 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-02-06 08:47:04,221 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-02-06 08:47:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:47:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:47:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:47:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:47:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:47:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:47:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:47:04,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:47:04,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:47:04,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:47:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:47:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:47:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:47:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:47:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:47:04,531 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:47:04,536 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:47:05,818 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:47:05,895 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-02-06 08:47:05,895 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:47:05,959 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:47:05,959 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:47:05,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:47:05 BoogieIcfgContainer [2025-02-06 08:47:05,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:47:05,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:47:05,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:47:05,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:47:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:47:03" (1/3) ... [2025-02-06 08:47:05,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159c5a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:47:05, skipping insertion in model container [2025-02-06 08:47:05,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:47:03" (2/3) ... [2025-02-06 08:47:05,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159c5a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:47:05, skipping insertion in model container [2025-02-06 08:47:05,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:47:05" (3/3) ... [2025-02-06 08:47:05,965 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test3-2.i [2025-02-06 08:47:05,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:47:05,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test3-2.i that has 5 procedures, 438 locations, 1 initial locations, 43 loop locations, and 1 error locations. [2025-02-06 08:47:06,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:47:06,018 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;@3175e20b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:47:06,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:47:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 430 states, 421 states have (on average 1.6175771971496438) internal successors, (681), 423 states have internal predecessors, (681), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 08:47:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 08:47:06,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:06,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:47:06,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:06,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1408781482, now seen corresponding path program 1 times [2025-02-06 08:47:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:06,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130020842] [2025-02-06 08:47:06,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:06,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 08:47:06,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 08:47:06,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:06,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:47:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130020842] [2025-02-06 08:47:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130020842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:06,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:47:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806841832] [2025-02-06 08:47:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:06,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:47:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:06,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:47:06,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:47:06,180 INFO L87 Difference]: Start difference. First operand has 430 states, 421 states have (on average 1.6175771971496438) internal successors, (681), 423 states have internal predecessors, (681), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:06,297 INFO L93 Difference]: Finished difference Result 857 states and 1380 transitions. [2025-02-06 08:47:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:47:06,299 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 08:47:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:06,308 INFO L225 Difference]: With dead ends: 857 [2025-02-06 08:47:06,308 INFO L226 Difference]: Without dead ends: 394 [2025-02-06 08:47:06,311 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-02-06 08:47:06,315 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:06,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:47:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-06 08:47:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-02-06 08:47:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 386 states have (on average 1.450777202072539) internal successors, (560), 387 states have internal predecessors, (560), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 08:47:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 570 transitions. [2025-02-06 08:47:06,372 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 570 transitions. Word has length 12 [2025-02-06 08:47:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:06,372 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 570 transitions. [2025-02-06 08:47:06,372 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 570 transitions. [2025-02-06 08:47:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 08:47:06,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:06,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:47:06,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:47:06,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1218761800, now seen corresponding path program 1 times [2025-02-06 08:47:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139580643] [2025-02-06 08:47:06,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:06,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 08:47:06,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 08:47:06,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:06,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:47:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139580643] [2025-02-06 08:47:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139580643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:06,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:47:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444416200] [2025-02-06 08:47:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:06,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:47:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:06,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:47:06,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:47:06,573 INFO L87 Difference]: Start difference. First operand 394 states and 570 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:06,991 INFO L93 Difference]: Finished difference Result 1079 states and 1579 transitions. [2025-02-06 08:47:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:47:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 08:47:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:06,995 INFO L225 Difference]: With dead ends: 1079 [2025-02-06 08:47:06,995 INFO L226 Difference]: Without dead ends: 686 [2025-02-06 08:47:06,996 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-02-06 08:47:06,996 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 429 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:06,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1504 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:47:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-06 08:47:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 685. [2025-02-06 08:47:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 676 states have (on average 1.470414201183432) internal successors, (994), 678 states have internal predecessors, (994), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1006 transitions. [2025-02-06 08:47:07,018 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1006 transitions. Word has length 14 [2025-02-06 08:47:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1006 transitions. [2025-02-06 08:47:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1006 transitions. [2025-02-06 08:47:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:47:07,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:07,020 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, 1, 1] [2025-02-06 08:47:07,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:47:07,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:07,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1265286902, now seen corresponding path program 1 times [2025-02-06 08:47:07,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:07,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791346524] [2025-02-06 08:47:07,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:07,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:47:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:47:07,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:07,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:47:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791346524] [2025-02-06 08:47:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791346524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:07,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:47:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777465402] [2025-02-06 08:47:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:07,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:47:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:07,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:47:07,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:47:07,224 INFO L87 Difference]: Start difference. First operand 685 states and 1006 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:07,384 INFO L93 Difference]: Finished difference Result 954 states and 1393 transitions. [2025-02-06 08:47:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:47:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:47:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:07,387 INFO L225 Difference]: With dead ends: 954 [2025-02-06 08:47:07,387 INFO L226 Difference]: Without dead ends: 601 [2025-02-06 08:47:07,388 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-02-06 08:47:07,388 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 33 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:07,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1286 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:47:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-06 08:47:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-02-06 08:47:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 592 states have (on average 1.4189189189189189) internal successors, (840), 594 states have internal predecessors, (840), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 852 transitions. [2025-02-06 08:47:07,405 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 852 transitions. Word has length 67 [2025-02-06 08:47:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:07,406 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 852 transitions. [2025-02-06 08:47:07,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 852 transitions. [2025-02-06 08:47:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:47:07,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:07,408 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, 1, 1] [2025-02-06 08:47:07,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:47:07,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:07,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash 504752723, now seen corresponding path program 1 times [2025-02-06 08:47:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:07,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655089400] [2025-02-06 08:47:07,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:07,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:47:07,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:47:07,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:07,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:47:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655089400] [2025-02-06 08:47:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655089400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:47:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37512931] [2025-02-06 08:47:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:47:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:47:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:47:07,510 INFO L87 Difference]: Start difference. First operand 601 states and 852 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:07,602 INFO L93 Difference]: Finished difference Result 870 states and 1217 transitions. [2025-02-06 08:47:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:47:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:47:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:07,605 INFO L225 Difference]: With dead ends: 870 [2025-02-06 08:47:07,605 INFO L226 Difference]: Without dead ends: 601 [2025-02-06 08:47:07,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 08:47:07,606 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 2 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:07,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 874 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:47:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-06 08:47:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-02-06 08:47:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 592 states have (on average 1.4087837837837838) internal successors, (834), 594 states have internal predecessors, (834), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 846 transitions. [2025-02-06 08:47:07,647 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 846 transitions. Word has length 67 [2025-02-06 08:47:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:07,647 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 846 transitions. [2025-02-06 08:47:07,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 846 transitions. [2025-02-06 08:47:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:47:07,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:07,652 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, 1, 1] [2025-02-06 08:47:07,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:47:07,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:07,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash -627810352, now seen corresponding path program 1 times [2025-02-06 08:47:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888631273] [2025-02-06 08:47:07,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:07,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:47:07,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:47:07,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:07,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:47:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888631273] [2025-02-06 08:47:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888631273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:08,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:08,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:47:08,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517788484] [2025-02-06 08:47:08,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:08,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:47:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:08,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:47:08,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:47:08,094 INFO L87 Difference]: Start difference. First operand 601 states and 846 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:08,327 INFO L93 Difference]: Finished difference Result 1110 states and 1528 transitions. [2025-02-06 08:47:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:47:08,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:47:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:08,331 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 08:47:08,332 INFO L226 Difference]: Without dead ends: 838 [2025-02-06 08:47:08,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:47:08,334 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 459 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:08,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2182 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:47:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-02-06 08:47:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 600. [2025-02-06 08:47:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 591 states have (on average 1.4077834179357023) internal successors, (832), 593 states have internal predecessors, (832), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 844 transitions. [2025-02-06 08:47:08,357 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 844 transitions. Word has length 67 [2025-02-06 08:47:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:08,360 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 844 transitions. [2025-02-06 08:47:08,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:47:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 844 transitions. [2025-02-06 08:47:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:47:08,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:08,365 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] [2025-02-06 08:47:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:47:08,365 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:08,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1139928815, now seen corresponding path program 1 times [2025-02-06 08:47:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969541243] [2025-02-06 08:47:08,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:08,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:47:08,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:47:08,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:08,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:47:08,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969541243] [2025-02-06 08:47:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969541243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:08,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:47:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782979042] [2025-02-06 08:47:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:08,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:47:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:08,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:47:08,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:47:08,573 INFO L87 Difference]: Start difference. First operand 600 states and 844 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:08,681 INFO L93 Difference]: Finished difference Result 1146 states and 1605 transitions. [2025-02-06 08:47:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:47:08,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:47:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:08,684 INFO L225 Difference]: With dead ends: 1146 [2025-02-06 08:47:08,684 INFO L226 Difference]: Without dead ends: 606 [2025-02-06 08:47:08,684 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-02-06 08:47:08,685 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 105 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:08,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1197 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:47:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-02-06 08:47:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 600. [2025-02-06 08:47:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 591 states have (on average 1.3840947546531304) internal successors, (818), 593 states have internal predecessors, (818), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 830 transitions. [2025-02-06 08:47:08,705 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 830 transitions. Word has length 104 [2025-02-06 08:47:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:08,706 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 830 transitions. [2025-02-06 08:47:08,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 830 transitions. [2025-02-06 08:47:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 08:47:08,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:08,707 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] [2025-02-06 08:47:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:47:08,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -11245096, now seen corresponding path program 1 times [2025-02-06 08:47:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452502574] [2025-02-06 08:47:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:08,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:47:08,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:47:08,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:08,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:47:09,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452502574] [2025-02-06 08:47:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452502574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564773536] [2025-02-06 08:47:09,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:47:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:47:09,207 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-02-06 08:47:09,210 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-02-06 08:47:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 08:47:09,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 08:47:09,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:09,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:09,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 08:47:09,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:47:09,496 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-02-06 08:47:09,519 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-02-06 08:47:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:47:10,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:47:10,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564773536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:10,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:47:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 08:47:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244937448] [2025-02-06 08:47:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:47:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:10,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:47:10,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:47:10,214 INFO L87 Difference]: Start difference. First operand 600 states and 830 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:12,063 INFO L93 Difference]: Finished difference Result 1400 states and 1922 transitions. [2025-02-06 08:47:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:47:12,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 08:47:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:12,066 INFO L225 Difference]: With dead ends: 1400 [2025-02-06 08:47:12,066 INFO L226 Difference]: Without dead ends: 886 [2025-02-06 08:47:12,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:47:12,075 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 726 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:12,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 2605 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 08:47:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-06 08:47:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 625. [2025-02-06 08:47:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 616 states have (on average 1.3766233766233766) internal successors, (848), 618 states have internal predecessors, (848), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 860 transitions. [2025-02-06 08:47:12,107 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 860 transitions. Word has length 104 [2025-02-06 08:47:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:12,110 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 860 transitions. [2025-02-06 08:47:12,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 860 transitions. [2025-02-06 08:47:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 08:47:12,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:12,112 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] [2025-02-06 08:47:12,129 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-02-06 08:47:12,312 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-02-06 08:47:12,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1928587686, now seen corresponding path program 1 times [2025-02-06 08:47:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251282586] [2025-02-06 08:47:12,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:12,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:47:12,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:47:12,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:12,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:47:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251282586] [2025-02-06 08:47:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251282586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673298266] [2025-02-06 08:47:12,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:47:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:47:12,813 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-02-06 08:47:12,817 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-02-06 08:47:12,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 08:47:13,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 08:47:13,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:13,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:13,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 08:47:13,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:47:13,088 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-02-06 08:47:13,094 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 7 treesize of output 3 [2025-02-06 08:47:13,255 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-02-06 08:47:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:47:13,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:47:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:47:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673298266] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 08:47:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 11 [2025-02-06 08:47:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458094941] [2025-02-06 08:47:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:47:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:13,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:47:13,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:47:13,493 INFO L87 Difference]: Start difference. First operand 625 states and 860 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:13,650 INFO L93 Difference]: Finished difference Result 808 states and 1105 transitions. [2025-02-06 08:47:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:47:13,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-02-06 08:47:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:13,653 INFO L225 Difference]: With dead ends: 808 [2025-02-06 08:47:13,653 INFO L226 Difference]: Without dead ends: 798 [2025-02-06 08:47:13,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:47:13,658 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 556 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:13,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1294 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:47:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-06 08:47:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 627. [2025-02-06 08:47:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 618 states have (on average 1.3754045307443366) internal successors, (850), 620 states have internal predecessors, (850), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 08:47:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 862 transitions. [2025-02-06 08:47:13,674 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 862 transitions. Word has length 105 [2025-02-06 08:47:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:13,674 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 862 transitions. [2025-02-06 08:47:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 862 transitions. [2025-02-06 08:47:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 08:47:13,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:13,676 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] [2025-02-06 08:47:13,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 08:47:13,876 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-02-06 08:47:13,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:13,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -618600142, now seen corresponding path program 1 times [2025-02-06 08:47:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:13,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832183544] [2025-02-06 08:47:13,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:13,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 08:47:13,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 08:47:13,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:13,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:47:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832183544] [2025-02-06 08:47:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832183544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:47:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309277976] [2025-02-06 08:47:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:47:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:14,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:47:14,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:47:14,039 INFO L87 Difference]: Start difference. First operand 627 states and 862 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:14,367 INFO L93 Difference]: Finished difference Result 1243 states and 1701 transitions. [2025-02-06 08:47:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:47:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 158 [2025-02-06 08:47:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:14,370 INFO L225 Difference]: With dead ends: 1243 [2025-02-06 08:47:14,370 INFO L226 Difference]: Without dead ends: 774 [2025-02-06 08:47:14,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-06 08:47:14,372 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 951 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:14,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 937 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:47:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-02-06 08:47:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 766. [2025-02-06 08:47:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 756 states have (on average 1.369047619047619) internal successors, (1035), 759 states have internal predecessors, (1035), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 08:47:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1049 transitions. [2025-02-06 08:47:14,391 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1049 transitions. Word has length 158 [2025-02-06 08:47:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1049 transitions. [2025-02-06 08:47:14,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1049 transitions. [2025-02-06 08:47:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 08:47:14,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:14,394 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-02-06 08:47:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:47:14,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash 482287744, now seen corresponding path program 1 times [2025-02-06 08:47:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736179689] [2025-02-06 08:47:14,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:14,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:47:14,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:47:14,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:14,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:47:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736179689] [2025-02-06 08:47:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736179689] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226319439] [2025-02-06 08:47:14,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:14,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:47:14,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:47:14,718 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-02-06 08:47:14,720 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-02-06 08:47:14,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:47:15,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:47:15,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:15,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:15,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 08:47:15,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:47:15,046 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-02-06 08:47:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:47:15,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:47:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226319439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:47:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-06 08:47:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758136334] [2025-02-06 08:47:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:15,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:47:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:15,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:47:15,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:47:15,554 INFO L87 Difference]: Start difference. First operand 766 states and 1049 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:16,334 INFO L93 Difference]: Finished difference Result 1392 states and 1886 transitions. [2025-02-06 08:47:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:47:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-06 08:47:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:16,341 INFO L225 Difference]: With dead ends: 1392 [2025-02-06 08:47:16,344 INFO L226 Difference]: Without dead ends: 984 [2025-02-06 08:47:16,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-06 08:47:16,346 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 452 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:16,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 2917 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:47:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-02-06 08:47:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 800. [2025-02-06 08:47:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 790 states have (on average 1.3544303797468353) internal successors, (1070), 793 states have internal predecessors, (1070), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 08:47:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1084 transitions. [2025-02-06 08:47:16,372 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1084 transitions. Word has length 168 [2025-02-06 08:47:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:16,372 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1084 transitions. [2025-02-06 08:47:16,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1084 transitions. [2025-02-06 08:47:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:47:16,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:16,374 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-02-06 08:47:16,382 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-02-06 08:47:16,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:47:16,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:16,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash 463859314, now seen corresponding path program 1 times [2025-02-06 08:47:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:16,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658802539] [2025-02-06 08:47:16,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:16,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:47:16,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:47:16,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:16,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:47:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658802539] [2025-02-06 08:47:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658802539] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375676702] [2025-02-06 08:47:16,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:16,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:47:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:47:16,917 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-02-06 08:47:16,919 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-02-06 08:47:17,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:47:17,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:47:17,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:17,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 08:47:17,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:47:17,268 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-02-06 08:47:17,278 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 7 treesize of output 3 [2025-02-06 08:47:17,282 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-02-06 08:47:17,372 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-02-06 08:47:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:47:21,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:47:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:47:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375676702] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 08:47:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 15] total 28 [2025-02-06 08:47:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244381253] [2025-02-06 08:47:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:47:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:26,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:47:26,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-02-06 08:47:26,920 INFO L87 Difference]: Start difference. First operand 800 states and 1084 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:33,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 08:47:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:41,158 INFO L93 Difference]: Finished difference Result 1564 states and 2132 transitions. [2025-02-06 08:47:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 08:47:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-02-06 08:47:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:41,166 INFO L225 Difference]: With dead ends: 1564 [2025-02-06 08:47:41,167 INFO L226 Difference]: Without dead ends: 1156 [2025-02-06 08:47:41,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 08:47:41,169 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 648 mSDsluCounter, 3877 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 4364 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:41,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 4364 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1284 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-02-06 08:47:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-02-06 08:47:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 816. [2025-02-06 08:47:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 806 states have (on average 1.3523573200992556) internal successors, (1090), 809 states have internal predecessors, (1090), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 08:47:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1104 transitions. [2025-02-06 08:47:41,200 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1104 transitions. Word has length 169 [2025-02-06 08:47:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:41,201 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1104 transitions. [2025-02-06 08:47:41,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:41,201 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1104 transitions. [2025-02-06 08:47:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:47:41,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:41,202 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-02-06 08:47:41,212 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-02-06 08:47:41,403 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,SelfDestructingSolverStorable10 [2025-02-06 08:47:41,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:41,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 778722926, now seen corresponding path program 1 times [2025-02-06 08:47:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68155842] [2025-02-06 08:47:41,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:41,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:47:41,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:47:41,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:41,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:47:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:41,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68155842] [2025-02-06 08:47:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68155842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:47:41,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:47:41,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:47:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867939891] [2025-02-06 08:47:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:47:41,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:47:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:47:41,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:47:41,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:47:41,556 INFO L87 Difference]: Start difference. First operand 816 states and 1104 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:47:41,655 INFO L93 Difference]: Finished difference Result 1218 states and 1648 transitions. [2025-02-06 08:47:41,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:47:41,655 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-02-06 08:47:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:47:41,659 INFO L225 Difference]: With dead ends: 1218 [2025-02-06 08:47:41,659 INFO L226 Difference]: Without dead ends: 789 [2025-02-06 08:47:41,660 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-02-06 08:47:41,660 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 9 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:47:41,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1265 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:47:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-06 08:47:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-02-06 08:47:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 779 states have (on average 1.3594351732991015) internal successors, (1059), 782 states have internal predecessors, (1059), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 08:47:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1073 transitions. [2025-02-06 08:47:41,686 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1073 transitions. Word has length 169 [2025-02-06 08:47:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:47:41,686 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1073 transitions. [2025-02-06 08:47:41,687 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:47:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1073 transitions. [2025-02-06 08:47:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 08:47:41,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:47:41,688 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-02-06 08:47:41,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:47:41,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:47:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:47:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2110338638, now seen corresponding path program 1 times [2025-02-06 08:47:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:47:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518807919] [2025-02-06 08:47:41,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:47:41,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 08:47:41,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 08:47:41,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:41,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 08:47:42,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:47:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518807919] [2025-02-06 08:47:42,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518807919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:47:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259706833] [2025-02-06 08:47:42,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:47:42,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:47:42,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:47:42,060 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-02-06 08:47:42,061 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-02-06 08:47:42,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 08:47:42,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 08:47:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:47:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:47:42,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 08:47:42,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:48:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:48:15,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:48:15,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259706833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:15,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:48:15,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2025-02-06 08:48:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153417298] [2025-02-06 08:48:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:15,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:48:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:15,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:48:15,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=168, Unknown=9, NotChecked=0, Total=210 [2025-02-06 08:48:15,581 INFO L87 Difference]: Start difference. First operand 789 states and 1073 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:48:19,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:48:21,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:48:25,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:48:29,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:48:31,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:48:35,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 08:48:37,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]