./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:46:28,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:46:28,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:46:28,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:46:28,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:46:28,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:46:28,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:46:28,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:46:28,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:46:28,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:46:28,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:46:28,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:46:28,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:46:28,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:46:28,881 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:46:28,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:46:28,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:46:28,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:46:28,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:46:28,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:46:28,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:46:28,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:46:28,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:46:28,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:46:28,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:46:28,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:46:28,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:46:28,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:46:28,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:46:28,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:46:28,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:46:28,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2025-02-08 04:46:29,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:46:29,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:46:29,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:46:29,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:46:29,189 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:46:29,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-02-08 04:46:30,583 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40beffc55/fc8a3c940bd24d87af19c778c8a836a4/FLAG010f4265f [2025-02-08 04:46:30,951 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:46:30,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-02-08 04:46:30,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40beffc55/fc8a3c940bd24d87af19c778c8a836a4/FLAG010f4265f [2025-02-08 04:46:30,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40beffc55/fc8a3c940bd24d87af19c778c8a836a4 [2025-02-08 04:46:30,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:46:30,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:46:30,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:46:30,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:46:30,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:46:30,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:46:30" (1/1) ... [2025-02-08 04:46:30,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7723bce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:30, skipping insertion in model container [2025-02-08 04:46:30,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:46:30" (1/1) ... [2025-02-08 04:46:31,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:46:31,500 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2025-02-08 04:46:31,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:46:31,767 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:46:31,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i[33022,33035] [2025-02-08 04:46:31,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:46:31,949 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:46:31,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31 WrapperNode [2025-02-08 04:46:31,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:46:31,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:46:31,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:46:31,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:46:31,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,149 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3305 [2025-02-08 04:46:32,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:46:32,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:46:32,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:46:32,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:46:32,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,379 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2025-02-08 04:46:32,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:46:32,517 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:46:32,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:46:32,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:46:32,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (1/1) ... [2025-02-08 04:46:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:46:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:46:32,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 04:46:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 04:46:32,582 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-08 04:46:32,583 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-08 04:46:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:46:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:46:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:46:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:46:32,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:46:32,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:46:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:46:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:46:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:46:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:46:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:46:32,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:46:32,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:46:32,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:46:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:46:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:46:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:46:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:46:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:46:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:46:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:46:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:46:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:46:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:46:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:46:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:46:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:46:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:46:32,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:46:32,898 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:46:32,900 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:46:35,678 INFO L1324 $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-02-08 04:46:35,917 INFO L? ?]: Removed 779 outVars from TransFormulas that were not future-live. [2025-02-08 04:46:35,917 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:46:36,059 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:46:36,059 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 04:46:36,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:46:36 BoogieIcfgContainer [2025-02-08 04:46:36,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:46:36,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:46:36,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:46:36,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:46:36,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:46:30" (1/3) ... [2025-02-08 04:46:36,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5fee4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:46:36, skipping insertion in model container [2025-02-08 04:46:36,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:31" (2/3) ... [2025-02-08 04:46:36,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5fee4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:46:36, skipping insertion in model container [2025-02-08 04:46:36,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:46:36" (3/3) ... [2025-02-08 04:46:36,072 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2025-02-08 04:46:36,089 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:46:36,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test10-1.i that has 6 procedures, 1029 locations, 1 initial locations, 84 loop locations, and 1 error locations. [2025-02-08 04:46:36,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:46:36,196 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;@14314516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:46:36,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:46:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 1021 states, 1001 states have (on average 1.6223776223776223) internal successors, (1624), 1006 states have internal predecessors, (1624), 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-02-08 04:46:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 04:46:36,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:36,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:46:36,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:36,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash -728280532, now seen corresponding path program 1 times [2025-02-08 04:46:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:36,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975122878] [2025-02-08 04:46:36,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:36,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 04:46:36,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 04:46:36,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:36,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975122878] [2025-02-08 04:46:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975122878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:46:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384175685] [2025-02-08 04:46:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:36,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:46:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:36,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:46:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:46:36,443 INFO L87 Difference]: Start difference. First operand has 1021 states, 1001 states have (on average 1.6223776223776223) internal successors, (1624), 1006 states have internal predecessors, (1624), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 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-02-08 04:46:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:36,737 INFO L93 Difference]: Finished difference Result 2041 states and 3307 transitions. [2025-02-08 04:46:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:46:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2025-02-08 04:46:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:36,759 INFO L225 Difference]: With dead ends: 2041 [2025-02-08 04:46:36,760 INFO L226 Difference]: Without dead ends: 1014 [2025-02-08 04:46:36,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:46:36,770 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:36,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1385 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:46:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-02-08 04:46:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2025-02-08 04:46:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 997 states have (on average 1.4764292878635907) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:46:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1495 transitions. [2025-02-08 04:46:36,880 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1495 transitions. Word has length 12 [2025-02-08 04:46:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:36,880 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1495 transitions. [2025-02-08 04:46:36,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-02-08 04:46:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1495 transitions. [2025-02-08 04:46:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 04:46:36,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:36,885 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-02-08 04:46:36,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:46:36,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2091016891, now seen corresponding path program 1 times [2025-02-08 04:46:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607339348] [2025-02-08 04:46:36,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:36,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 04:46:36,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 04:46:36,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:36,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:37,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:37,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607339348] [2025-02-08 04:46:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607339348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:46:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158252202] [2025-02-08 04:46:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:37,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:37,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:37,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:37,477 INFO L87 Difference]: Start difference. First operand 1014 states and 1495 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 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-02-08 04:46:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:38,072 INFO L93 Difference]: Finished difference Result 2023 states and 2985 transitions. [2025-02-08 04:46:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:46:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 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-02-08 04:46:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:38,082 INFO L225 Difference]: With dead ends: 2023 [2025-02-08 04:46:38,082 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 04:46:38,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:38,087 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 544 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:38,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4125 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:46:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 04:46:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1016. [2025-02-08 04:46:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 999 states have (on average 1.4754754754754755) internal successors, (1474), 1003 states have internal predecessors, (1474), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:46:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1497 transitions. [2025-02-08 04:46:38,145 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1497 transitions. Word has length 66 [2025-02-08 04:46:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:38,146 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1497 transitions. [2025-02-08 04:46:38,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 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-02-08 04:46:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1497 transitions. [2025-02-08 04:46:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-08 04:46:38,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:38,158 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] [2025-02-08 04:46:38,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:46:38,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:38,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash 993008446, now seen corresponding path program 1 times [2025-02-08 04:46:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882876074] [2025-02-08 04:46:38,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:38,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 04:46:38,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 04:46:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882876074] [2025-02-08 04:46:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882876074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:38,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:46:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868734660] [2025-02-08 04:46:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:38,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:38,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:38,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:38,810 INFO L87 Difference]: Start difference. First operand 1016 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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-02-08 04:46:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:39,352 INFO L93 Difference]: Finished difference Result 2409 states and 3546 transitions. [2025-02-08 04:46:39,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:46:39,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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 142 [2025-02-08 04:46:39,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:39,360 INFO L225 Difference]: With dead ends: 2409 [2025-02-08 04:46:39,360 INFO L226 Difference]: Without dead ends: 1396 [2025-02-08 04:46:39,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:39,363 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 540 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 4203 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:39,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 4203 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:46:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-02-08 04:46:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1019. [2025-02-08 04:46:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1002 states have (on average 1.4740518962075848) internal successors, (1477), 1006 states have internal predecessors, (1477), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:46:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1500 transitions. [2025-02-08 04:46:39,395 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1500 transitions. Word has length 142 [2025-02-08 04:46:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:39,395 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1500 transitions. [2025-02-08 04:46:39,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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-02-08 04:46:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1500 transitions. [2025-02-08 04:46:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:46:39,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:39,401 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, 1, 1] [2025-02-08 04:46:39,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:46:39,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 34460654, now seen corresponding path program 1 times [2025-02-08 04:46:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133017159] [2025-02-08 04:46:39,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:39,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:39,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:46:39,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:46:39,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:39,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:39,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133017159] [2025-02-08 04:46:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133017159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:39,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:46:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104122398] [2025-02-08 04:46:39,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:39,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:39,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:39,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:39,891 INFO L87 Difference]: Start difference. First operand 1019 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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-02-08 04:46:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:40,266 INFO L93 Difference]: Finished difference Result 1990 states and 2928 transitions. [2025-02-08 04:46:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:46:40,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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 212 [2025-02-08 04:46:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:40,271 INFO L225 Difference]: With dead ends: 1990 [2025-02-08 04:46:40,272 INFO L226 Difference]: Without dead ends: 977 [2025-02-08 04:46:40,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:40,275 INFO L435 NwaCegarLoop]: 1281 mSDtfsCounter, 33 mSDsluCounter, 2546 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3827 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:40,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3827 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-08 04:46:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-02-08 04:46:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 960 states have (on average 1.4583333333333333) internal successors, (1400), 964 states have internal predecessors, (1400), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:46:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1423 transitions. [2025-02-08 04:46:40,303 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1423 transitions. Word has length 212 [2025-02-08 04:46:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:40,305 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1423 transitions. [2025-02-08 04:46:40,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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-02-08 04:46:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1423 transitions. [2025-02-08 04:46:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:46:40,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:40,310 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, 1, 1] [2025-02-08 04:46:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:46:40,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash -52413435, now seen corresponding path program 1 times [2025-02-08 04:46:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516232392] [2025-02-08 04:46:40,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:40,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:46:40,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:46:40,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:40,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516232392] [2025-02-08 04:46:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516232392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:40,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:40,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:46:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528528400] [2025-02-08 04:46:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:46:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:40,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:46:40,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:46:40,647 INFO L87 Difference]: Start difference. First operand 977 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-08 04:46:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:40,899 INFO L93 Difference]: Finished difference Result 1948 states and 2840 transitions. [2025-02-08 04:46:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:46:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 212 [2025-02-08 04:46:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:40,905 INFO L225 Difference]: With dead ends: 1948 [2025-02-08 04:46:40,905 INFO L226 Difference]: Without dead ends: 977 [2025-02-08 04:46:40,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:46:40,908 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 2 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:40,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2568 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:46:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-08 04:46:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-02-08 04:46:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 960 states have (on average 1.4552083333333334) internal successors, (1397), 964 states have internal predecessors, (1397), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:46:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1420 transitions. [2025-02-08 04:46:40,935 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1420 transitions. Word has length 212 [2025-02-08 04:46:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1420 transitions. [2025-02-08 04:46:40,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-02-08 04:46:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1420 transitions. [2025-02-08 04:46:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-08 04:46:40,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:40,939 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, 1, 1] [2025-02-08 04:46:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:46:40,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2131239784, now seen corresponding path program 1 times [2025-02-08 04:46:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137381090] [2025-02-08 04:46:40,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:41,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 04:46:41,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 04:46:41,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:46:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137381090] [2025-02-08 04:46:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137381090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:41,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:46:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729155193] [2025-02-08 04:46:41,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:41,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:46:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:41,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:46:41,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:46:41,175 INFO L87 Difference]: Start difference. First operand 977 states and 1420 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-02-08 04:46:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:41,529 INFO L93 Difference]: Finished difference Result 2475 states and 3610 transitions. [2025-02-08 04:46:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:46:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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 212 [2025-02-08 04:46:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:41,536 INFO L225 Difference]: With dead ends: 2475 [2025-02-08 04:46:41,536 INFO L226 Difference]: Without dead ends: 1504 [2025-02-08 04:46:41,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:46:41,538 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 713 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2580 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-02-08 04:46:41,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2580 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-02-08 04:46:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1346. [2025-02-08 04:46:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1327 states have (on average 1.456669178598342) internal successors, (1933), 1331 states have internal predecessors, (1933), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:46:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1960 transitions. [2025-02-08 04:46:41,578 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1960 transitions. Word has length 212 [2025-02-08 04:46:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:41,579 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1960 transitions. [2025-02-08 04:46:41,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-02-08 04:46:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1960 transitions. [2025-02-08 04:46:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-08 04:46:41,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:41,582 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, 1, 1] [2025-02-08 04:46:41,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 04:46:41,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:41,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash 24237784, now seen corresponding path program 1 times [2025-02-08 04:46:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670517747] [2025-02-08 04:46:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:41,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 04:46:41,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 04:46:41,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:41,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:42,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670517747] [2025-02-08 04:46:42,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670517747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:42,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:42,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:46:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206746968] [2025-02-08 04:46:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:42,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:42,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:42,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:42,045 INFO L87 Difference]: Start difference. First operand 1346 states and 1960 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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-02-08 04:46:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:42,359 INFO L93 Difference]: Finished difference Result 2560 states and 3736 transitions. [2025-02-08 04:46:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:46:42,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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 227 [2025-02-08 04:46:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:42,367 INFO L225 Difference]: With dead ends: 2560 [2025-02-08 04:46:42,368 INFO L226 Difference]: Without dead ends: 1304 [2025-02-08 04:46:42,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:42,371 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 30 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3608 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:42,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3608 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-02-08 04:46:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-02-08 04:46:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1285 states have (on average 1.4443579766536965) internal successors, (1856), 1289 states have internal predecessors, (1856), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 04:46:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1883 transitions. [2025-02-08 04:46:42,413 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1883 transitions. Word has length 227 [2025-02-08 04:46:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:42,413 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1883 transitions. [2025-02-08 04:46:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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-02-08 04:46:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1883 transitions. [2025-02-08 04:46:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-08 04:46:42,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:42,417 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, 1, 1] [2025-02-08 04:46:42,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:46:42,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -552672942, now seen corresponding path program 1 times [2025-02-08 04:46:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141498095] [2025-02-08 04:46:42,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:42,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 04:46:42,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 04:46:42,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:46:42,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141498095] [2025-02-08 04:46:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141498095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:42,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:46:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206106295] [2025-02-08 04:46:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:46:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:42,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:46:42,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:46:42,783 INFO L87 Difference]: Start difference. First operand 1304 states and 1883 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-02-08 04:46:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:43,135 INFO L93 Difference]: Finished difference Result 3084 states and 4477 transitions. [2025-02-08 04:46:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:46:43,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 227 [2025-02-08 04:46:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:43,147 INFO L225 Difference]: With dead ends: 3084 [2025-02-08 04:46:43,148 INFO L226 Difference]: Without dead ends: 1870 [2025-02-08 04:46:43,151 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-02-08 04:46:43,152 INFO L435 NwaCegarLoop]: 1406 mSDtfsCounter, 594 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 2614 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-02-08 04:46:43,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 2614 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-02-08 04:46:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1865. [2025-02-08 04:46:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1840 states have (on average 1.4489130434782609) internal successors, (2666), 1844 states have internal predecessors, (2666), 22 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 04:46:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2705 transitions. [2025-02-08 04:46:43,212 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2705 transitions. Word has length 227 [2025-02-08 04:46:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:43,213 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2705 transitions. [2025-02-08 04:46:43,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-02-08 04:46:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2705 transitions. [2025-02-08 04:46:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-08 04:46:43,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:43,217 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] [2025-02-08 04:46:43,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:46:43,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -78291226, now seen corresponding path program 1 times [2025-02-08 04:46:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:43,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654354084] [2025-02-08 04:46:43,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:43,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-08 04:46:43,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-08 04:46:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:43,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:46:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654354084] [2025-02-08 04:46:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654354084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:46:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800254268] [2025-02-08 04:46:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:43,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:43,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:43,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:43,634 INFO L87 Difference]: Start difference. First operand 1865 states and 2705 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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-02-08 04:46:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:44,360 INFO L93 Difference]: Finished difference Result 3070 states and 4459 transitions. [2025-02-08 04:46:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:46:44,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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 242 [2025-02-08 04:46:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:44,369 INFO L225 Difference]: With dead ends: 3070 [2025-02-08 04:46:44,370 INFO L226 Difference]: Without dead ends: 1439 [2025-02-08 04:46:44,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:44,374 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 2357 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 1422 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.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 1422 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:46:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-02-08 04:46:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2025-02-08 04:46:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1419 states have (on average 1.4334038054968288) internal successors, (2034), 1423 states have internal predecessors, (2034), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:46:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2063 transitions. [2025-02-08 04:46:44,429 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2063 transitions. Word has length 242 [2025-02-08 04:46:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:44,432 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2063 transitions. [2025-02-08 04:46:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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-02-08 04:46:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2063 transitions. [2025-02-08 04:46:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:46:44,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:44,437 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, 1, 1] [2025-02-08 04:46:44,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:46:44,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1990712232, now seen corresponding path program 1 times [2025-02-08 04:46:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046911911] [2025-02-08 04:46:44,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:46:44,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:46:44,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 04:46:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046911911] [2025-02-08 04:46:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046911911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:46:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:46:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034842122] [2025-02-08 04:46:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:46:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:44,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:46:44,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:46:44,904 INFO L87 Difference]: Start difference. First operand 1439 states and 2063 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-02-08 04:46:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:45,231 INFO L93 Difference]: Finished difference Result 2305 states and 3350 transitions. [2025-02-08 04:46:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:46:45,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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 252 [2025-02-08 04:46:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:45,239 INFO L225 Difference]: With dead ends: 2305 [2025-02-08 04:46:45,239 INFO L226 Difference]: Without dead ends: 1397 [2025-02-08 04:46:45,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:46:45,242 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 30 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:45,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3380 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 04:46:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-02-08 04:46:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1397. [2025-02-08 04:46:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1377 states have (on average 1.421205519244735) internal successors, (1957), 1381 states have internal predecessors, (1957), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 04:46:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1986 transitions. [2025-02-08 04:46:45,294 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1986 transitions. Word has length 252 [2025-02-08 04:46:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:45,294 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1986 transitions. [2025-02-08 04:46:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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-02-08 04:46:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1986 transitions. [2025-02-08 04:46:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-08 04:46:45,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:45,298 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, 1, 1] [2025-02-08 04:46:45,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:46:45,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:45,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 918311345, now seen corresponding path program 1 times [2025-02-08 04:46:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025044542] [2025-02-08 04:46:45,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:45,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:46:45,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:46:45,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:45,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:46:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025044542] [2025-02-08 04:46:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025044542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:46:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792563503] [2025-02-08 04:46:46,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:46,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:46:46,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:46:46,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:46:46,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:46:46,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 04:46:47,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 04:46:47,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:47,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:47,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 04:46:47,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:46:47,747 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-02-08 04:46:47,768 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-02-08 04:46:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:46:47,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:46:47,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792563503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:46:47,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:46:47,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-08 04:46:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035603725] [2025-02-08 04:46:47,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:46:47,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:46:47,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:46:47,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:46:47,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:46:47,790 INFO L87 Difference]: Start difference. First operand 1397 states and 1986 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 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-02-08 04:46:51,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:46:56,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:46:57,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 04:46:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:46:58,023 INFO L93 Difference]: Finished difference Result 2585 states and 3692 transitions. [2025-02-08 04:46:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:46:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 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 252 [2025-02-08 04:46:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:46:58,033 INFO L225 Difference]: With dead ends: 2585 [2025-02-08 04:46:58,033 INFO L226 Difference]: Without dead ends: 1715 [2025-02-08 04:46:58,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 241 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-02-08 04:46:58,037 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 1847 mSDsluCounter, 3504 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 4595 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:46:58,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 4595 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 697 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2025-02-08 04:46:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-02-08 04:46:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1557. [2025-02-08 04:46:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1532 states have (on average 1.4138381201044385) internal successors, (2166), 1536 states have internal predecessors, (2166), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 04:46:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2201 transitions. [2025-02-08 04:46:58,090 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2201 transitions. Word has length 252 [2025-02-08 04:46:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:46:58,091 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2201 transitions. [2025-02-08 04:46:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 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-02-08 04:46:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2201 transitions. [2025-02-08 04:46:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-08 04:46:58,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:46:58,096 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, 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] [2025-02-08 04:46:58,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 04:46:58,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 04:46:58,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:46:58,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:46:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1272112146, now seen corresponding path program 1 times [2025-02-08 04:46:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:46:58,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216661794] [2025-02-08 04:46:58,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:46:58,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-08 04:46:58,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-08 04:46:58,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:46:58,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:46:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:46:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:46:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216661794] [2025-02-08 04:46:59,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216661794] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:46:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510209759] [2025-02-08 04:46:59,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:46:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:46:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:46:59,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:46:59,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:47:00,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-08 04:47:00,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-08 04:47:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:00,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 04:47:00,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:47:00,682 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-02-08 04:47:01,157 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-02-08 04:47:01,171 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-02-08 04:47:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:01,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:47:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510209759] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:47:01,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:47:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-02-08 04:47:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473263317] [2025-02-08 04:47:01,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:47:01,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 04:47:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:01,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 04:47:01,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:47:01,586 INFO L87 Difference]: Start difference. First operand 1557 states and 2201 transitions. Second operand has 12 states, 12 states have (on average 39.916666666666664) internal successors, (479), 12 states have internal predecessors, (479), 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-02-08 04:47:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:02,708 INFO L93 Difference]: Finished difference Result 3812 states and 5338 transitions. [2025-02-08 04:47:02,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 04:47:02,709 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.916666666666664) internal successors, (479), 12 states have internal predecessors, (479), 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 328 [2025-02-08 04:47:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:02,720 INFO L225 Difference]: With dead ends: 3812 [2025-02-08 04:47:02,720 INFO L226 Difference]: Without dead ends: 2489 [2025-02-08 04:47:02,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 646 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-08 04:47:02,726 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 1916 mSDsluCounter, 7039 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 8158 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:02,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 8158 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 04:47:02,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-02-08 04:47:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2205. [2025-02-08 04:47:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2168 states have (on average 1.3874538745387455) internal successors, (3008), 2172 states have internal predecessors, (3008), 31 states have call successors, (31), 6 states have call predecessors, (31), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 04:47:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3065 transitions. [2025-02-08 04:47:02,801 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3065 transitions. Word has length 328 [2025-02-08 04:47:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:02,802 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3065 transitions. [2025-02-08 04:47:02,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.916666666666664) internal successors, (479), 12 states have internal predecessors, (479), 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-02-08 04:47:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3065 transitions. [2025-02-08 04:47:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2025-02-08 04:47:02,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:02,818 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, 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, 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-02-08 04:47:02,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 04:47:03,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:03,019 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:03,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -579105245, now seen corresponding path program 1 times [2025-02-08 04:47:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507488870] [2025-02-08 04:47:03,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-02-08 04:47:03,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-02-08 04:47:03,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:03,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507488870] [2025-02-08 04:47:09,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507488870] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:47:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16713593] [2025-02-08 04:47:09,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:09,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:47:09,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:47:09,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 04:47:09,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 766 statements into 1 equivalence classes. [2025-02-08 04:47:10,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 766 of 766 statements. [2025-02-08 04:47:10,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:10,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 3729 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:47:10,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:47:10,481 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-02-08 04:47:10,885 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-02-08 04:47:11,114 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-02-08 04:47:11,317 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-02-08 04:47:11,521 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-02-08 04:47:11,531 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-02-08 04:47:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:11,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:47:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:47:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16713593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:47:12,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:47:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-02-08 04:47:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602384387] [2025-02-08 04:47:12,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:47:12,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 04:47:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:12,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 04:47:12,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-02-08 04:47:12,484 INFO L87 Difference]: Start difference. First operand 2205 states and 3065 transitions. Second operand has 20 states, 20 states have (on average 68.0) internal successors, (1360), 20 states have internal predecessors, (1360), 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-02-08 04:47:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:14,076 INFO L93 Difference]: Finished difference Result 5546 states and 7663 transitions. [2025-02-08 04:47:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 04:47:14,077 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 68.0) internal successors, (1360), 20 states have internal predecessors, (1360), 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 766 [2025-02-08 04:47:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:14,099 INFO L225 Difference]: With dead ends: 5546 [2025-02-08 04:47:14,099 INFO L226 Difference]: Without dead ends: 4223 [2025-02-08 04:47:14,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1553 GetRequests, 1518 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2025-02-08 04:47:14,105 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 5241 mSDsluCounter, 8118 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5279 SdHoareTripleChecker+Valid, 9237 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:14,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5279 Valid, 9237 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 04:47:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-08 04:47:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 3939. [2025-02-08 04:47:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3878 states have (on average 1.3620422898401239) internal successors, (5282), 3882 states have internal predecessors, (5282), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:47:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5387 transitions. [2025-02-08 04:47:14,255 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5387 transitions. Word has length 766 [2025-02-08 04:47:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:14,257 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5387 transitions. [2025-02-08 04:47:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 68.0) internal successors, (1360), 20 states have internal predecessors, (1360), 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-02-08 04:47:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5387 transitions. [2025-02-08 04:47:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1643 [2025-02-08 04:47:14,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:14,334 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, 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, 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-02-08 04:47:14,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 04:47:14,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:47:14,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:14,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash 362997069, now seen corresponding path program 2 times [2025-02-08 04:47:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362656689] [2025-02-08 04:47:14,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:47:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:15,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1642 statements into 2 equivalence classes. [2025-02-08 04:47:15,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1642 statements. [2025-02-08 04:47:15,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 04:47:15,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:47:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362656689] [2025-02-08 04:47:15,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362656689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:15,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:47:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015993968] [2025-02-08 04:47:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:47:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:15,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:47:15,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:47:15,254 INFO L87 Difference]: Start difference. First operand 3939 states and 5387 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 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-02-08 04:47:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:16,182 INFO L93 Difference]: Finished difference Result 4793 states and 6653 transitions. [2025-02-08 04:47:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:47:16,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 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 1642 [2025-02-08 04:47:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:16,198 INFO L225 Difference]: With dead ends: 4793 [2025-02-08 04:47:16,199 INFO L226 Difference]: Without dead ends: 3954 [2025-02-08 04:47:16,201 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-02-08 04:47:16,204 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 53 mSDsluCounter, 5371 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6510 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.8s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:16,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6510 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 04:47:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2025-02-08 04:47:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3950. [2025-02-08 04:47:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3950 states, 3889 states have (on average 1.3610182566212394) internal successors, (5293), 3893 states have internal predecessors, (5293), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:47:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 5398 transitions. [2025-02-08 04:47:16,309 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 5398 transitions. Word has length 1642 [2025-02-08 04:47:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 3950 states and 5398 transitions. [2025-02-08 04:47:16,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 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-02-08 04:47:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 5398 transitions. [2025-02-08 04:47:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-08 04:47:16,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:16,334 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, 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, 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-02-08 04:47:16,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:47:16,335 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:16,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1016516437, now seen corresponding path program 1 times [2025-02-08 04:47:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:16,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997416485] [2025-02-08 04:47:16,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:16,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1643 statements into 1 equivalence classes. [2025-02-08 04:47:17,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1643 of 1643 statements. [2025-02-08 04:47:17,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:17,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:47:22,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997416485] [2025-02-08 04:47:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997416485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:22,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:22,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:47:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988584074] [2025-02-08 04:47:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:47:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:22,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:47:22,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:47:22,171 INFO L87 Difference]: Start difference. First operand 3950 states and 5398 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-02-08 04:47:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:22,810 INFO L93 Difference]: Finished difference Result 4793 states and 6648 transitions. [2025-02-08 04:47:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:47:22,810 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 1643 [2025-02-08 04:47:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:22,836 INFO L225 Difference]: With dead ends: 4793 [2025-02-08 04:47:22,836 INFO L226 Difference]: Without dead ends: 3955 [2025-02-08 04:47:22,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:47:22,842 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 20 mSDsluCounter, 5356 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6501 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.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:22,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6501 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:47:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-02-08 04:47:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3954. [2025-02-08 04:47:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3893 states have (on average 1.3609041870023117) internal successors, (5298), 3897 states have internal predecessors, (5298), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:47:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 5403 transitions. [2025-02-08 04:47:22,969 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 5403 transitions. Word has length 1643 [2025-02-08 04:47:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 5403 transitions. [2025-02-08 04:47:22,972 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-02-08 04:47:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 5403 transitions. [2025-02-08 04:47:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-08 04:47:22,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:22,995 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, 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, 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-02-08 04:47:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 04:47:22,996 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1562900964, now seen corresponding path program 1 times [2025-02-08 04:47:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:22,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123929826] [2025-02-08 04:47:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:23,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1643 statements into 1 equivalence classes. [2025-02-08 04:47:24,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1643 of 1643 statements. [2025-02-08 04:47:24,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:24,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:47:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123929826] [2025-02-08 04:47:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123929826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 04:47:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162239718] [2025-02-08 04:47:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:47:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:27,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:47:27,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:47:27,356 INFO L87 Difference]: Start difference. First operand 3954 states and 5403 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-02-08 04:47:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:28,021 INFO L93 Difference]: Finished difference Result 4791 states and 6644 transitions. [2025-02-08 04:47:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:47:28,021 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 1643 [2025-02-08 04:47:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:28,031 INFO L225 Difference]: With dead ends: 4791 [2025-02-08 04:47:28,031 INFO L226 Difference]: Without dead ends: 3962 [2025-02-08 04:47:28,033 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-02-08 04:47:28,034 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 24 mSDsluCounter, 6454 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7593 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:47:28,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7593 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:47:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2025-02-08 04:47:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3954. [2025-02-08 04:47:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3893 states have (on average 1.3609041870023117) internal successors, (5298), 3897 states have internal predecessors, (5298), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:47:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 5403 transitions. [2025-02-08 04:47:28,121 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 5403 transitions. Word has length 1643 [2025-02-08 04:47:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:28,123 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 5403 transitions. [2025-02-08 04:47:28,123 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-02-08 04:47:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 5403 transitions. [2025-02-08 04:47:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-08 04:47:28,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:28,145 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, 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, 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-02-08 04:47:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 04:47:28,146 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1820765940, now seen corresponding path program 1 times [2025-02-08 04:47:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590794144] [2025-02-08 04:47:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:28,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-08 04:47:29,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-08 04:47:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:47:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:47:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-08 04:47:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:47:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590794144] [2025-02-08 04:47:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590794144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:47:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:47:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:47:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719611557] [2025-02-08 04:47:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:47:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:47:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:47:32,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:47:32,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:47:32,790 INFO L87 Difference]: Start difference. First operand 3954 states and 5403 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 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-02-08 04:47:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:47:33,525 INFO L93 Difference]: Finished difference Result 4799 states and 6655 transitions. [2025-02-08 04:47:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:47:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 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 1644 [2025-02-08 04:47:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:47:33,535 INFO L225 Difference]: With dead ends: 4799 [2025-02-08 04:47:33,535 INFO L226 Difference]: Without dead ends: 3965 [2025-02-08 04:47:33,537 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-02-08 04:47:33,538 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 31 mSDsluCounter, 7603 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8742 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-02-08 04:47:33,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8742 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:47:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-02-08 04:47:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3962. [2025-02-08 04:47:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3901 states have (on average 1.3606767495513972) internal successors, (5308), 3905 states have internal predecessors, (5308), 55 states have call successors, (55), 6 states have call predecessors, (55), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-08 04:47:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 5413 transitions. [2025-02-08 04:47:33,622 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 5413 transitions. Word has length 1644 [2025-02-08 04:47:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:47:33,624 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 5413 transitions. [2025-02-08 04:47:33,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 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-02-08 04:47:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 5413 transitions. [2025-02-08 04:47:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-08 04:47:33,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:47:33,647 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, 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, 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-02-08 04:47:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 04:47:33,647 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:47:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:47:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash -758191519, now seen corresponding path program 1 times [2025-02-08 04:47:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:47:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117261560] [2025-02-08 04:47:33,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:47:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:47:34,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes.