./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.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_SFH_test10-3.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 fa6de94809ad211882523114a33a27b3a82ed66d6bff27089fdf2c6fcaa93aae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:18:41,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:18:41,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:18:41,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:18:41,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:18:41,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:18:41,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:18:41,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:18:41,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:18:41,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:18:41,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:18:41,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:18:41,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:18:41,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:18:41,468 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:18:41,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:18:41,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:18:41,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:18:41,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:18:41,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:18:41,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:18:41,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:18:41,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:18:41,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:18:41,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:18:41,471 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 -> fa6de94809ad211882523114a33a27b3a82ed66d6bff27089fdf2c6fcaa93aae [2025-03-04 06:18:41,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:18:41,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:18:41,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:18:41,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:18:41,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:18:41,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i [2025-03-04 06:18:42,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd73406b/30344f7e1030402b9716fc59a74a040e/FLAG3ba2a5442 [2025-03-04 06:18:43,274 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:18:43,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-3.i [2025-03-04 06:18:43,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd73406b/30344f7e1030402b9716fc59a74a040e/FLAG3ba2a5442 [2025-03-04 06:18:43,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd73406b/30344f7e1030402b9716fc59a74a040e [2025-03-04 06:18:43,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:18:43,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:18:43,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:18:43,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:18:43,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:18:43,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:43,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a0264c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43, skipping insertion in model container [2025-03-04 06:18:43,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:43,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:18:43,593 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_SFH_test10-3.i[33022,33035] [2025-03-04 06:18:43,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:18:43,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:18:43,794 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_SFH_test10-3.i[33022,33035] [2025-03-04 06:18:43,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:18:43,923 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:18:43,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43 WrapperNode [2025-03-04 06:18:43,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:18:43,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:18:43,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:18:43,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:18:43,930 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:18:43" (1/1) ... [2025-03-04 06:18:43,969 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:18:43" (1/1) ... [2025-03-04 06:18:44,097 INFO L138 Inliner]: procedures = 177, calls = 605, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3609 [2025-03-04 06:18:44,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:18:44,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:18:44,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:18:44,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:18:44,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,260 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 106, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 4, 98]. [2025-03-04 06:18:44,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:18:44,397 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:18:44,397 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:18:44,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:18:44,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (1/1) ... [2025-03-04 06:18:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:18:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:44,426 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:18:44,431 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:18:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-04 06:18:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:18:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:18:44,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:18:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:18:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:18:44,453 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:18:44,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:18:44,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:18:44,707 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:18:44,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:18:46,784 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: 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:18:46,964 INFO L? ?]: Removed 822 outVars from TransFormulas that were not future-live. [2025-03-04 06:18:46,964 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:18:47,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:18:47,073 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 06:18:47,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:18:47 BoogieIcfgContainer [2025-03-04 06:18:47,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:18:47,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:18:47,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:18:47,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:18:47,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:18:43" (1/3) ... [2025-03-04 06:18:47,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d00497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:18:47, skipping insertion in model container [2025-03-04 06:18:47,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:18:43" (2/3) ... [2025-03-04 06:18:47,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d00497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:18:47, skipping insertion in model container [2025-03-04 06:18:47,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:18:47" (3/3) ... [2025-03-04 06:18:47,083 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-3.i [2025-03-04 06:18:47,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:18:47,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-3.i that has 6 procedures, 1084 locations, 1 initial locations, 87 loop locations, and 1 error locations. [2025-03-04 06:18:47,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:18:47,171 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;@6883647d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:18:47,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 06:18:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 1057 states have (on average 1.6263008514664143) internal successors, (1719), 1062 states have internal predecessors, (1719), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 06:18:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 06:18:47,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:47,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:18:47,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2060926951, now seen corresponding path program 1 times [2025-03-04 06:18:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989126610] [2025-03-04 06:18:47,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:47,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 06:18:47,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 06:18:47,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:47,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:47,341 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:18:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989126610] [2025-03-04 06:18:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989126610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:18:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490954390] [2025-03-04 06:18:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:47,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:18:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:47,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:18:47,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:18:47,366 INFO L87 Difference]: Start difference. First operand has 1076 states, 1057 states have (on average 1.6263008514664143) internal successors, (1719), 1062 states have internal predecessors, (1719), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:47,594 INFO L93 Difference]: Finished difference Result 2150 states and 3500 transitions. [2025-03-04 06:18:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:18:47,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 06:18:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:47,612 INFO L225 Difference]: With dead ends: 2150 [2025-03-04 06:18:47,614 INFO L226 Difference]: Without dead ends: 1012 [2025-03-04 06:18:47,620 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:18:47,622 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:47,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1462 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-04 06:18:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2025-03-04 06:18:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 994 states have (on average 1.4788732394366197) internal successors, (1470), 999 states have internal predecessors, (1470), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2025-03-04 06:18:47,703 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 13 [2025-03-04 06:18:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:47,703 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2025-03-04 06:18:47,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2025-03-04 06:18:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:18:47,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:47,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:18:47,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:18:47,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:47,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1764588660, now seen corresponding path program 1 times [2025-03-04 06:18:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:47,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908141889] [2025-03-04 06:18:47,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:47,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:18:47,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:18:47,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:48,181 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:18:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908141889] [2025-03-04 06:18:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908141889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:48,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:48,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359234742] [2025-03-04 06:18:48,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:48,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:48,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:48,183 INFO L87 Difference]: Start difference. First operand 1012 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:48,582 INFO L93 Difference]: Finished difference Result 2018 states and 2988 transitions. [2025-03-04 06:18:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:18:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:18:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:48,590 INFO L225 Difference]: With dead ends: 2018 [2025-03-04 06:18:48,590 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 06:18:48,591 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:18:48,592 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 542 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4209 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:48,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4209 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:18:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 06:18:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1014. [2025-03-04 06:18:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1499 transitions. [2025-03-04 06:18:48,629 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1499 transitions. Word has length 66 [2025-03-04 06:18:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:48,629 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1499 transitions. [2025-03-04 06:18:48,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1499 transitions. [2025-03-04 06:18:48,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 06:18:48,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:48,639 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:18:48,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:18:48,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:48,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:48,640 INFO L85 PathProgramCache]: Analyzing trace with hash 988663037, now seen corresponding path program 1 times [2025-03-04 06:18:48,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:48,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151722408] [2025-03-04 06:18:48,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:48,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 06:18:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 06:18:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:49,279 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:18:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151722408] [2025-03-04 06:18:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151722408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:18:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081231142] [2025-03-04 06:18:49,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:18:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:49,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:18:49,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:18:49,280 INFO L87 Difference]: Start difference. First operand 1014 states and 1499 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:49,706 INFO L93 Difference]: Finished difference Result 2402 states and 3547 transitions. [2025-03-04 06:18:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:18:49,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-03-04 06:18:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:49,712 INFO L225 Difference]: With dead ends: 2402 [2025-03-04 06:18:49,712 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 06:18:49,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:18:49,714 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 1078 mSDsluCounter, 3216 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 4631 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:49,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 4631 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:18:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 06:18:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1017. [2025-03-04 06:18:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 999 states have (on average 1.4764764764764764) internal successors, (1475), 1004 states have internal predecessors, (1475), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-04 06:18:49,737 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 141 [2025-03-04 06:18:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:49,737 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-04 06:18:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-04 06:18:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 06:18:49,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:49,739 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:18:49,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 69399267, now seen corresponding path program 1 times [2025-03-04 06:18:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912824338] [2025-03-04 06:18:49,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:49,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:18:49,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:18:49,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:49,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:50,109 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:18:50,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912824338] [2025-03-04 06:18:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912824338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:50,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:50,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:50,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559753115] [2025-03-04 06:18:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:50,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:50,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:50,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:50,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:50,110 INFO L87 Difference]: Start difference. First operand 1017 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:50,362 INFO L93 Difference]: Finished difference Result 1985 states and 2931 transitions. [2025-03-04 06:18:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:18:50,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-04 06:18:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:50,366 INFO L225 Difference]: With dead ends: 1985 [2025-03-04 06:18:50,366 INFO L226 Difference]: Without dead ends: 975 [2025-03-04 06:18:50,368 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:18:50,370 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 30 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:50,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3836 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-04 06:18:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-03-04 06:18:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 957 states have (on average 1.4608150470219436) internal successors, (1398), 962 states have internal predecessors, (1398), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 06:18:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1425 transitions. [2025-03-04 06:18:50,392 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1425 transitions. Word has length 210 [2025-03-04 06:18:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:50,393 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1425 transitions. [2025-03-04 06:18:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1425 transitions. [2025-03-04 06:18:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 06:18:50,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:50,395 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:50,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:18:50,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:50,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1441283004, now seen corresponding path program 1 times [2025-03-04 06:18:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:50,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695587635] [2025-03-04 06:18:50,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:50,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 06:18:50,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 06:18:50,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:50,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:50,609 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:18:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:50,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695587635] [2025-03-04 06:18:50,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695587635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:50,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:50,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:18:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135857421] [2025-03-04 06:18:50,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:50,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:18:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:50,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:18:50,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:18:50,612 INFO L87 Difference]: Start difference. First operand 975 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:50,903 INFO L93 Difference]: Finished difference Result 2466 states and 3618 transitions. [2025-03-04 06:18:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:18:50,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-04 06:18:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:50,911 INFO L225 Difference]: With dead ends: 2466 [2025-03-04 06:18:50,912 INFO L226 Difference]: Without dead ends: 1498 [2025-03-04 06:18:50,913 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:18:50,914 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 710 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:50,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2584 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:18:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-04 06:18:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1341. [2025-03-04 06:18:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1321 states have (on average 1.4640423921271764) internal successors, (1934), 1326 states have internal predecessors, (1934), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:18:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1965 transitions. [2025-03-04 06:18:50,951 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1965 transitions. Word has length 210 [2025-03-04 06:18:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1965 transitions. [2025-03-04 06:18:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:18:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1965 transitions. [2025-03-04 06:18:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 06:18:50,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:50,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:50,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:18:50,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:50,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash 938890531, now seen corresponding path program 1 times [2025-03-04 06:18:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:50,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519261677] [2025-03-04 06:18:50,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:18:51,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:18:51,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:51,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:51,363 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:18:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519261677] [2025-03-04 06:18:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519261677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346010030] [2025-03-04 06:18:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:51,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:51,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:51,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:51,366 INFO L87 Difference]: Start difference. First operand 1341 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:51,658 INFO L93 Difference]: Finished difference Result 2550 states and 3743 transitions. [2025-03-04 06:18:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:18:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-03-04 06:18:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:51,665 INFO L225 Difference]: With dead ends: 2550 [2025-03-04 06:18:51,665 INFO L226 Difference]: Without dead ends: 1299 [2025-03-04 06:18:51,668 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:18:51,668 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 30 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3614 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:51,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3614 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-04 06:18:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2025-03-04 06:18:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1279 states have (on average 1.4519155590304926) internal successors, (1857), 1284 states have internal predecessors, (1857), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 06:18:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1888 transitions. [2025-03-04 06:18:51,705 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1888 transitions. Word has length 225 [2025-03-04 06:18:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:51,705 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1888 transitions. [2025-03-04 06:18:51,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1888 transitions. [2025-03-04 06:18:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 06:18:51,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:51,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:51,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:18:51,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1850666135, now seen corresponding path program 1 times [2025-03-04 06:18:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79382111] [2025-03-04 06:18:51,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:51,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:18:51,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:18:51,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:51,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:52,026 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:18:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79382111] [2025-03-04 06:18:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79382111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:52,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:18:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539777976] [2025-03-04 06:18:52,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:52,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:18:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:52,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:18:52,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:18:52,029 INFO L87 Difference]: Start difference. First operand 1299 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:52,347 INFO L93 Difference]: Finished difference Result 3070 states and 4480 transitions. [2025-03-04 06:18:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:18:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-03-04 06:18:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:52,358 INFO L225 Difference]: With dead ends: 3070 [2025-03-04 06:18:52,359 INFO L226 Difference]: Without dead ends: 1861 [2025-03-04 06:18:52,362 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:18:52,363 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 592 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:52,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2436 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:18:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-03-04 06:18:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1856. [2025-03-04 06:18:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1830 states have (on average 1.4551912568306011) internal successors, (2663), 1835 states have internal predecessors, (2663), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:18:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2706 transitions. [2025-03-04 06:18:52,419 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2706 transitions. Word has length 225 [2025-03-04 06:18:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:52,420 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2706 transitions. [2025-03-04 06:18:52,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2706 transitions. [2025-03-04 06:18:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 06:18:52,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:52,422 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:52,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:18:52,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:52,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1814538001, now seen corresponding path program 1 times [2025-03-04 06:18:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:52,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460920398] [2025-03-04 06:18:52,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:52,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 06:18:52,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 06:18:52,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:52,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460920398] [2025-03-04 06:18:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460920398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951452556] [2025-03-04 06:18:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:52,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:52,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:52,733 INFO L87 Difference]: Start difference. First operand 1856 states and 2706 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 06:18:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:53,660 INFO L93 Difference]: Finished difference Result 3056 states and 4462 transitions. [2025-03-04 06:18:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:18:53,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 240 [2025-03-04 06:18:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:53,667 INFO L225 Difference]: With dead ends: 3056 [2025-03-04 06:18:53,667 INFO L226 Difference]: Without dead ends: 1433 [2025-03-04 06:18:53,670 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:18:53,670 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 2348 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:53,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1438 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 06:18:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-04 06:18:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2025-03-04 06:18:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1412 states have (on average 1.4405099150141643) internal successors, (2034), 1417 states have internal predecessors, (2034), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:18:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2067 transitions. [2025-03-04 06:18:53,706 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2067 transitions. Word has length 240 [2025-03-04 06:18:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:53,706 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2067 transitions. [2025-03-04 06:18:53,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 06:18:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2067 transitions. [2025-03-04 06:18:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:18:53,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:53,709 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:18:53,709 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:53,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1861888321, now seen corresponding path program 1 times [2025-03-04 06:18:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529639747] [2025-03-04 06:18:53,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:53,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:53,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:53,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 06:18:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529639747] [2025-03-04 06:18:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529639747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:18:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426962693] [2025-03-04 06:18:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:18:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:54,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:18:54,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:18:54,039 INFO L87 Difference]: Start difference. First operand 1433 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:54,237 INFO L93 Difference]: Finished difference Result 2307 states and 3370 transitions. [2025-03-04 06:18:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:18:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-04 06:18:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:54,243 INFO L225 Difference]: With dead ends: 2307 [2025-03-04 06:18:54,243 INFO L226 Difference]: Without dead ends: 1453 [2025-03-04 06:18:54,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:18:54,245 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 8 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:54,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2399 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-04 06:18:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2025-03-04 06:18:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4343575418994414) internal successors, (2054), 1437 states have internal predecessors, (2054), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:18:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2087 transitions. [2025-03-04 06:18:54,278 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2087 transitions. Word has length 250 [2025-03-04 06:18:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:54,278 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2087 transitions. [2025-03-04 06:18:54,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2087 transitions. [2025-03-04 06:18:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:18:54,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:54,281 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:18:54,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:54,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:54,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2102428450, now seen corresponding path program 1 times [2025-03-04 06:18:54,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:54,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230510381] [2025-03-04 06:18:54,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:54,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:54,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:54,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:54,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 06:18:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230510381] [2025-03-04 06:18:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230510381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:18:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141751718] [2025-03-04 06:18:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:18:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:54,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:18:54,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:18:54,649 INFO L87 Difference]: Start difference. First operand 1453 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:54,882 INFO L93 Difference]: Finished difference Result 2317 states and 3373 transitions. [2025-03-04 06:18:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:18:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-04 06:18:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:54,888 INFO L225 Difference]: With dead ends: 2317 [2025-03-04 06:18:54,889 INFO L226 Difference]: Without dead ends: 1391 [2025-03-04 06:18:54,890 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:18:54,891 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 32 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:54,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3382 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:18:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-04 06:18:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2025-03-04 06:18:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1370 states have (on average 1.4262773722627737) internal successors, (1954), 1375 states have internal predecessors, (1954), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 06:18:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1987 transitions. [2025-03-04 06:18:54,930 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1987 transitions. Word has length 250 [2025-03-04 06:18:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:54,931 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1987 transitions. [2025-03-04 06:18:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:18:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1987 transitions. [2025-03-04 06:18:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 06:18:54,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:54,934 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:18:54,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:54,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 716484731, now seen corresponding path program 1 times [2025-03-04 06:18:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334159738] [2025-03-04 06:18:54,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:54,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:55,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:55,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:55,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:55,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334159738] [2025-03-04 06:18:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334159738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150394767] [2025-03-04 06:18:55,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:55,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:55,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:55,754 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:18:55,755 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:18:56,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 06:18:56,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 06:18:56,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:56,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:18:56,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:56,694 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:18:56,708 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:18:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:18:56,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150394767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 06:18:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040621387] [2025-03-04 06:18:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:56,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:18:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:56,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:18:56,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:56,725 INFO L87 Difference]: Start difference. First operand 1391 states and 1987 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:00,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:19:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:00,544 INFO L93 Difference]: Finished difference Result 2577 states and 3696 transitions. [2025-03-04 06:19:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:19:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-04 06:19:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:00,551 INFO L225 Difference]: With dead ends: 2577 [2025-03-04 06:19:00,551 INFO L226 Difference]: Without dead ends: 1710 [2025-03-04 06:19:00,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:19:00,553 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 1257 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:00,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 4703 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-04 06:19:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-04 06:19:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1559. [2025-03-04 06:19:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1528 states have (on average 1.418193717277487) internal successors, (2167), 1537 states have internal predecessors, (2167), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 06:19:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2214 transitions. [2025-03-04 06:19:00,588 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2214 transitions. Word has length 250 [2025-03-04 06:19:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:00,589 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2214 transitions. [2025-03-04 06:19:00,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2214 transitions. [2025-03-04 06:19:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 06:19:00,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:00,592 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:19:00,602 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:19:00,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:19:00,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2002720844, now seen corresponding path program 1 times [2025-03-04 06:19:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871352021] [2025-03-04 06:19:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:00,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:00,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 06:19:00,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 06:19:00,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:00,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871352021] [2025-03-04 06:19:01,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871352021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:01,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902570799] [2025-03-04 06:19:01,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:01,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:01,799 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:19:01,800 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:19:02,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 06:19:02,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 06:19:02,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:02,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:02,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1625 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:19:02,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:02,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:19:02,888 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:19:02,896 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:19:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:02,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902570799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:03,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-03-04 06:19:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766607283] [2025-03-04 06:19:03,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 06:19:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:03,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 06:19:03,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:19:03,191 INFO L87 Difference]: Start difference. First operand 1559 states and 2214 transitions. Second operand has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:19:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:03,950 INFO L93 Difference]: Finished difference Result 3811 states and 5365 transitions. [2025-03-04 06:19:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:19:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 325 [2025-03-04 06:19:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:03,959 INFO L225 Difference]: With dead ends: 3811 [2025-03-04 06:19:03,959 INFO L226 Difference]: Without dead ends: 2485 [2025-03-04 06:19:03,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 639 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:19:03,962 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 2124 mSDsluCounter, 6925 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 8046 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:03,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 8046 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:19:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-04 06:19:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2203. [2025-03-04 06:19:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2160 states have (on average 1.3939814814814815) internal successors, (3011), 2169 states have internal predecessors, (3011), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 06:19:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3080 transitions. [2025-03-04 06:19:04,014 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3080 transitions. Word has length 325 [2025-03-04 06:19:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3080 transitions. [2025-03-04 06:19:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:19:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3080 transitions. [2025-03-04 06:19:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-04 06:19:04,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:04,026 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:04,037 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:19:04,226 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,SelfDestructingSolverStorable11 [2025-03-04 06:19:04,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1589937110, now seen corresponding path program 1 times [2025-03-04 06:19:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333194097] [2025-03-04 06:19:04,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:04,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-04 06:19:04,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-04 06:19:04,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:04,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333194097] [2025-03-04 06:19:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333194097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722929392] [2025-03-04 06:19:08,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:08,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:08,651 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:19:08,653 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:19:09,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-04 06:19:09,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-04 06:19:09,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:09,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:09,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 3719 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:19:09,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:09,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:19:10,249 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:19:10,393 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:19:10,534 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:19:10,703 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:19:10,710 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:19:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:10,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722929392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:11,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:11,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-04 06:19:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386699744] [2025-03-04 06:19:11,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:11,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 06:19:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:11,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 06:19:11,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:19:11,336 INFO L87 Difference]: Start difference. First operand 2203 states and 3080 transitions. Second operand has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:19:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:12,429 INFO L93 Difference]: Finished difference Result 5533 states and 7696 transitions. [2025-03-04 06:19:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 06:19:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 757 [2025-03-04 06:19:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:12,442 INFO L225 Difference]: With dead ends: 5533 [2025-03-04 06:19:12,442 INFO L226 Difference]: Without dead ends: 4207 [2025-03-04 06:19:12,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1537 GetRequests, 1501 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-04 06:19:12,445 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 4855 mSDsluCounter, 9427 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4897 SdHoareTripleChecker+Valid, 10548 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:12,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4897 Valid, 10548 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 06:19:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2025-03-04 06:19:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3925. [2025-03-04 06:19:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3858 states have (on average 1.371435977190254) internal successors, (5291), 3867 states have internal predecessors, (5291), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 5408 transitions. [2025-03-04 06:19:12,525 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 5408 transitions. Word has length 757 [2025-03-04 06:19:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 5408 transitions. [2025-03-04 06:19:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 06:19:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 5408 transitions. [2025-03-04 06:19:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-04 06:19:12,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:12,580 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:19:12,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:12,781 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -988411930, now seen corresponding path program 2 times [2025-03-04 06:19:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015279598] [2025-03-04 06:19:12,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:19:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:13,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-04 06:19:13,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-04 06:19:13,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:19:13,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015279598] [2025-03-04 06:19:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015279598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:19:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315970320] [2025-03-04 06:19:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:19:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:13,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:19:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:13,448 INFO L87 Difference]: Start difference. First operand 3925 states and 5408 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:14,254 INFO L93 Difference]: Finished difference Result 4782 states and 6685 transitions. [2025-03-04 06:19:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1621 [2025-03-04 06:19:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:14,277 INFO L225 Difference]: With dead ends: 4782 [2025-03-04 06:19:14,277 INFO L226 Difference]: Without dead ends: 3936 [2025-03-04 06:19:14,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:19:14,283 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 53 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6507 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:14,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6507 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:19:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2025-03-04 06:19:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3932. [2025-03-04 06:19:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3865 states have (on average 1.3707632600258732) internal successors, (5298), 3874 states have internal predecessors, (5298), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5415 transitions. [2025-03-04 06:19:14,369 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5415 transitions. Word has length 1621 [2025-03-04 06:19:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 3932 states and 5415 transitions. [2025-03-04 06:19:14,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5415 transitions. [2025-03-04 06:19:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 06:19:14,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:14,389 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:19:14,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:14,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1557519537, now seen corresponding path program 1 times [2025-03-04 06:19:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442730442] [2025-03-04 06:19:14,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:14,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-04 06:19:15,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-04 06:19:15,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442730442] [2025-03-04 06:19:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442730442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:19:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570068385] [2025-03-04 06:19:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:19:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:18,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:19:18,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:19:18,979 INFO L87 Difference]: Start difference. First operand 3932 states and 5415 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:19,487 INFO L93 Difference]: Finished difference Result 4782 states and 6680 transitions. [2025-03-04 06:19:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:19:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-04 06:19:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:19,504 INFO L225 Difference]: With dead ends: 4782 [2025-03-04 06:19:19,504 INFO L226 Difference]: Without dead ends: 3937 [2025-03-04 06:19:19,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:19,509 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 17 mSDsluCounter, 5354 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6498 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:19,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6498 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:19:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-04 06:19:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3936. [2025-03-04 06:19:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.3706384078573275) internal successors, (5303), 3878 states have internal predecessors, (5303), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5420 transitions. [2025-03-04 06:19:19,579 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5420 transitions. Word has length 1622 [2025-03-04 06:19:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:19,580 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5420 transitions. [2025-03-04 06:19:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5420 transitions. [2025-03-04 06:19:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 06:19:19,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:19,596 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:19:19,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:19,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1021897864, now seen corresponding path program 1 times [2025-03-04 06:19:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279808312] [2025-03-04 06:19:19,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-04 06:19:20,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-04 06:19:20,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:20,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:23,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279808312] [2025-03-04 06:19:23,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279808312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:23,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:23,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:19:23,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315717865] [2025-03-04 06:19:23,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:23,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:19:23,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:23,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:19:23,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:23,341 INFO L87 Difference]: Start difference. First operand 3936 states and 5420 transitions. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:23,813 INFO L93 Difference]: Finished difference Result 4780 states and 6676 transitions. [2025-03-04 06:19:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-04 06:19:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:23,822 INFO L225 Difference]: With dead ends: 4780 [2025-03-04 06:19:23,822 INFO L226 Difference]: Without dead ends: 3944 [2025-03-04 06:19:23,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:19:23,824 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 25 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6537 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:23,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6537 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:19:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-03-04 06:19:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3936. [2025-03-04 06:19:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.3706384078573275) internal successors, (5303), 3878 states have internal predecessors, (5303), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5420 transitions. [2025-03-04 06:19:23,883 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5420 transitions. Word has length 1622 [2025-03-04 06:19:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:23,884 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5420 transitions. [2025-03-04 06:19:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5420 transitions. [2025-03-04 06:19:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-04 06:19:23,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:23,900 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:19:23,900 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:23,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash 632541933, now seen corresponding path program 1 times [2025-03-04 06:19:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897947109] [2025-03-04 06:19:23,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:24,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-04 06:19:24,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-04 06:19:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 06:19:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897947109] [2025-03-04 06:19:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897947109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:19:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188086560] [2025-03-04 06:19:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:19:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:28,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:19:28,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:19:28,344 INFO L87 Difference]: Start difference. First operand 3936 states and 5420 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:29,047 INFO L93 Difference]: Finished difference Result 4788 states and 6687 transitions. [2025-03-04 06:19:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:19:29,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1623 [2025-03-04 06:19:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:29,057 INFO L225 Difference]: With dead ends: 4788 [2025-03-04 06:19:29,057 INFO L226 Difference]: Without dead ends: 3947 [2025-03-04 06:19:29,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:19:29,060 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 31 mSDsluCounter, 7617 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8758 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:29,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8758 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:19:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2025-03-04 06:19:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3944. [2025-03-04 06:19:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3877 states have (on average 1.3703894763992779) internal successors, (5313), 3886 states have internal predecessors, (5313), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 06:19:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5430 transitions. [2025-03-04 06:19:29,123 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5430 transitions. Word has length 1623 [2025-03-04 06:19:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:29,124 INFO L471 AbstractCegarLoop]: Abstraction has 3944 states and 5430 transitions. [2025-03-04 06:19:29,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5430 transitions. [2025-03-04 06:19:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-04 06:19:29,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:29,141 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:29,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:19:29,141 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:29,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 361966115, now seen corresponding path program 1 times [2025-03-04 06:19:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005291672] [2025-03-04 06:19:29,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:29,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:29,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:19:30,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:19:30,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:30,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-04 06:19:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005291672] [2025-03-04 06:19:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005291672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:19:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64762905] [2025-03-04 06:19:34,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:34,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:19:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:19:34,762 INFO L229 MonitoredProcess]: Starting monitored process 5 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:19:34,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:19:36,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 06:19:37,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 06:19:37,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:37,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 7907 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 06:19:37,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:19:37,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:19:37,436 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:19:37,566 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:19:37,702 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:19:37,824 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:19:37,954 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:19:38,080 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:19:38,206 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:19:38,360 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:19:38,504 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:19:38,628 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:19:38,706 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:19:38,709 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:19:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:38,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:19:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 7214 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 06:19:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64762905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:19:40,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:19:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 32 [2025-03-04 06:19:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106539621] [2025-03-04 06:19:40,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:19:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 06:19:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:40,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 06:19:40,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=636, Unknown=0, NotChecked=0, Total=992 [2025-03-04 06:19:40,143 INFO L87 Difference]: Start difference. First operand 3944 states and 5430 transitions. Second operand has 32 states, 32 states have (on average 103.21875) internal successors, (3303), 32 states have internal predecessors, (3303), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 06:19:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:42,256 INFO L93 Difference]: Finished difference Result 6809 states and 9418 transitions. [2025-03-04 06:19:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 06:19:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 103.21875) internal successors, (3303), 32 states have internal predecessors, (3303), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1624 [2025-03-04 06:19:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:42,271 INFO L225 Difference]: With dead ends: 6809 [2025-03-04 06:19:42,271 INFO L226 Difference]: Without dead ends: 5907 [2025-03-04 06:19:42,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3304 GetRequests, 3220 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 06:19:42,277 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 13834 mSDsluCounter, 12668 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13915 SdHoareTripleChecker+Valid, 13758 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:42,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13915 Valid, 13758 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 06:19:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5907 states. [2025-03-04 06:19:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5907 to 5907. [2025-03-04 06:19:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5907 states, 5801 states have (on average 1.3595931735907603) internal successors, (7887), 5810 states have internal predecessors, (7887), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-04 06:19:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5907 states to 5907 states and 8082 transitions. [2025-03-04 06:19:42,370 INFO L78 Accepts]: Start accepts. Automaton has 5907 states and 8082 transitions. Word has length 1624 [2025-03-04 06:19:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:42,372 INFO L471 AbstractCegarLoop]: Abstraction has 5907 states and 8082 transitions. [2025-03-04 06:19:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 103.21875) internal successors, (3303), 32 states have internal predecessors, (3303), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 06:19:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5907 states and 8082 transitions. [2025-03-04 06:19:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-04 06:19:42,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:42,407 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:42,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:19:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 06:19:42,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1865670936, now seen corresponding path program 2 times [2025-03-04 06:19:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545435629] [2025-03-04 06:19:42,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:19:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:43,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2599 statements into 2 equivalence classes. [2025-03-04 06:19:43,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 2599 statements. [2025-03-04 06:19:43,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:19:43,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-04 06:19:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545435629] [2025-03-04 06:19:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545435629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:43,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:43,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:19:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675230836] [2025-03-04 06:19:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:19:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:43,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:19:43,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:19:43,438 INFO L87 Difference]: Start difference. First operand 5907 states and 8082 transitions. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:44,033 INFO L93 Difference]: Finished difference Result 6745 states and 9329 transitions. [2025-03-04 06:19:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:19:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 2599 [2025-03-04 06:19:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:44,045 INFO L225 Difference]: With dead ends: 6745 [2025-03-04 06:19:44,046 INFO L226 Difference]: Without dead ends: 5895 [2025-03-04 06:19:44,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:19:44,048 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 400 mSDsluCounter, 5946 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 7075 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:44,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 7075 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:19:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5895 states. [2025-03-04 06:19:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5895 to 5892. [2025-03-04 06:19:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5892 states, 5786 states have (on average 1.3598340822675423) internal successors, (7868), 5795 states have internal predecessors, (7868), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-04 06:19:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 8063 transitions. [2025-03-04 06:19:44,133 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 8063 transitions. Word has length 2599 [2025-03-04 06:19:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 5892 states and 8063 transitions. [2025-03-04 06:19:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 8063 transitions. [2025-03-04 06:19:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2600 [2025-03-04 06:19:44,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:44,166 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:19:44,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1567379921, now seen corresponding path program 1 times [2025-03-04 06:19:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505764588] [2025-03-04 06:19:44,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:44,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2599 statements into 1 equivalence classes. [2025-03-04 06:19:45,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2599 of 2599 statements. [2025-03-04 06:19:45,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:45,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:19:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23813 trivial. 0 not checked. [2025-03-04 06:19:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:19:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505764588] [2025-03-04 06:19:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505764588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:19:51,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:19:51,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:19:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059331590] [2025-03-04 06:19:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:19:51,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:19:51,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:19:51,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:19:51,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:19:51,573 INFO L87 Difference]: Start difference. First operand 5892 states and 8063 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:19:52,010 INFO L93 Difference]: Finished difference Result 6744 states and 9330 transitions. [2025-03-04 06:19:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:19:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 2599 [2025-03-04 06:19:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:19:52,032 INFO L225 Difference]: With dead ends: 6744 [2025-03-04 06:19:52,033 INFO L226 Difference]: Without dead ends: 5897 [2025-03-04 06:19:52,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:19:52,037 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 11 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6515 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:19:52,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6515 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:19:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2025-03-04 06:19:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5895. [2025-03-04 06:19:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5895 states, 5789 states have (on average 1.3596476075315254) internal successors, (7871), 5798 states have internal predecessors, (7871), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-04 06:19:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5895 states to 5895 states and 8066 transitions. [2025-03-04 06:19:52,138 INFO L78 Accepts]: Start accepts. Automaton has 5895 states and 8066 transitions. Word has length 2599 [2025-03-04 06:19:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:19:52,141 INFO L471 AbstractCegarLoop]: Abstraction has 5895 states and 8066 transitions. [2025-03-04 06:19:52,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 06:19:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5895 states and 8066 transitions. [2025-03-04 06:19:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2601 [2025-03-04 06:19:52,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:19:52,175 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 14, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:19:52,176 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:19:52,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:19:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1279822677, now seen corresponding path program 1 times [2025-03-04 06:19:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:19:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680538607] [2025-03-04 06:19:52,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:19:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:19:52,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2600 statements into 1 equivalence classes. [2025-03-04 06:19:53,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2600 of 2600 statements. [2025-03-04 06:19:53,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:19:53,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat