./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:53:42,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:53:42,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:53:42,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:53:42,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:53:42,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:53:42,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:53:42,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:53:42,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:53:42,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:53:42,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:53:42,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:53:42,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:53:42,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:53:42,986 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:53:42,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:53:42,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:53:42,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:53:42,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:53:42,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:53:42,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:53:42,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:53:42,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:53:42,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:53:42,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:53:42,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:53:42,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:53:42,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:53:42,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:53:42,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:53:42,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:53:42,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:53:42,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:53:42,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:53:42,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:53:42,990 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 -> 1c32e831c11e67575bf9fc4420a056c0795572e7218bcd99a0067a1a2caea6f7 [2025-01-09 20:53:43,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:53:43,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:53:43,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:53:43,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:53:43,254 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:53:43,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2025-01-09 20:53:44,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db2309d6/edf444833ad84ddd9822825c235d4df9/FLAGbca646986 [2025-01-09 20:53:45,071 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:53:45,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i [2025-01-09 20:53:45,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db2309d6/edf444833ad84ddd9822825c235d4df9/FLAGbca646986 [2025-01-09 20:53:45,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db2309d6/edf444833ad84ddd9822825c235d4df9 [2025-01-09 20:53:45,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:53:45,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:53:45,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:53:45,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:53:45,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:53:45,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:45,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45, skipping insertion in model container [2025-01-09 20:53:45,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:45,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:53:45,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i[33022,33035] [2025-01-09 20:53:45,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:53:45,747 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:53:45,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-1.i[33022,33035] [2025-01-09 20:53:45,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:53:45,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:53:45,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45 WrapperNode [2025-01-09 20:53:45,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:53:45,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:53:45,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:53:45,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:53:45,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:45,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,082 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3305 [2025-01-09 20:53:46,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:53:46,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:53:46,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:53:46,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:53:46,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,286 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-01-09 20:53:46,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:53:46,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:53:46,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:53:46,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:53:46,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (1/1) ... [2025-01-09 20:53:46,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:53:46,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:46,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:53:46,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:53:46,506 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-01-09 20:53:46,507 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-01-09 20:53:46,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:53:46,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:53:46,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:53:46,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:53:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:53:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:53:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:53:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:53:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:53:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:53:46,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:53:46,508 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:53:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:53:46,509 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:53:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:53:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:53:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:53:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:53:46,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:53:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:53:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:53:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:53:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:53:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:53:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:53:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:53:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:53:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:53:46,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:53:46,814 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:53:46,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:53:49,545 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-01-09 20:53:49,546 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:53:49,590 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:53:49,591 INFO L312 CfgBuilder]: Removed 73 assume(true) statements. [2025-01-09 20:53:49,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:49 BoogieIcfgContainer [2025-01-09 20:53:49,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:53:49,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:53:49,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:53:49,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:53:49,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:53:45" (1/3) ... [2025-01-09 20:53:49,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da51b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:53:49, skipping insertion in model container [2025-01-09 20:53:49,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:53:45" (2/3) ... [2025-01-09 20:53:49,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da51b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:53:49, skipping insertion in model container [2025-01-09 20:53:49,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:53:49" (3/3) ... [2025-01-09 20:53:49,602 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-1.i [2025-01-09 20:53:49,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:53:49,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test10-1.i that has 6 procedures, 1033 locations, 1 initial locations, 84 loop locations, and 1 error locations. [2025-01-09 20:53:49,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:53:49,711 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;@497c899d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:53:49,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 20:53:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 1025 states, 1006 states have (on average 1.6192842942345924) internal successors, (1629), 1011 states have internal predecessors, (1629), 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-01-09 20:53:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 20:53:49,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:49,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:53:49,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:49,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1723360003, now seen corresponding path program 1 times [2025-01-09 20:53:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126480822] [2025-01-09 20:53:49,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:49,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 20:53:49,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 20:53:49,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:49,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:53:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126480822] [2025-01-09 20:53:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126480822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:49,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:53:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865837255] [2025-01-09 20:53:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:53:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:49,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:53:49,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:53:49,931 INFO L87 Difference]: Start difference. First operand has 1025 states, 1006 states have (on average 1.6192842942345924) internal successors, (1629), 1011 states have internal predecessors, (1629), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:53:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:50,047 INFO L93 Difference]: Finished difference Result 2048 states and 3320 transitions. [2025-01-09 20:53:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:53:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 20:53:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:50,069 INFO L225 Difference]: With dead ends: 2048 [2025-01-09 20:53:50,073 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 20:53:50,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:53:50,083 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:50,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:53:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 20:53:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-01-09 20:53:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1003 states have (on average 1.4745762711864407) internal successors, (1479), 1008 states have internal predecessors, (1479), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:53:50,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1506 transitions. [2025-01-09 20:53:50,193 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1506 transitions. Word has length 13 [2025-01-09 20:53:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:50,193 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1506 transitions. [2025-01-09 20:53:50,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:53:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1506 transitions. [2025-01-09 20:53:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:53:50,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:50,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:53:50,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:53:50,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:50,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash 510275967, now seen corresponding path program 1 times [2025-01-09 20:53:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138309338] [2025-01-09 20:53:50,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:50,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:53:50,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:53:50,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:50,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:53:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:50,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138309338] [2025-01-09 20:53:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138309338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:50,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:53:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652422133] [2025-01-09 20:53:50,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:50,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:53:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:50,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:53:50,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:53:50,743 INFO L87 Difference]: Start difference. First operand 1021 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:53:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:50,994 INFO L93 Difference]: Finished difference Result 2036 states and 3006 transitions. [2025-01-09 20:53:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:53:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67 [2025-01-09 20:53:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:51,009 INFO L225 Difference]: With dead ends: 2036 [2025-01-09 20:53:51,009 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:53:51,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:53:51,012 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 547 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:51,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 4440 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:53:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1023. [2025-01-09 20:53:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:53:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2025-01-09 20:53:51,088 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 67 [2025-01-09 20:53:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:51,088 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2025-01-09 20:53:51,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:53:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2025-01-09 20:53:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 20:53:51,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:51,095 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] [2025-01-09 20:53:51,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:53:51,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1780084375, now seen corresponding path program 1 times [2025-01-09 20:53:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584167402] [2025-01-09 20:53:51,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:51,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 20:53:51,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 20:53:51,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:51,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:53:51,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584167402] [2025-01-09 20:53:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584167402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:51,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:51,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:53:51,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447174403] [2025-01-09 20:53:51,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:53:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:51,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:53:51,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:53:51,652 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-01-09 20:53:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:51,826 INFO L93 Difference]: Finished difference Result 2425 states and 3570 transitions. [2025-01-09 20:53:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:53:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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 144 [2025-01-09 20:53:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:51,833 INFO L225 Difference]: With dead ends: 2425 [2025-01-09 20:53:51,833 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:53:51,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:53:51,836 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 542 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4534 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:51,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4534 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:53:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1027. [2025-01-09 20:53:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1009 states have (on average 1.4717542120911793) internal successors, (1485), 1014 states have internal predecessors, (1485), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:53:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1512 transitions. [2025-01-09 20:53:51,878 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1512 transitions. Word has length 144 [2025-01-09 20:53:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:51,878 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1512 transitions. [2025-01-09 20:53:51,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-01-09 20:53:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1512 transitions. [2025-01-09 20:53:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:53:51,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:51,883 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, 1, 1] [2025-01-09 20:53:51,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:53:51,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:51,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2142580396, now seen corresponding path program 1 times [2025-01-09 20:53:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:51,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529423830] [2025-01-09 20:53:51,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:52,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:53:52,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:53:52,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:52,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:53:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:52,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529423830] [2025-01-09 20:53:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529423830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:52,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:53:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619625870] [2025-01-09 20:53:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:52,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:53:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:52,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:53:52,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:53:52,420 INFO L87 Difference]: Start difference. First operand 1027 states and 1512 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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-01-09 20:53:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:52,539 INFO L93 Difference]: Finished difference Result 2004 states and 2950 transitions. [2025-01-09 20:53:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:53:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 214 [2025-01-09 20:53:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:52,545 INFO L225 Difference]: With dead ends: 2004 [2025-01-09 20:53:52,546 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 20:53:52,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:53:52,549 INFO L435 NwaCegarLoop]: 1404 mSDtfsCounter, 12 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5587 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:52,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5587 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 20:53:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 20:53:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 967 states have (on average 1.4560496380558428) internal successors, (1408), 972 states have internal predecessors, (1408), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:53:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1435 transitions. [2025-01-09 20:53:52,582 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1435 transitions. Word has length 214 [2025-01-09 20:53:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:52,583 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1435 transitions. [2025-01-09 20:53:52,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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-01-09 20:53:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1435 transitions. [2025-01-09 20:53:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:53:52,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:52,590 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, 1, 1] [2025-01-09 20:53:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:53:52,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1317480158, now seen corresponding path program 1 times [2025-01-09 20:53:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351908919] [2025-01-09 20:53:52,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:52,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:53:52,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:53:52,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:52,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:53:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351908919] [2025-01-09 20:53:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351908919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:53:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957644166] [2025-01-09 20:53:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:53:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:53:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:53:52,960 INFO L87 Difference]: Start difference. First operand 985 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:53:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:53,029 INFO L93 Difference]: Finished difference Result 1962 states and 2862 transitions. [2025-01-09 20:53:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:53:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 214 [2025-01-09 20:53:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:53,036 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 20:53:53,037 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 20:53:53,038 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-01-09 20:53:53,041 INFO L435 NwaCegarLoop]: 1417 mSDtfsCounter, 1 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:53,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2812 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:53:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 20:53:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 20:53:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 967 states have (on average 1.452947259565667) internal successors, (1405), 972 states have internal predecessors, (1405), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 20:53:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1432 transitions. [2025-01-09 20:53:53,073 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1432 transitions. Word has length 214 [2025-01-09 20:53:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1432 transitions. [2025-01-09 20:53:53,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:53:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1432 transitions. [2025-01-09 20:53:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 20:53:53,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:53,077 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, 1, 1] [2025-01-09 20:53:53,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:53:53,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:53,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:53,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1141851106, now seen corresponding path program 1 times [2025-01-09 20:53:53,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:53,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915025792] [2025-01-09 20:53:53,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:53,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:53,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 20:53:53,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 20:53:53,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:53,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:53:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915025792] [2025-01-09 20:53:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915025792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:53:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745656995] [2025-01-09 20:53:53,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:53:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:53,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:53:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:53:53,357 INFO L87 Difference]: Start difference. First operand 985 states and 1432 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:53:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:53,497 INFO L93 Difference]: Finished difference Result 2489 states and 3632 transitions. [2025-01-09 20:53:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:53:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 214 [2025-01-09 20:53:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:53,507 INFO L225 Difference]: With dead ends: 2489 [2025-01-09 20:53:53,507 INFO L226 Difference]: Without dead ends: 1512 [2025-01-09 20:53:53,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:53:53,510 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 713 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:53,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2824 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-01-09 20:53:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1354. [2025-01-09 20:53:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1334 states have (on average 1.4550224887556222) internal successors, (1941), 1339 states have internal predecessors, (1941), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:53:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1972 transitions. [2025-01-09 20:53:53,553 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1972 transitions. Word has length 214 [2025-01-09 20:53:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:53,553 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1972 transitions. [2025-01-09 20:53:53,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-09 20:53:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1972 transitions. [2025-01-09 20:53:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:53:53,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:53,556 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, 1, 1] [2025-01-09 20:53:53,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:53:53,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:53,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1680647632, now seen corresponding path program 1 times [2025-01-09 20:53:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162909347] [2025-01-09 20:53:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:53,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:53:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:53:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:53:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162909347] [2025-01-09 20:53:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162909347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:53:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291280029] [2025-01-09 20:53:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:54,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:53:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:54,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:53:54,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:53:54,073 INFO L87 Difference]: Start difference. First operand 1354 states and 1972 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-09 20:53:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:54,195 INFO L93 Difference]: Finished difference Result 2574 states and 3758 transitions. [2025-01-09 20:53:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:53:54,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 229 [2025-01-09 20:53:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:54,203 INFO L225 Difference]: With dead ends: 2574 [2025-01-09 20:53:54,203 INFO L226 Difference]: Without dead ends: 1312 [2025-01-09 20:53:54,206 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-01-09 20:53:54,206 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 30 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:54,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3947 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-01-09 20:53:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2025-01-09 20:53:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1292 states have (on average 1.4427244582043344) internal successors, (1864), 1297 states have internal predecessors, (1864), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:53:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1895 transitions. [2025-01-09 20:53:54,247 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1895 transitions. Word has length 229 [2025-01-09 20:53:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:54,248 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1895 transitions. [2025-01-09 20:53:54,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-01-09 20:53:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1895 transitions. [2025-01-09 20:53:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:53:54,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:54,251 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, 1, 1] [2025-01-09 20:53:54,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:53:54,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:54,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash -307297116, now seen corresponding path program 1 times [2025-01-09 20:53:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48604495] [2025-01-09 20:53:54,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:54,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:54,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:53:54,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:53:54,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:54,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:53:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48604495] [2025-01-09 20:53:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48604495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:54,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:53:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692181364] [2025-01-09 20:53:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:54,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:53:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:54,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:53:54,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:53:54,611 INFO L87 Difference]: Start difference. First operand 1312 states and 1895 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:53:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:54,685 INFO L93 Difference]: Finished difference Result 2532 states and 3670 transitions. [2025-01-09 20:53:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:53:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 229 [2025-01-09 20:53:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:54,693 INFO L225 Difference]: With dead ends: 2532 [2025-01-09 20:53:54,694 INFO L226 Difference]: Without dead ends: 1312 [2025-01-09 20:53:54,697 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-01-09 20:53:54,697 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 1 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:54,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2646 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:53:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-01-09 20:53:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2025-01-09 20:53:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1292 states have (on average 1.4404024767801857) internal successors, (1861), 1297 states have internal predecessors, (1861), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:53:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1892 transitions. [2025-01-09 20:53:54,736 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1892 transitions. Word has length 229 [2025-01-09 20:53:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1892 transitions. [2025-01-09 20:53:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:53:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1892 transitions. [2025-01-09 20:53:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 20:53:54,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:54,741 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, 1, 1] [2025-01-09 20:53:54,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:53:54,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:54,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash -778653466, now seen corresponding path program 1 times [2025-01-09 20:53:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880791481] [2025-01-09 20:53:54,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:54,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 20:53:54,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 20:53:54,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:54,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:53:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880791481] [2025-01-09 20:53:55,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880791481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:55,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:55,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:53:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544339738] [2025-01-09 20:53:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:55,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:53:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:55,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:53:55,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:53:55,059 INFO L87 Difference]: Start difference. First operand 1312 states and 1892 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:53:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:55,176 INFO L93 Difference]: Finished difference Result 3099 states and 4491 transitions. [2025-01-09 20:53:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:53:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 229 [2025-01-09 20:53:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:55,188 INFO L225 Difference]: With dead ends: 3099 [2025-01-09 20:53:55,189 INFO L226 Difference]: Without dead ends: 1879 [2025-01-09 20:53:55,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:53:55,193 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 595 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:55,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2858 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-01-09 20:53:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1874. [2025-01-09 20:53:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1848 states have (on average 1.4442640692640694) internal successors, (2669), 1853 states have internal predecessors, (2669), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:53:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2712 transitions. [2025-01-09 20:53:55,305 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2712 transitions. Word has length 229 [2025-01-09 20:53:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:55,305 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2712 transitions. [2025-01-09 20:53:55,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-09 20:53:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2712 transitions. [2025-01-09 20:53:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 20:53:55,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:55,309 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] [2025-01-09 20:53:55,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:53:55,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1805594355, now seen corresponding path program 1 times [2025-01-09 20:53:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:55,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317598608] [2025-01-09 20:53:55,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:55,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 20:53:55,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 20:53:55,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:55,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:53:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317598608] [2025-01-09 20:53:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317598608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:55,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:55,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:53:55,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941239328] [2025-01-09 20:53:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:55,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:53:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:55,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:53:55,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:53:55,725 INFO L87 Difference]: Start difference. First operand 1874 states and 2712 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-01-09 20:53:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:56,315 INFO L93 Difference]: Finished difference Result 4047 states and 5902 transitions. [2025-01-09 20:53:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:53:56,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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 244 [2025-01-09 20:53:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:56,328 INFO L225 Difference]: With dead ends: 4047 [2025-01-09 20:53:56,328 INFO L226 Difference]: Without dead ends: 2410 [2025-01-09 20:53:56,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:53:56,332 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 3526 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3531 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:56,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3531 Valid, 2969 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:53:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2025-01-09 20:53:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 1448. [2025-01-09 20:53:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1427 states have (on average 1.4274702172389628) internal successors, (2037), 1432 states have internal predecessors, (2037), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:53:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2070 transitions. [2025-01-09 20:53:56,392 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2070 transitions. Word has length 244 [2025-01-09 20:53:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:56,393 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 2070 transitions. [2025-01-09 20:53:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-01-09 20:53:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2070 transitions. [2025-01-09 20:53:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 20:53:56,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:56,397 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, 1, 1] [2025-01-09 20:53:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:53:56,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1698689796, now seen corresponding path program 1 times [2025-01-09 20:53:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127618457] [2025-01-09 20:53:56,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:56,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:53:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:53:56,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:56,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 20:53:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127618457] [2025-01-09 20:53:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127618457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:53:56,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:53:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:53:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842004300] [2025-01-09 20:53:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:53:56,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:53:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:56,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:53:56,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:53:56,862 INFO L87 Difference]: Start difference. First operand 1448 states and 2070 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-09 20:53:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:53:56,964 INFO L93 Difference]: Finished difference Result 2317 states and 3364 transitions. [2025-01-09 20:53:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:53:56,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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 254 [2025-01-09 20:53:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:53:56,972 INFO L225 Difference]: With dead ends: 2317 [2025-01-09 20:53:56,972 INFO L226 Difference]: Without dead ends: 1406 [2025-01-09 20:53:56,974 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-01-09 20:53:56,975 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 30 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:53:56,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3692 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:53:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-01-09 20:53:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2025-01-09 20:53:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1385 states have (on average 1.4151624548736461) internal successors, (1960), 1390 states have internal predecessors, (1960), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:53:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1993 transitions. [2025-01-09 20:53:57,022 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1993 transitions. Word has length 254 [2025-01-09 20:53:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:53:57,023 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 1993 transitions. [2025-01-09 20:53:57,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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-01-09 20:53:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1993 transitions. [2025-01-09 20:53:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 20:53:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:53:57,027 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, 1, 1] [2025-01-09 20:53:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:53:57,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:53:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:53:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -216284688, now seen corresponding path program 1 times [2025-01-09 20:53:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:53:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272090326] [2025-01-09 20:53:57,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:53:57,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:53:57,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:53:57,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:57,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:53:58,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:53:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272090326] [2025-01-09 20:53:58,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272090326] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:53:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090085886] [2025-01-09 20:53:58,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:53:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:53:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:53:58,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:53:58,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:53:58,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 20:53:58,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 20:53:58,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:53:58,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:53:58,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:53:58,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:53:58,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:53:59,361 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 19 treesize of output 11 [2025-01-09 20:53:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:53:59,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:53:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:53:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090085886] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:53:59,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:53:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-01-09 20:53:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285322152] [2025-01-09 20:53:59,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:53:59,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:53:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:53:59,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:53:59,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:53:59,732 INFO L87 Difference]: Start difference. First operand 1406 states and 1993 transitions. Second operand has 12 states, 12 states have (on average 46.333333333333336) internal successors, (556), 12 states have internal predecessors, (556), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:00,316 INFO L93 Difference]: Finished difference Result 3221 states and 4533 transitions. [2025-01-09 20:54:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:54:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 46.333333333333336) internal successors, (556), 12 states have internal predecessors, (556), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 254 [2025-01-09 20:54:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:00,330 INFO L225 Difference]: With dead ends: 3221 [2025-01-09 20:54:00,330 INFO L226 Difference]: Without dead ends: 2348 [2025-01-09 20:54:00,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 496 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:54:00,333 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 2821 mSDsluCounter, 8552 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 10119 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:00,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 10119 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:54:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-01-09 20:54:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2058. [2025-01-09 20:54:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2025 states have (on average 1.3837037037037037) internal successors, (2802), 2030 states have internal predecessors, (2802), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 20:54:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2857 transitions. [2025-01-09 20:54:00,412 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2857 transitions. Word has length 254 [2025-01-09 20:54:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:00,412 INFO L471 AbstractCegarLoop]: Abstraction has 2058 states and 2857 transitions. [2025-01-09 20:54:00,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 46.333333333333336) internal successors, (556), 12 states have internal predecessors, (556), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2857 transitions. [2025-01-09 20:54:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 20:54:00,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:00,444 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:54:00,457 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-01-09 20:54:00,645 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,SelfDestructingSolverStorable11 [2025-01-09 20:54:00,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:00,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash -973955916, now seen corresponding path program 1 times [2025-01-09 20:54:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796651617] [2025-01-09 20:54:00,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:00,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 20:54:00,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 20:54:00,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 235 proven. 6 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 20:54:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:02,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796651617] [2025-01-09 20:54:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796651617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254641715] [2025-01-09 20:54:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:02,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:02,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:54:02,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:54:03,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 20:54:03,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 20:54:03,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:03,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:54:03,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:03,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:54:04,219 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 19 treesize of output 11 [2025-01-09 20:54:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 235 proven. 6 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 20:54:04,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 235 proven. 6 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 20:54:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254641715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:04,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2025-01-09 20:54:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755054776] [2025-01-09 20:54:04,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:04,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 20:54:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:04,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 20:54:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:54:04,605 INFO L87 Difference]: Start difference. First operand 2058 states and 2857 transitions. Second operand has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:05,269 INFO L93 Difference]: Finished difference Result 3959 states and 5510 transitions. [2025-01-09 20:54:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 20:54:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 485 [2025-01-09 20:54:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:05,281 INFO L225 Difference]: With dead ends: 3959 [2025-01-09 20:54:05,281 INFO L226 Difference]: Without dead ends: 2348 [2025-01-09 20:54:05,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 959 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-01-09 20:54:05,286 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1766 mSDsluCounter, 11053 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 12646 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:05,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 12646 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:54:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-01-09 20:54:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2062. [2025-01-09 20:54:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 2029 states have (on average 1.381961557417447) internal successors, (2804), 2034 states have internal predecessors, (2804), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 20:54:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2859 transitions. [2025-01-09 20:54:05,379 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2859 transitions. Word has length 485 [2025-01-09 20:54:05,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:05,379 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 2859 transitions. [2025-01-09 20:54:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2859 transitions. [2025-01-09 20:54:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-01-09 20:54:05,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:05,396 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-01-09 20:54:05,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:54:05,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:05,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:05,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash -862071795, now seen corresponding path program 1 times [2025-01-09 20:54:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:05,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197701296] [2025-01-09 20:54:05,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:05,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 20:54:06,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 20:54:06,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:06,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 878 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:10,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197701296] [2025-01-09 20:54:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197701296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:10,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793211847] [2025-01-09 20:54:10,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:10,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:10,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:10,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:54:10,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:54:11,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-01-09 20:54:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-01-09 20:54:11,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:11,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 20:54:11,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:11,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:54:12,110 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 19 treesize of output 11 [2025-01-09 20:54:12,319 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 19 treesize of output 11 [2025-01-09 20:54:12,499 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 19 treesize of output 11 [2025-01-09 20:54:12,689 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 19 treesize of output 11 [2025-01-09 20:54:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 878 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:12,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 878 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793211847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:13,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2025-01-09 20:54:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574980396] [2025-01-09 20:54:13,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:13,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 20:54:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:13,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 20:54:13,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-01-09 20:54:13,545 INFO L87 Difference]: Start difference. First operand 2062 states and 2859 transitions. Second operand has 24 states, 24 states have (on average 78.29166666666667) internal successors, (1879), 24 states have internal predecessors, (1879), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:14,594 INFO L93 Difference]: Finished difference Result 4973 states and 6861 transitions. [2025-01-09 20:54:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:54:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 78.29166666666667) internal successors, (1879), 24 states have internal predecessors, (1879), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 695 [2025-01-09 20:54:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:14,620 INFO L225 Difference]: With dead ends: 4973 [2025-01-09 20:54:14,620 INFO L226 Difference]: Without dead ends: 4100 [2025-01-09 20:54:14,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1413 GetRequests, 1375 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 20:54:14,624 INFO L435 NwaCegarLoop]: 2698 mSDtfsCounter, 6375 mSDsluCounter, 21250 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6414 SdHoareTripleChecker+Valid, 23948 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:14,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6414 Valid, 23948 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 20:54:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2025-01-09 20:54:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3810. [2025-01-09 20:54:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3810 states, 3753 states have (on average 1.3533173461231016) internal successors, (5079), 3758 states have internal predecessors, (5079), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:54:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 5182 transitions. [2025-01-09 20:54:14,736 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 5182 transitions. Word has length 695 [2025-01-09 20:54:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:14,737 INFO L471 AbstractCegarLoop]: Abstraction has 3810 states and 5182 transitions. [2025-01-09 20:54:14,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 78.29166666666667) internal successors, (1879), 24 states have internal predecessors, (1879), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 5182 transitions. [2025-01-09 20:54:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2025-01-09 20:54:14,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:14,778 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 6, 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-01-09 20:54:14,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 20:54:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:14,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash 248451277, now seen corresponding path program 1 times [2025-01-09 20:54:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134758621] [2025-01-09 20:54:14,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-01-09 20:54:15,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-01-09 20:54:15,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:15,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1852 proven. 894 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-09 20:54:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134758621] [2025-01-09 20:54:21,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134758621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421278100] [2025-01-09 20:54:21,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:21,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:21,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:21,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:54:21,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:54:22,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-01-09 20:54:23,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-01-09 20:54:23,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:23,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 20:54:23,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:23,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:54:23,890 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 19 treesize of output 11 [2025-01-09 20:54:24,066 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 19 treesize of output 11 [2025-01-09 20:54:24,217 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 19 treesize of output 11 [2025-01-09 20:54:24,364 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 19 treesize of output 11 [2025-01-09 20:54:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1852 proven. 894 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-09 20:54:24,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1852 proven. 894 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-09 20:54:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421278100] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:25,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:25,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2025-01-09 20:54:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796787885] [2025-01-09 20:54:25,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:25,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 20:54:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:25,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 20:54:25,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-01-09 20:54:25,053 INFO L87 Difference]: Start difference. First operand 3810 states and 5182 transitions. Second operand has 25 states, 25 states have (on average 78.76) internal successors, (1969), 25 states have internal predecessors, (1969), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:25,874 INFO L93 Difference]: Finished difference Result 6587 states and 8999 transitions. [2025-01-09 20:54:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 20:54:25,875 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 78.76) internal successors, (1969), 25 states have internal predecessors, (1969), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1157 [2025-01-09 20:54:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:25,892 INFO L225 Difference]: With dead ends: 6587 [2025-01-09 20:54:25,892 INFO L226 Difference]: Without dead ends: 4100 [2025-01-09 20:54:25,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2344 GetRequests, 2300 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 20:54:25,899 INFO L435 NwaCegarLoop]: 2721 mSDtfsCounter, 4481 mSDsluCounter, 21833 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4519 SdHoareTripleChecker+Valid, 24554 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:25,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4519 Valid, 24554 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:54:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2025-01-09 20:54:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3814. [2025-01-09 20:54:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3757 states have (on average 1.3516103273888742) internal successors, (5078), 3762 states have internal predecessors, (5078), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:54:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 5181 transitions. [2025-01-09 20:54:25,998 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 5181 transitions. Word has length 1157 [2025-01-09 20:54:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:26,000 INFO L471 AbstractCegarLoop]: Abstraction has 3814 states and 5181 transitions. [2025-01-09 20:54:26,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 78.76) internal successors, (1969), 25 states have internal predecessors, (1969), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 5181 transitions. [2025-01-09 20:54:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2025-01-09 20:54:26,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:26,020 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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-01-09 20:54:26,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:54:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 20:54:26,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1146861933, now seen corresponding path program 2 times [2025-01-09 20:54:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161483445] [2025-01-09 20:54:26,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:54:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:26,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1577 statements into 2 equivalence classes. [2025-01-09 20:54:26,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1577 statements. [2025-01-09 20:54:26,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:54:26,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6623 trivial. 0 not checked. [2025-01-09 20:54:26,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:26,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161483445] [2025-01-09 20:54:26,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161483445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:26,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:26,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:54:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323069143] [2025-01-09 20:54:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:26,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:54:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:26,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:54:26,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:54:26,999 INFO L87 Difference]: Start difference. First operand 3814 states and 5181 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-01-09 20:54:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:27,541 INFO L93 Difference]: Finished difference Result 4661 states and 6438 transitions. [2025-01-09 20:54:27,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:54:27,541 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 1577 [2025-01-09 20:54:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:27,557 INFO L225 Difference]: With dead ends: 4661 [2025-01-09 20:54:27,558 INFO L226 Difference]: Without dead ends: 3826 [2025-01-09 20:54:27,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:54:27,561 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 414 mSDsluCounter, 5403 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 6638 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:27,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 6638 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:54:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2025-01-09 20:54:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3821. [2025-01-09 20:54:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3764 states have (on average 1.3509564293304994) internal successors, (5085), 3769 states have internal predecessors, (5085), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:54:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5188 transitions. [2025-01-09 20:54:27,658 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5188 transitions. Word has length 1577 [2025-01-09 20:54:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:27,660 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 5188 transitions. [2025-01-09 20:54:27,660 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-01-09 20:54:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5188 transitions. [2025-01-09 20:54:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1578 [2025-01-09 20:54:27,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:27,680 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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-01-09 20:54:27,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:54:27,681 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:27,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1208943317, now seen corresponding path program 1 times [2025-01-09 20:54:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976165018] [2025-01-09 20:54:27,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1577 statements into 1 equivalence classes. [2025-01-09 20:54:28,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1577 of 1577 statements. [2025-01-09 20:54:28,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:28,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6623 trivial. 0 not checked. [2025-01-09 20:54:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976165018] [2025-01-09 20:54:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976165018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:54:29,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:54:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:54:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71809935] [2025-01-09 20:54:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:54:29,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:54:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:29,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:54:29,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:54:29,892 INFO L87 Difference]: Start difference. First operand 3821 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-01-09 20:54:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:29,978 INFO L93 Difference]: Finished difference Result 4659 states and 6435 transitions. [2025-01-09 20:54:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:54:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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 1577 [2025-01-09 20:54:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:29,990 INFO L225 Difference]: With dead ends: 4659 [2025-01-09 20:54:29,990 INFO L226 Difference]: Without dead ends: 3814 [2025-01-09 20:54:29,992 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-01-09 20:54:29,993 INFO L435 NwaCegarLoop]: 1248 mSDtfsCounter, 1 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:29,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2474 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:54:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2025-01-09 20:54:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3814. [2025-01-09 20:54:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3757 states have (on average 1.3505456481235028) internal successors, (5074), 3762 states have internal predecessors, (5074), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 20:54:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 5177 transitions. [2025-01-09 20:54:30,085 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 5177 transitions. Word has length 1577 [2025-01-09 20:54:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 3814 states and 5177 transitions. [2025-01-09 20:54:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 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-01-09 20:54:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 5177 transitions. [2025-01-09 20:54:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1579 [2025-01-09 20:54:30,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:30,107 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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-01-09 20:54:30,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:54:30,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 413432649, now seen corresponding path program 1 times [2025-01-09 20:54:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075694293] [2025-01-09 20:54:30,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:30,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:30,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1578 statements into 1 equivalence classes. [2025-01-09 20:54:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1578 of 1578 statements. [2025-01-09 20:54:31,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:31,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 1302 proven. 1 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2025-01-09 20:54:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:54:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075694293] [2025-01-09 20:54:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075694293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:54:34,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418157573] [2025-01-09 20:54:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:54:34,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:54:34,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:54:34,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:54:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1578 statements into 1 equivalence classes. [2025-01-09 20:54:36,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1578 of 1578 statements. [2025-01-09 20:54:36,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:36,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:54:37,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 7627 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 20:54:37,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:54:37,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:54:37,349 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 19 treesize of output 11 [2025-01-09 20:54:37,514 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 19 treesize of output 11 [2025-01-09 20:54:37,689 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 19 treesize of output 11 [2025-01-09 20:54:37,856 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 19 treesize of output 11 [2025-01-09 20:54:38,023 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 19 treesize of output 11 [2025-01-09 20:54:38,189 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 19 treesize of output 11 [2025-01-09 20:54:38,376 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 19 treesize of output 11 [2025-01-09 20:54:38,529 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 19 treesize of output 11 [2025-01-09 20:54:38,680 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 19 treesize of output 11 [2025-01-09 20:54:38,831 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 19 treesize of output 11 [2025-01-09 20:54:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 6599 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:38,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:54:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6623 backedges. 0 proven. 6599 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:54:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418157573] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:54:40,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:54:40,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 14] total 31 [2025-01-09 20:54:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708944733] [2025-01-09 20:54:40,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:54:40,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 20:54:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:54:40,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 20:54:40,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=649, Unknown=0, NotChecked=0, Total=930 [2025-01-09 20:54:40,512 INFO L87 Difference]: Start difference. First operand 3814 states and 5177 transitions. Second operand has 31 states, 31 states have (on average 108.2258064516129) internal successors, (3355), 31 states have internal predecessors, (3355), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:54:42,950 INFO L93 Difference]: Finished difference Result 7267 states and 9894 transitions. [2025-01-09 20:54:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 20:54:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 108.2258064516129) internal successors, (3355), 31 states have internal predecessors, (3355), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1578 [2025-01-09 20:54:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:54:42,969 INFO L225 Difference]: With dead ends: 7267 [2025-01-09 20:54:42,969 INFO L226 Difference]: Without dead ends: 6098 [2025-01-09 20:54:42,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3208 GetRequests, 3126 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1314, Invalid=4538, Unknown=0, NotChecked=0, Total=5852 [2025-01-09 20:54:42,976 INFO L435 NwaCegarLoop]: 4765 mSDtfsCounter, 15378 mSDsluCounter, 67747 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15460 SdHoareTripleChecker+Valid, 72512 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:54:42,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15460 Valid, 72512 Invalid, 2531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 20:54:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2025-01-09 20:54:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 5950. [2025-01-09 20:54:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5950 states, 5853 states have (on average 1.3367503844182471) internal successors, (7824), 5858 states have internal predecessors, (7824), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-01-09 20:54:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 8007 transitions. [2025-01-09 20:54:43,117 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 8007 transitions. Word has length 1578 [2025-01-09 20:54:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:54:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 5950 states and 8007 transitions. [2025-01-09 20:54:43,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 108.2258064516129) internal successors, (3355), 31 states have internal predecessors, (3355), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:54:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 8007 transitions. [2025-01-09 20:54:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2503 [2025-01-09 20:54:43,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:54:43,164 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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-01-09 20:54:43,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 20:54:43,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 20:54:43,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:54:43,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:54:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1237429815, now seen corresponding path program 1 times [2025-01-09 20:54:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:54:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845682346] [2025-01-09 20:54:43,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:54:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:54:43,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2502 statements into 1 equivalence classes. [2025-01-09 20:54:45,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2502 of 2502 statements. [2025-01-09 20:54:45,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:54:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat