./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:05:41,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:05:41,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:05:41,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:05:41,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:05:41,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:05:41,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:05:41,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:05:41,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:05:41,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:05:41,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:05:41,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:05:41,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:05:41,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:05:41,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:05:41,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:05:41,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:05:41,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:05:41,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:05:41,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:05:41,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:05:41,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:05:41,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:05:41,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:05:41,427 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/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 -> 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 [2025-03-04 06:05:41,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:05:41,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:05:41,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:05:41,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:05:41,697 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:05:41,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-04 06:05:42,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5c6685d/6faebaddc8fd40c5b402632de91b21cb/FLAG69daf3281 [2025-03-04 06:05:43,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:05:43,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2025-03-04 06:05:43,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5c6685d/6faebaddc8fd40c5b402632de91b21cb/FLAG69daf3281 [2025-03-04 06:05:43,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d5c6685d/6faebaddc8fd40c5b402632de91b21cb [2025-03-04 06:05:43,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:05:43,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:05:43,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:05:43,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:05:43,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:05:43,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:05:43" (1/1) ... [2025-03-04 06:05:43,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:43, skipping insertion in model container [2025-03-04 06:05:43,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:05:43" (1/1) ... [2025-03-04 06:05:43,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:05:43,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[33021,33034] [2025-03-04 06:05:43,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[84583,84596] [2025-03-04 06:05:43,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:05:43,972 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:05:43,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[33021,33034] [2025-03-04 06:05:44,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i[84583,84596] [2025-03-04 06:05:44,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:05:44,115 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:05:44,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44 WrapperNode [2025-03-04 06:05:44,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:05:44,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:05:44,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:05:44,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:05:44,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,236 INFO L138 Inliner]: procedures = 177, calls = 722, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-03-04 06:05:44,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:05:44,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:05:44,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:05:44,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:05:44,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,346 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-04 06:05:44,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,384 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:05:44,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:05:44,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:05:44,416 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:05:44,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (1/1) ... [2025-03-04 06:05:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:05:44,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:44,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:05:44,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:05:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:05:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:05:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:05:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:05:44,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:05:44,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:05:44,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:05:44,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:05:44,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:05:44,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:05:44,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:05:44,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:05:44,644 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:05:44,645 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:05:46,874 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-03-04 06:05:47,065 INFO L? ?]: Removed 797 outVars from TransFormulas that were not future-live. [2025-03-04 06:05:47,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:05:47,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:05:47,147 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:05:47,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:05:47 BoogieIcfgContainer [2025-03-04 06:05:47,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:05:47,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:05:47,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:05:47,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:05:47,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:05:43" (1/3) ... [2025-03-04 06:05:47,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d49779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:05:47, skipping insertion in model container [2025-03-04 06:05:47,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:44" (2/3) ... [2025-03-04 06:05:47,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d49779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:05:47, skipping insertion in model container [2025-03-04 06:05:47,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:05:47" (3/3) ... [2025-03-04 06:05:47,156 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-1.i [2025-03-04 06:05:47,168 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:05:47,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-1.i that has 5 procedures, 1374 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-04 06:05:47,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:05:47,263 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;@2c1f4f8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:05:47,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:05:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 1366 states, 858 states have (on average 1.8391608391608392) internal successors, (1578), 1360 states have internal predecessors, (1578), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:05:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 06:05:47,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:47,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:47,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:47,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2075831204, now seen corresponding path program 1 times [2025-03-04 06:05:47,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762207900] [2025-03-04 06:05:47,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:47,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 06:05:47,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 06:05:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:05:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762207900] [2025-03-04 06:05:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762207900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:05:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345995572] [2025-03-04 06:05:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:47,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:05:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:47,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:05:47,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:05:47,459 INFO L87 Difference]: Start difference. First operand has 1366 states, 858 states have (on average 1.8391608391608392) internal successors, (1578), 1360 states have internal predecessors, (1578), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:47,678 INFO L93 Difference]: Finished difference Result 2730 states and 5666 transitions. [2025-03-04 06:05:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:05:47,680 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 06:05:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:47,718 INFO L225 Difference]: With dead ends: 2730 [2025-03-04 06:05:47,718 INFO L226 Difference]: Without dead ends: 1362 [2025-03-04 06:05:47,732 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-03-04 06:05:47,736 INFO L435 NwaCegarLoop]: 2487 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:47,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2487 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-03-04 06:05:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2025-03-04 06:05:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:05:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2524 transitions. [2025-03-04 06:05:48,036 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2524 transitions. Word has length 9 [2025-03-04 06:05:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:48,037 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 2524 transitions. [2025-03-04 06:05:48,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2524 transitions. [2025-03-04 06:05:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 06:05:48,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:48,043 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] [2025-03-04 06:05:48,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:05:48,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:48,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -459533633, now seen corresponding path program 1 times [2025-03-04 06:05:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378681576] [2025-03-04 06:05:48,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:48,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:05:48,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:05:48,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:48,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:05:48,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:48,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378681576] [2025-03-04 06:05:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378681576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:48,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:48,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548266036] [2025-03-04 06:05:48,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:48,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:48,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:48,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:48,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:48,509 INFO L87 Difference]: Start difference. First operand 1362 states and 2524 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:49,380 INFO L93 Difference]: Finished difference Result 3875 states and 7274 transitions. [2025-03-04 06:05:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:05:49,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 06:05:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:49,402 INFO L225 Difference]: With dead ends: 3875 [2025-03-04 06:05:49,402 INFO L226 Difference]: Without dead ends: 2711 [2025-03-04 06:05:49,407 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-03-04 06:05:49,409 INFO L435 NwaCegarLoop]: 2734 mSDtfsCounter, 1503 mSDsluCounter, 4692 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7426 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:49,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7426 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:05:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-04 06:05:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1364. [2025-03-04 06:05:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:05:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-03-04 06:05:49,761 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 62 [2025-03-04 06:05:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:49,761 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-03-04 06:05:49,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-03-04 06:05:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 06:05:49,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:49,765 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:49,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:05:49,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash 96214276, now seen corresponding path program 1 times [2025-03-04 06:05:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597136833] [2025-03-04 06:05:49,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:49,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:05:49,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:05:49,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:49,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:05:50,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:50,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597136833] [2025-03-04 06:05:50,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597136833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:50,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:50,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:50,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079252134] [2025-03-04 06:05:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:50,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:50,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:50,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:50,135 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:50,299 INFO L93 Difference]: Finished difference Result 2682 states and 4982 transitions. [2025-03-04 06:05:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:05:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-04 06:05:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:50,311 INFO L225 Difference]: With dead ends: 2682 [2025-03-04 06:05:50,312 INFO L226 Difference]: Without dead ends: 1322 [2025-03-04 06:05:50,317 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-03-04 06:05:50,318 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 30 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7154 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:50,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7154 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-04 06:05:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2025-03-04 06:05:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:05:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2449 transitions. [2025-03-04 06:05:50,463 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2449 transitions. Word has length 136 [2025-03-04 06:05:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:50,463 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 2449 transitions. [2025-03-04 06:05:50,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2449 transitions. [2025-03-04 06:05:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 06:05:50,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:50,467 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:50,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:05:50,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:50,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1301483958, now seen corresponding path program 1 times [2025-03-04 06:05:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275415729] [2025-03-04 06:05:50,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:50,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:05:50,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:05:50,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:50,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:05:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275415729] [2025-03-04 06:05:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275415729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:05:50,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526446595] [2025-03-04 06:05:50,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:50,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:05:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:50,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:05:50,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:05:50,667 INFO L87 Difference]: Start difference. First operand 1322 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:50,872 INFO L93 Difference]: Finished difference Result 3861 states and 7214 transitions. [2025-03-04 06:05:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:05:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-04 06:05:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:50,897 INFO L225 Difference]: With dead ends: 3861 [2025-03-04 06:05:50,898 INFO L226 Difference]: Without dead ends: 2543 [2025-03-04 06:05:50,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:05:50,905 INFO L435 NwaCegarLoop]: 2844 mSDtfsCounter, 1259 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5239 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:50,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5239 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2025-03-04 06:05:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2541. [2025-03-04 06:05:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 1534 states have (on average 1.7992177314211213) internal successors, (2760), 2535 states have internal predecessors, (2760), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 06:05:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4766 transitions. [2025-03-04 06:05:51,170 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4766 transitions. Word has length 136 [2025-03-04 06:05:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:51,171 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4766 transitions. [2025-03-04 06:05:51,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:05:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4766 transitions. [2025-03-04 06:05:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:05:51,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:51,174 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] [2025-03-04 06:05:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:05:51,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1658897652, now seen corresponding path program 1 times [2025-03-04 06:05:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868993641] [2025-03-04 06:05:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:51,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:05:51,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:05:51,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:51,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:05:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868993641] [2025-03-04 06:05:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868993641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:51,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569290793] [2025-03-04 06:05:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:51,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:51,479 INFO L87 Difference]: Start difference. First operand 2541 states and 4766 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:51,661 INFO L93 Difference]: Finished difference Result 4754 states and 9072 transitions. [2025-03-04 06:05:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:05:51,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-04 06:05:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:51,685 INFO L225 Difference]: With dead ends: 4754 [2025-03-04 06:05:51,686 INFO L226 Difference]: Without dead ends: 2457 [2025-03-04 06:05:51,696 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-03-04 06:05:51,697 INFO L435 NwaCegarLoop]: 2317 mSDtfsCounter, 30 mSDsluCounter, 4615 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6932 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:51,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6932 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2025-03-04 06:05:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2025-03-04 06:05:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1450 states have (on average 1.7972413793103448) internal successors, (2606), 2451 states have internal predecessors, (2606), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 06:05:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 4612 transitions. [2025-03-04 06:05:52,012 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 4612 transitions. Word has length 151 [2025-03-04 06:05:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:52,013 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 4612 transitions. [2025-03-04 06:05:52,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 4612 transitions. [2025-03-04 06:05:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 06:05:52,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:52,015 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] [2025-03-04 06:05:52,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:05:52,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1760246707, now seen corresponding path program 1 times [2025-03-04 06:05:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8718409] [2025-03-04 06:05:52,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 06:05:52,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 06:05:52,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:52,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8718409] [2025-03-04 06:05:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8718409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:52,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:05:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361791566] [2025-03-04 06:05:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:52,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:05:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:52,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:05:52,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:05:52,317 INFO L87 Difference]: Start difference. First operand 2457 states and 4612 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:55,130 INFO L93 Difference]: Finished difference Result 4903 states and 9209 transitions. [2025-03-04 06:05:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:05:55,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 151 [2025-03-04 06:05:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:55,157 INFO L225 Difference]: With dead ends: 4903 [2025-03-04 06:05:55,158 INFO L226 Difference]: Without dead ends: 2535 [2025-03-04 06:05:55,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:05:55,199 INFO L435 NwaCegarLoop]: 2669 mSDtfsCounter, 6038 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6539 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1509 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:55,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6539 Valid, 5075 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1509 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 06:05:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2025-03-04 06:05:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 1365. [2025-03-04 06:05:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 858 states have (on average 1.724941724941725) internal successors, (1480), 1359 states have internal predecessors, (1480), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 06:05:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2486 transitions. [2025-03-04 06:05:55,424 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2486 transitions. Word has length 151 [2025-03-04 06:05:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:55,425 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2486 transitions. [2025-03-04 06:05:55,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2486 transitions. [2025-03-04 06:05:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 06:05:55,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:55,430 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] [2025-03-04 06:05:55,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:05:55,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:55,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1159004385, now seen corresponding path program 1 times [2025-03-04 06:05:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55438836] [2025-03-04 06:05:55,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:55,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:05:55,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:05:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:56,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55438836] [2025-03-04 06:05:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55438836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29751895] [2025-03-04 06:05:56,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:56,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:56,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:56,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:56,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:05:56,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:05:56,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:05:56,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:56,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:56,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:05:56,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:56,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:05:56,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 06:05:56,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:05:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:56,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:05:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:56,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29751895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:05:56,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:05:56,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-04 06:05:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245818216] [2025-03-04 06:05:56,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:05:56,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:05:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:56,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:05:56,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:05:56,778 INFO L87 Difference]: Start difference. First operand 1365 states and 2486 transitions. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:06:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:06:01,442 INFO L93 Difference]: Finished difference Result 5202 states and 9606 transitions. [2025-03-04 06:06:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:06:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 161 [2025-03-04 06:06:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:06:01,467 INFO L225 Difference]: With dead ends: 5202 [2025-03-04 06:06:01,467 INFO L226 Difference]: Without dead ends: 4080 [2025-03-04 06:06:01,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:06:01,472 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 5965 mSDsluCounter, 9876 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6969 SdHoareTripleChecker+Valid, 11735 SdHoareTripleChecker+Invalid, 5798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:06:01,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6969 Valid, 11735 Invalid, 5798 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1007 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 06:06:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2025-03-04 06:06:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 1705. [2025-03-04 06:06:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1194 states have (on average 1.6164154103852597) internal successors, (1930), 1695 states have internal predecessors, (1930), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-03-04 06:06:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2942 transitions. [2025-03-04 06:06:01,810 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2942 transitions. Word has length 161 [2025-03-04 06:06:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:06:01,811 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2942 transitions. [2025-03-04 06:06:01,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:06:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2942 transitions. [2025-03-04 06:06:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-04 06:06:01,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:06:01,817 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-03-04 06:06:01,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:06:02,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:06:02,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:06:02,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:06:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1174703232, now seen corresponding path program 1 times [2025-03-04 06:06:02,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:06:02,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273524551] [2025-03-04 06:06:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:06:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:06:02,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:06:02,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:06:02,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:06:02,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:06:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:06:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273524551] [2025-03-04 06:06:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273524551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:06:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911358540] [2025-03-04 06:06:04,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:06:04,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:06:04,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:06:04,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:06:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:06:05,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-04 06:06:05,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-04 06:06:05,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:06:05,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:05,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1865 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:06:05,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:06:05,448 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-03-04 06:06:05,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 06:06:05,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:05,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:05,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:05,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:06:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:06:05,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:06:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:06:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911358540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:06:06,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:06:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-03-04 06:06:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929890884] [2025-03-04 06:06:06,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:06:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 06:06:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:06:06,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 06:06:06,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 06:06:06,242 INFO L87 Difference]: Start difference. First operand 1705 states and 2942 transitions. Second operand has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:06:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:06:16,519 INFO L93 Difference]: Finished difference Result 10508 states and 19365 transitions. [2025-03-04 06:06:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:06:16,520 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 383 [2025-03-04 06:06:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:06:16,573 INFO L225 Difference]: With dead ends: 10508 [2025-03-04 06:06:16,573 INFO L226 Difference]: Without dead ends: 9386 [2025-03-04 06:06:16,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 757 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-04 06:06:16,581 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 19925 mSDsluCounter, 18606 mSDsCounter, 0 mSdLazyCounter, 10698 mSolverCounterSat, 3963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22935 SdHoareTripleChecker+Valid, 20465 SdHoareTripleChecker+Invalid, 14661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3963 IncrementalHoareTripleChecker+Valid, 10698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:06:16,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22935 Valid, 20465 Invalid, 14661 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3963 Valid, 10698 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-03-04 06:06:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9386 states. [2025-03-04 06:06:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9386 to 2551. [2025-03-04 06:06:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2034 states have (on average 1.503441494591937) internal successors, (3058), 2535 states have internal predecessors, (3058), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:06:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4082 transitions. [2025-03-04 06:06:17,322 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4082 transitions. Word has length 383 [2025-03-04 06:06:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:06:17,322 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 4082 transitions. [2025-03-04 06:06:17,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:06:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4082 transitions. [2025-03-04 06:06:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2025-03-04 06:06:17,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:06:17,335 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-03-04 06:06:17,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:06:17,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 06:06:17,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:06:17,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:06:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash -373731326, now seen corresponding path program 2 times [2025-03-04 06:06:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:06:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022876229] [2025-03-04 06:06:17,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:06:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:06:17,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 827 statements into 2 equivalence classes. [2025-03-04 06:06:17,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 827 statements. [2025-03-04 06:06:17,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:06:17,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-04 06:06:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:06:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022876229] [2025-03-04 06:06:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022876229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:06:17,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:06:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:06:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363467379] [2025-03-04 06:06:17,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:06:17,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:06:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:06:17,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:06:17,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:06:17,859 INFO L87 Difference]: Start difference. First operand 2551 states and 4082 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:06:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:06:18,252 INFO L93 Difference]: Finished difference Result 3712 states and 6297 transitions. [2025-03-04 06:06:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:06:18,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 827 [2025-03-04 06:06:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:06:18,267 INFO L225 Difference]: With dead ends: 3712 [2025-03-04 06:06:18,267 INFO L226 Difference]: Without dead ends: 2591 [2025-03-04 06:06:18,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:06:18,272 INFO L435 NwaCegarLoop]: 2342 mSDtfsCounter, 80 mSDsluCounter, 9115 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 11457 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:06:18,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 11457 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:06:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-04 06:06:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2553. [2025-03-04 06:06:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2036 states have (on average 1.5029469548133596) internal successors, (3060), 2537 states have internal predecessors, (3060), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:06:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 4084 transitions. [2025-03-04 06:06:18,442 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 4084 transitions. Word has length 827 [2025-03-04 06:06:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:06:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 4084 transitions. [2025-03-04 06:06:18,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:06:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 4084 transitions. [2025-03-04 06:06:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-04 06:06:18,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:06:18,460 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-03-04 06:06:18,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:06:18,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:06:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:06:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1562929929, now seen corresponding path program 1 times [2025-03-04 06:06:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:06:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712663600] [2025-03-04 06:06:18,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:06:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:06:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-04 06:06:18,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-04 06:06:18,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:06:18,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-04 06:06:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:06:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712663600] [2025-03-04 06:06:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712663600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:06:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:06:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:06:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259994593] [2025-03-04 06:06:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:06:20,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:06:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:06:20,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:06:20,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:06:20,458 INFO L87 Difference]: Start difference. First operand 2553 states and 4084 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:06:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:06:20,760 INFO L93 Difference]: Finished difference Result 3681 states and 6253 transitions. [2025-03-04 06:06:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:06:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 828 [2025-03-04 06:06:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:06:20,771 INFO L225 Difference]: With dead ends: 3681 [2025-03-04 06:06:20,771 INFO L226 Difference]: Without dead ends: 2558 [2025-03-04 06:06:20,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:06:20,776 INFO L435 NwaCegarLoop]: 2322 mSDtfsCounter, 14 mSDsluCounter, 9020 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11342 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:06:20,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11342 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:06:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-04 06:06:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2557. [2025-03-04 06:06:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2040 states have (on average 1.5024509803921569) internal successors, (3065), 2541 states have internal predecessors, (3065), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-03-04 06:06:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4089 transitions. [2025-03-04 06:06:21,003 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4089 transitions. Word has length 828 [2025-03-04 06:06:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:06:21,005 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4089 transitions. [2025-03-04 06:06:21,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:06:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4089 transitions. [2025-03-04 06:06:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-04 06:06:21,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:06:21,015 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-03-04 06:06:21,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:06:21,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:06:21,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:06:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -589172944, now seen corresponding path program 1 times [2025-03-04 06:06:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:06:21,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831715353] [2025-03-04 06:06:21,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:06:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:06:21,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-04 06:06:21,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-04 06:06:21,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:06:21,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:06:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:06:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831715353] [2025-03-04 06:06:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831715353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:06:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285388045] [2025-03-04 06:06:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:06:30,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:06:30,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:06:30,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:06:30,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:06:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-04 06:06:31,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-04 06:06:31,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:06:31,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:31,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 4081 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 06:06:31,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:06:31,299 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-03-04 06:06:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 06:06:31,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:31,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:31,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:31,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:31,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:31,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:31,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:32,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:32,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 06:06:32,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 06:06:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:06:32,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:06:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 3332 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:06:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285388045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:06:33,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:06:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-03-04 06:06:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715695709] [2025-03-04 06:06:33,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:06:33,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 06:06:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:06:33,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 06:06:33,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 06:06:33,119 INFO L87 Difference]: Start difference. First operand 2557 states and 4089 transitions. Second operand has 38 states, 38 states have (on average 43.94736842105263) internal successors, (1670), 38 states have internal predecessors, (1670), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 06:07:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:07:02,667 INFO L93 Difference]: Finished difference Result 18974 states and 34673 transitions. [2025-03-04 06:07:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 06:07:02,668 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 43.94736842105263) internal successors, (1670), 38 states have internal predecessors, (1670), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 829 [2025-03-04 06:07:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:07:02,724 INFO L225 Difference]: With dead ends: 18974 [2025-03-04 06:07:02,724 INFO L226 Difference]: Without dead ends: 17846 [2025-03-04 06:07:02,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1698 GetRequests, 1647 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 06:07:02,732 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 37974 mSDsluCounter, 34426 mSDsCounter, 0 mSdLazyCounter, 20678 mSolverCounterSat, 5049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43996 SdHoareTripleChecker+Valid, 36285 SdHoareTripleChecker+Invalid, 25727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5049 IncrementalHoareTripleChecker+Valid, 20678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:07:02,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43996 Valid, 36285 Invalid, 25727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5049 Valid, 20678 Invalid, 0 Unknown, 0 Unchecked, 26.0s Time] [2025-03-04 06:07:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17846 states.