./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:16:12,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:16:12,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:16:12,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:16:12,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:16:12,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:16:12,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:16:12,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:16:12,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:16:12,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:16:12,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:16:12,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:16:12,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:16:12,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:16:12,257 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:16:12,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:16:12,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:16:12,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:16:12,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:16:12,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:16:12,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:16:12,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:16:12,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:16:12,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:16:12,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:16:12,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:16:12,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:16:12,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:16:12,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2025-03-04 06:16:12,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:16:12,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:16:12,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:16:12,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:16:12,501 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:16:12,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-03-04 06:16:13,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca21efcd/763a08dca1114575a433686419023cb1/FLAGe5ac2f713 [2025-03-04 06:16:14,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:16:14,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-03-04 06:16:14,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca21efcd/763a08dca1114575a433686419023cb1/FLAGe5ac2f713 [2025-03-04 06:16:14,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca21efcd/763a08dca1114575a433686419023cb1 [2025-03-04 06:16:14,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:16:14,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:16:14,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:16:14,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:16:14,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:16:14,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8bf851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14, skipping insertion in model container [2025-03-04 06:16:14,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:16:14,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44118,44131] [2025-03-04 06:16:14,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44660,44673] [2025-03-04 06:16:14,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56247,56260] [2025-03-04 06:16:14,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56368,56381] [2025-03-04 06:16:14,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:16:14,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:16:14,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44118,44131] [2025-03-04 06:16:14,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44660,44673] [2025-03-04 06:16:14,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56247,56260] [2025-03-04 06:16:14,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56368,56381] [2025-03-04 06:16:14,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:16:14,815 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:16:14,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14 WrapperNode [2025-03-04 06:16:14,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:16:14,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:16:14,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:16:14,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:16:14,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,880 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-03-04 06:16:14,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:16:14,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:16:14,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:16:14,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:16:14,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,955 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2025-03-04 06:16:14,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:14,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:15,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:15,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:16:15,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:16:15,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:16:15,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:16:15,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (1/1) ... [2025-03-04 06:16:15,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:16:15,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:16:15,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:16:15,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:16:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-04 06:16:15,084 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:16:15,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:16:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-04 06:16:15,084 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-04 06:16:15,085 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:16:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 06:16:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:16:15,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:16:15,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:16:15,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:16:15,297 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-04 06:16:16,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-04 06:16:16,303 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-04 06:16:16,303 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 06:16:16,366 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-03-04 06:16:16,367 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:16:16,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:16:16,438 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:16:16,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:16:16 BoogieIcfgContainer [2025-03-04 06:16:16,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:16:16,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:16:16,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:16:16,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:16:16,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:16:14" (1/3) ... [2025-03-04 06:16:16,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1bbd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:16:16, skipping insertion in model container [2025-03-04 06:16:16,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:16:14" (2/3) ... [2025-03-04 06:16:16,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1bbd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:16:16, skipping insertion in model container [2025-03-04 06:16:16,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:16:16" (3/3) ... [2025-03-04 06:16:16,446 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2025-03-04 06:16:16,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:16:16,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-1.i that has 5 procedures, 429 locations, 1 initial locations, 34 loop locations, and 4 error locations. [2025-03-04 06:16:16,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:16:16,510 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;@38667c4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:16:16,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 06:16:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 407 states have (on average 1.5945945945945945) internal successors, (649), 411 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 06:16:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 06:16:16,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:16,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:16:16,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:16,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:16,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1073890916, now seen corresponding path program 1 times [2025-03-04 06:16:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:16,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827506788] [2025-03-04 06:16:16,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:16,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 06:16:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 06:16:16,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:16,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827506788] [2025-03-04 06:16:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827506788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:16:16,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667110333] [2025-03-04 06:16:16,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:16:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:16,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:16:16,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:16:16,678 INFO L87 Difference]: Start difference. First operand has 429 states, 407 states have (on average 1.5945945945945945) internal successors, (649), 411 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:16,812 INFO L93 Difference]: Finished difference Result 854 states and 1359 transitions. [2025-03-04 06:16:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:16:16,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 06:16:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:16,821 INFO L225 Difference]: With dead ends: 854 [2025-03-04 06:16:16,821 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 06:16:16,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:16:16,828 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:16,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:16:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 06:16:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-04 06:16:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 402 states have (on average 1.4402985074626866) internal successors, (579), 407 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 604 transitions. [2025-03-04 06:16:16,876 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 604 transitions. Word has length 8 [2025-03-04 06:16:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:16,877 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 604 transitions. [2025-03-04 06:16:16,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 604 transitions. [2025-03-04 06:16:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 06:16:16,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:16,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:16:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:16:16,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2034121717, now seen corresponding path program 1 times [2025-03-04 06:16:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918061999] [2025-03-04 06:16:16,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:16,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 06:16:16,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 06:16:16,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:16,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918061999] [2025-03-04 06:16:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918061999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:17,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:17,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:16:17,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862608553] [2025-03-04 06:16:17,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:17,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:16:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:17,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:16:17,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:16:17,055 INFO L87 Difference]: Start difference. First operand 423 states and 604 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:17,341 INFO L93 Difference]: Finished difference Result 1029 states and 1480 transitions. [2025-03-04 06:16:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:16:17,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 06:16:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:17,347 INFO L225 Difference]: With dead ends: 1029 [2025-03-04 06:16:17,347 INFO L226 Difference]: Without dead ends: 819 [2025-03-04 06:16:17,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:16:17,348 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 552 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:17,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1611 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:16:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-04 06:16:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 425. [2025-03-04 06:16:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 404 states have (on average 1.438118811881188) internal successors, (581), 409 states have internal predecessors, (581), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 606 transitions. [2025-03-04 06:16:17,382 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 606 transitions. Word has length 10 [2025-03-04 06:16:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:17,385 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 606 transitions. [2025-03-04 06:16:17,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 606 transitions. [2025-03-04 06:16:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 06:16:17,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:17,386 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] [2025-03-04 06:16:17,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:16:17,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash -577258923, now seen corresponding path program 1 times [2025-03-04 06:16:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934147719] [2025-03-04 06:16:17,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:17,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:16:17,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:16:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934147719] [2025-03-04 06:16:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934147719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:17,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:16:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413913127] [2025-03-04 06:16:17,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:17,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:16:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:17,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:16:17,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:16:17,653 INFO L87 Difference]: Start difference. First operand 425 states and 606 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:17,810 INFO L93 Difference]: Finished difference Result 849 states and 1211 transitions. [2025-03-04 06:16:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:16:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2025-03-04 06:16:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:17,815 INFO L225 Difference]: With dead ends: 849 [2025-03-04 06:16:17,815 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 06:16:17,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:16:17,817 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 105 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:17,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1521 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:16:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 06:16:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-03-04 06:16:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 404 states have (on average 1.4207920792079207) internal successors, (574), 409 states have internal predecessors, (574), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2025-03-04 06:16:17,834 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 64 [2025-03-04 06:16:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:17,835 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2025-03-04 06:16:17,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2025-03-04 06:16:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 06:16:17,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:17,837 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] [2025-03-04 06:16:17,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:16:17,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:17,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1694587505, now seen corresponding path program 1 times [2025-03-04 06:16:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:17,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988234915] [2025-03-04 06:16:17,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:17,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:17,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:16:17,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:16:17,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:17,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:18,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988234915] [2025-03-04 06:16:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988234915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:18,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:18,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:16:18,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294614644] [2025-03-04 06:16:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:18,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:16:18,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:18,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:16:18,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:16:18,292 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:18,857 INFO L93 Difference]: Finished difference Result 880 states and 1239 transitions. [2025-03-04 06:16:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:16:18,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 64 [2025-03-04 06:16:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:18,860 INFO L225 Difference]: With dead ends: 880 [2025-03-04 06:16:18,860 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 06:16:18,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:18,861 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 14 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:18,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2230 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:16:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 06:16:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 452. [2025-03-04 06:16:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.408352668213457) internal successors, (607), 436 states have internal predecessors, (607), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 632 transitions. [2025-03-04 06:16:18,871 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 632 transitions. Word has length 64 [2025-03-04 06:16:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 632 transitions. [2025-03-04 06:16:18,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 632 transitions. [2025-03-04 06:16:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 06:16:18,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:18,873 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] [2025-03-04 06:16:18,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:16:18,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -245950012, now seen corresponding path program 1 times [2025-03-04 06:16:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406147418] [2025-03-04 06:16:18,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:18,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:16:18,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:16:18,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:18,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:19,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406147418] [2025-03-04 06:16:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406147418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:19,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:16:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461551257] [2025-03-04 06:16:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:19,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:16:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:19,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:16:19,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:16:19,136 INFO L87 Difference]: Start difference. First operand 452 states and 632 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:19,352 INFO L93 Difference]: Finished difference Result 909 states and 1274 transitions. [2025-03-04 06:16:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:16:19,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2025-03-04 06:16:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:19,357 INFO L225 Difference]: With dead ends: 909 [2025-03-04 06:16:19,358 INFO L226 Difference]: Without dead ends: 461 [2025-03-04 06:16:19,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:16:19,359 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 17 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:19,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1474 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:16:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-04 06:16:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 453. [2025-03-04 06:16:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.4074074074074074) internal successors, (608), 437 states have internal predecessors, (608), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 633 transitions. [2025-03-04 06:16:19,375 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 633 transitions. Word has length 65 [2025-03-04 06:16:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 633 transitions. [2025-03-04 06:16:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 633 transitions. [2025-03-04 06:16:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 06:16:19,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:19,376 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] [2025-03-04 06:16:19,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:16:19,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash 920060683, now seen corresponding path program 1 times [2025-03-04 06:16:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156932253] [2025-03-04 06:16:19,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:19,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:16:19,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:16:19,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:19,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156932253] [2025-03-04 06:16:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156932253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:16:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344930408] [2025-03-04 06:16:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:16:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:19,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:16:19,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:19,623 INFO L87 Difference]: Start difference. First operand 453 states and 633 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:20,105 INFO L93 Difference]: Finished difference Result 914 states and 1281 transitions. [2025-03-04 06:16:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:16:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 65 [2025-03-04 06:16:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:20,108 INFO L225 Difference]: With dead ends: 914 [2025-03-04 06:16:20,108 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 06:16:20,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:20,109 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 14 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:20,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2680 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:16:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 06:16:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2025-03-04 06:16:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 441 states have (on average 1.4081632653061225) internal successors, (621), 446 states have internal predecessors, (621), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 646 transitions. [2025-03-04 06:16:20,119 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 646 transitions. Word has length 65 [2025-03-04 06:16:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:20,120 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 646 transitions. [2025-03-04 06:16:20,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 646 transitions. [2025-03-04 06:16:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:16:20,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:20,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:16:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:16:20,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1788179634, now seen corresponding path program 1 times [2025-03-04 06:16:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933101997] [2025-03-04 06:16:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:20,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:16:20,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:16:20,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:20,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:20,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:20,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933101997] [2025-03-04 06:16:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933101997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:20,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:16:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524738630] [2025-03-04 06:16:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:16:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:20,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:16:20,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:16:20,319 INFO L87 Difference]: Start difference. First operand 462 states and 646 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:20,756 INFO L93 Difference]: Finished difference Result 923 states and 1293 transitions. [2025-03-04 06:16:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:16:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:16:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:20,759 INFO L225 Difference]: With dead ends: 923 [2025-03-04 06:16:20,759 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 06:16:20,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:16:20,763 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 8 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:20,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2259 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:16:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 06:16:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-04 06:16:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 444 states have (on average 1.4054054054054055) internal successors, (624), 449 states have internal predecessors, (624), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 649 transitions. [2025-03-04 06:16:20,779 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 649 transitions. Word has length 66 [2025-03-04 06:16:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:20,779 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 649 transitions. [2025-03-04 06:16:20,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 649 transitions. [2025-03-04 06:16:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:16:20,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:20,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:16:20,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:16:20,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:20,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash 120710166, now seen corresponding path program 1 times [2025-03-04 06:16:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:20,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377192554] [2025-03-04 06:16:20,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:20,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:16:20,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:16:20,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:20,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377192554] [2025-03-04 06:16:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377192554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:21,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:16:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160170077] [2025-03-04 06:16:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:16:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:21,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:16:21,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:16:21,105 INFO L87 Difference]: Start difference. First operand 465 states and 649 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:21,834 INFO L93 Difference]: Finished difference Result 942 states and 1319 transitions. [2025-03-04 06:16:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:16:21,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:16:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:21,837 INFO L225 Difference]: With dead ends: 942 [2025-03-04 06:16:21,837 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 06:16:21,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:16:21,839 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 33 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:21,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3646 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:16:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 06:16:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2025-03-04 06:16:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 454 states have (on average 1.4052863436123348) internal successors, (638), 459 states have internal predecessors, (638), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 663 transitions. [2025-03-04 06:16:21,853 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 663 transitions. Word has length 66 [2025-03-04 06:16:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:21,854 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 663 transitions. [2025-03-04 06:16:21,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 663 transitions. [2025-03-04 06:16:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:16:21,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:21,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:16:21,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:16:21,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:21,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1040245330, now seen corresponding path program 1 times [2025-03-04 06:16:21,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:21,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422100786] [2025-03-04 06:16:21,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:21,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:16:21,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:16:21,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:21,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:22,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422100786] [2025-03-04 06:16:22,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422100786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:22,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:22,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:16:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864342640] [2025-03-04 06:16:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:22,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:16:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:22,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:16:22,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:16:22,185 INFO L87 Difference]: Start difference. First operand 475 states and 663 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:22,817 INFO L93 Difference]: Finished difference Result 952 states and 1331 transitions. [2025-03-04 06:16:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:16:22,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:16:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:22,820 INFO L225 Difference]: With dead ends: 952 [2025-03-04 06:16:22,820 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 06:16:22,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:16:22,821 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 27 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:22,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3199 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:16:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 06:16:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2025-03-04 06:16:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.4026258205689277) internal successors, (641), 462 states have internal predecessors, (641), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-04 06:16:22,831 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 66 [2025-03-04 06:16:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:22,832 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-04 06:16:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-04 06:16:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 06:16:22,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:22,833 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-03-04 06:16:22,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:16:22,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 885840396, now seen corresponding path program 1 times [2025-03-04 06:16:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:22,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835589856] [2025-03-04 06:16:22,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:22,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:16:22,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:16:22,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:22,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835589856] [2025-03-04 06:16:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835589856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:23,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:16:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278347739] [2025-03-04 06:16:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:16:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:23,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:16:23,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:23,045 INFO L87 Difference]: Start difference. First operand 478 states and 666 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-03-04 06:16:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:23,577 INFO L93 Difference]: Finished difference Result 959 states and 1339 transitions. [2025-03-04 06:16:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:16:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-03-04 06:16:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:23,579 INFO L225 Difference]: With dead ends: 959 [2025-03-04 06:16:23,579 INFO L226 Difference]: Without dead ends: 485 [2025-03-04 06:16:23,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:16:23,581 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 12 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:23,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2686 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:16:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-04 06:16:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2025-03-04 06:16:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.4026258205689277) internal successors, (641), 462 states have internal predecessors, (641), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-04 06:16:23,591 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 67 [2025-03-04 06:16:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:23,592 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-04 06:16:23,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-03-04 06:16:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-04 06:16:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 06:16:23,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:23,593 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-03-04 06:16:23,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:16:23,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 800296954, now seen corresponding path program 1 times [2025-03-04 06:16:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972164789] [2025-03-04 06:16:23,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:23,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:16:23,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:16:23,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:23,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972164789] [2025-03-04 06:16:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972164789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:16:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550290919] [2025-03-04 06:16:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:16:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:23,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:16:23,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:16:23,995 INFO L87 Difference]: Start difference. First operand 478 states and 666 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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-03-04 06:16:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:25,253 INFO L93 Difference]: Finished difference Result 1404 states and 1970 transitions. [2025-03-04 06:16:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:16:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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-03-04 06:16:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:25,257 INFO L225 Difference]: With dead ends: 1404 [2025-03-04 06:16:25,257 INFO L226 Difference]: Without dead ends: 930 [2025-03-04 06:16:25,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-04 06:16:25,258 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 852 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3661 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:25,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3661 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 06:16:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-04 06:16:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 508. [2025-03-04 06:16:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 487 states have (on average 1.3880903490759753) internal successors, (676), 492 states have internal predecessors, (676), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 701 transitions. [2025-03-04 06:16:25,271 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 701 transitions. Word has length 67 [2025-03-04 06:16:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:25,271 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 701 transitions. [2025-03-04 06:16:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 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-03-04 06:16:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 701 transitions. [2025-03-04 06:16:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 06:16:25,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:25,272 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, 1] [2025-03-04 06:16:25,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:16:25,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:25,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1280407161, now seen corresponding path program 1 times [2025-03-04 06:16:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695937743] [2025-03-04 06:16:25,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:25,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:16:25,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:16:25,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:25,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:25,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:25,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695937743] [2025-03-04 06:16:25,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695937743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:25,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:16:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128025885] [2025-03-04 06:16:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:25,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:16:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:25,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:16:25,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:16:25,453 INFO L87 Difference]: Start difference. First operand 508 states and 701 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:25,993 INFO L93 Difference]: Finished difference Result 995 states and 1381 transitions. [2025-03-04 06:16:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:16:25,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 68 [2025-03-04 06:16:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:25,996 INFO L225 Difference]: With dead ends: 995 [2025-03-04 06:16:25,996 INFO L226 Difference]: Without dead ends: 521 [2025-03-04 06:16:25,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:16:25,997 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:25,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3648 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:16:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-04 06:16:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 511. [2025-03-04 06:16:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 490 states have (on average 1.3877551020408163) internal successors, (680), 495 states have internal predecessors, (680), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 705 transitions. [2025-03-04 06:16:26,009 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 705 transitions. Word has length 68 [2025-03-04 06:16:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 705 transitions. [2025-03-04 06:16:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 705 transitions. [2025-03-04 06:16:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 06:16:26,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:26,010 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, 1] [2025-03-04 06:16:26,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:16:26,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash -940118731, now seen corresponding path program 1 times [2025-03-04 06:16:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428148923] [2025-03-04 06:16:26,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:26,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:16:26,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:16:26,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:26,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428148923] [2025-03-04 06:16:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428148923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:16:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537995119] [2025-03-04 06:16:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:26,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:16:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:26,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:16:26,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:16:26,241 INFO L87 Difference]: Start difference. First operand 511 states and 705 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:27,012 INFO L93 Difference]: Finished difference Result 1016 states and 1410 transitions. [2025-03-04 06:16:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 68 [2025-03-04 06:16:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:27,015 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 06:16:27,015 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 06:16:27,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:16:27,017 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 37 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:27,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3578 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:16:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 06:16:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 511. [2025-03-04 06:16:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 490 states have (on average 1.3877551020408163) internal successors, (680), 495 states have internal predecessors, (680), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 705 transitions. [2025-03-04 06:16:27,028 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 705 transitions. Word has length 68 [2025-03-04 06:16:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:27,028 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 705 transitions. [2025-03-04 06:16:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 705 transitions. [2025-03-04 06:16:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:16:27,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:27,029 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, 1, 1] [2025-03-04 06:16:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:16:27,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 453215023, now seen corresponding path program 1 times [2025-03-04 06:16:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283369892] [2025-03-04 06:16:27,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:27,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:16:27,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:16:27,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:27,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283369892] [2025-03-04 06:16:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283369892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:27,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:27,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:16:27,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294389008] [2025-03-04 06:16:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:16:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:27,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:16:27,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:16:27,247 INFO L87 Difference]: Start difference. First operand 511 states and 705 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:27,900 INFO L93 Difference]: Finished difference Result 1004 states and 1394 transitions. [2025-03-04 06:16:27,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 69 [2025-03-04 06:16:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:27,904 INFO L225 Difference]: With dead ends: 1004 [2025-03-04 06:16:27,904 INFO L226 Difference]: Without dead ends: 527 [2025-03-04 06:16:27,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:16:27,905 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 23 mSDsluCounter, 3086 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:27,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3630 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:16:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-04 06:16:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 521. [2025-03-04 06:16:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 500 states have (on average 1.384) internal successors, (692), 505 states have internal predecessors, (692), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 717 transitions. [2025-03-04 06:16:27,933 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 717 transitions. Word has length 69 [2025-03-04 06:16:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:27,933 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 717 transitions. [2025-03-04 06:16:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 717 transitions. [2025-03-04 06:16:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:16:27,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:27,933 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, 1, 1] [2025-03-04 06:16:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:16:27,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:27,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash 336389107, now seen corresponding path program 1 times [2025-03-04 06:16:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929870698] [2025-03-04 06:16:27,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:27,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:16:27,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:16:27,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:27,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929870698] [2025-03-04 06:16:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929870698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:28,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:16:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79232577] [2025-03-04 06:16:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:28,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:16:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:28,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:16:28,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:16:28,206 INFO L87 Difference]: Start difference. First operand 521 states and 717 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:28,899 INFO L93 Difference]: Finished difference Result 1026 states and 1421 transitions. [2025-03-04 06:16:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:28,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 69 [2025-03-04 06:16:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:28,902 INFO L225 Difference]: With dead ends: 1026 [2025-03-04 06:16:28,902 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 06:16:28,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:16:28,903 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 17 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:28,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4008 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:16:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 06:16:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2025-03-04 06:16:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3836978131212723) internal successors, (696), 508 states have internal predecessors, (696), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 721 transitions. [2025-03-04 06:16:28,915 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 721 transitions. Word has length 69 [2025-03-04 06:16:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:28,915 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 721 transitions. [2025-03-04 06:16:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 721 transitions. [2025-03-04 06:16:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:16:28,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:28,916 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, 1, 1] [2025-03-04 06:16:28,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:16:28,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1715793235, now seen corresponding path program 1 times [2025-03-04 06:16:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180986122] [2025-03-04 06:16:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:28,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:16:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:16:28,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:28,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180986122] [2025-03-04 06:16:29,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180986122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:29,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:29,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:16:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21784234] [2025-03-04 06:16:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:29,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:16:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:29,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:16:29,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:29,122 INFO L87 Difference]: Start difference. First operand 524 states and 721 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:29,570 INFO L93 Difference]: Finished difference Result 1021 states and 1411 transitions. [2025-03-04 06:16:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:16:29,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 69 [2025-03-04 06:16:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:29,572 INFO L225 Difference]: With dead ends: 1021 [2025-03-04 06:16:29,572 INFO L226 Difference]: Without dead ends: 531 [2025-03-04 06:16:29,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:29,574 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 11 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:29,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2717 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:16:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-04 06:16:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2025-03-04 06:16:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3817097415506958) internal successors, (695), 508 states have internal predecessors, (695), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 720 transitions. [2025-03-04 06:16:29,584 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 720 transitions. Word has length 69 [2025-03-04 06:16:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:29,584 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 720 transitions. [2025-03-04 06:16:29,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 720 transitions. [2025-03-04 06:16:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 06:16:29,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:29,585 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, 1, 1] [2025-03-04 06:16:29,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:16:29,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:29,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1659638897, now seen corresponding path program 1 times [2025-03-04 06:16:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:29,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137834154] [2025-03-04 06:16:29,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:29,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:16:29,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:16:29,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:29,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137834154] [2025-03-04 06:16:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137834154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:16:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377309895] [2025-03-04 06:16:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:16:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:29,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:16:29,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:29,752 INFO L87 Difference]: Start difference. First operand 524 states and 720 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:30,231 INFO L93 Difference]: Finished difference Result 1019 states and 1409 transitions. [2025-03-04 06:16:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:16:30,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 69 [2025-03-04 06:16:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:30,234 INFO L225 Difference]: With dead ends: 1019 [2025-03-04 06:16:30,234 INFO L226 Difference]: Without dead ends: 529 [2025-03-04 06:16:30,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:16:30,236 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 8 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:30,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2653 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:16:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-04 06:16:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 528. [2025-03-04 06:16:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 507 states have (on average 1.3806706114398422) internal successors, (700), 512 states have internal predecessors, (700), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 725 transitions. [2025-03-04 06:16:30,247 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 725 transitions. Word has length 69 [2025-03-04 06:16:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:30,247 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 725 transitions. [2025-03-04 06:16:30,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 725 transitions. [2025-03-04 06:16:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:16:30,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:30,248 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, 1, 1, 1] [2025-03-04 06:16:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:16:30,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:30,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1849591247, now seen corresponding path program 1 times [2025-03-04 06:16:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494180994] [2025-03-04 06:16:30,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:30,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:16:30,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:16:30,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:30,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:30,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:30,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494180994] [2025-03-04 06:16:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494180994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:16:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580542144] [2025-03-04 06:16:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:30,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:16:30,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:30,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:16:30,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:16:30,557 INFO L87 Difference]: Start difference. First operand 528 states and 725 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:31,261 INFO L93 Difference]: Finished difference Result 1034 states and 1429 transitions. [2025-03-04 06:16:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:31,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 70 [2025-03-04 06:16:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:31,264 INFO L225 Difference]: With dead ends: 1034 [2025-03-04 06:16:31,264 INFO L226 Difference]: Without dead ends: 540 [2025-03-04 06:16:31,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:16:31,265 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 13 mSDsluCounter, 3025 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:31,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3566 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:16:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-04 06:16:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2025-03-04 06:16:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 511 states have (on average 1.3796477495107633) internal successors, (705), 516 states have internal predecessors, (705), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 730 transitions. [2025-03-04 06:16:31,275 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 730 transitions. Word has length 70 [2025-03-04 06:16:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 730 transitions. [2025-03-04 06:16:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 730 transitions. [2025-03-04 06:16:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:16:31,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:31,276 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, 1, 1, 1] [2025-03-04 06:16:31,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:16:31,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:31,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1772012149, now seen corresponding path program 1 times [2025-03-04 06:16:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:31,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528775465] [2025-03-04 06:16:31,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:31,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:16:31,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:16:31,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:31,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:31,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:31,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528775465] [2025-03-04 06:16:31,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528775465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:31,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:31,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:16:31,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314997713] [2025-03-04 06:16:31,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:31,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:16:31,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:31,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:16:31,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:16:31,678 INFO L87 Difference]: Start difference. First operand 532 states and 730 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:35,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:16:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:36,140 INFO L93 Difference]: Finished difference Result 1053 states and 1452 transitions. [2025-03-04 06:16:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 70 [2025-03-04 06:16:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:36,143 INFO L225 Difference]: With dead ends: 1053 [2025-03-04 06:16:36,143 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 06:16:36,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:16:36,144 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 44 mSDsluCounter, 3409 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:36,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3952 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 06:16:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 06:16:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 530. [2025-03-04 06:16:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 509 states have (on average 1.3791748526522594) internal successors, (702), 514 states have internal predecessors, (702), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 727 transitions. [2025-03-04 06:16:36,156 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 727 transitions. Word has length 70 [2025-03-04 06:16:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:36,156 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 727 transitions. [2025-03-04 06:16:36,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 727 transitions. [2025-03-04 06:16:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:16:36,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:36,157 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, 1, 1, 1] [2025-03-04 06:16:36,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:16:36,157 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:36,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2087456900, now seen corresponding path program 1 times [2025-03-04 06:16:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171163830] [2025-03-04 06:16:36,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:36,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:16:36,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:16:36,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:36,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171163830] [2025-03-04 06:16:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171163830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:16:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740937817] [2025-03-04 06:16:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:16:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:36,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:16:36,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:16:36,371 INFO L87 Difference]: Start difference. First operand 530 states and 727 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:37,057 INFO L93 Difference]: Finished difference Result 1043 states and 1438 transitions. [2025-03-04 06:16:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:37,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 70 [2025-03-04 06:16:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:37,060 INFO L225 Difference]: With dead ends: 1043 [2025-03-04 06:16:37,060 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 06:16:37,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:16:37,061 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 40 mSDsluCounter, 3526 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:37,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4065 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:16:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 06:16:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 536. [2025-03-04 06:16:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 515 states have (on average 1.3766990291262136) internal successors, (709), 520 states have internal predecessors, (709), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 734 transitions. [2025-03-04 06:16:37,074 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 734 transitions. Word has length 70 [2025-03-04 06:16:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:37,074 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 734 transitions. [2025-03-04 06:16:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 734 transitions. [2025-03-04 06:16:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:16:37,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:37,075 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, 1, 1, 1] [2025-03-04 06:16:37,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:16:37,075 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:37,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1754401810, now seen corresponding path program 1 times [2025-03-04 06:16:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145186231] [2025-03-04 06:16:37,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:37,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:16:37,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:16:37,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:37,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:16:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:16:37,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:16:37,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145186231] [2025-03-04 06:16:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145186231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:16:37,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:16:37,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:16:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388592749] [2025-03-04 06:16:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:16:37,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:16:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:16:37,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:16:37,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:16:37,244 INFO L87 Difference]: Start difference. First operand 536 states and 734 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:16:37,840 INFO L93 Difference]: Finished difference Result 1064 states and 1465 transitions. [2025-03-04 06:16:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:16:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 70 [2025-03-04 06:16:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:16:37,843 INFO L225 Difference]: With dead ends: 1064 [2025-03-04 06:16:37,843 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 06:16:37,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:16:37,844 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 33 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:16:37,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3578 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:16:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 06:16:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 533. [2025-03-04 06:16:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 512 states have (on average 1.37890625) internal successors, (706), 517 states have internal predecessors, (706), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 06:16:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 731 transitions. [2025-03-04 06:16:37,854 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 731 transitions. Word has length 70 [2025-03-04 06:16:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:16:37,854 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 731 transitions. [2025-03-04 06:16:37,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:16:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 731 transitions. [2025-03-04 06:16:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 06:16:37,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:16:37,855 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, 1, 1, 1] [2025-03-04 06:16:37,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:16:37,855 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 06:16:37,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:16:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1291735459, now seen corresponding path program 1 times [2025-03-04 06:16:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:16:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961641541] [2025-03-04 06:16:37,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:16:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:16:37,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:16:37,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:16:37,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:16:37,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:20,987 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 06:17:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:17:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961641541] [2025-03-04 06:17:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961641541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:17:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635480361] [2025-03-04 06:17:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:17:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:31,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:17:31,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2025-03-04 06:17:31,431 INFO L87 Difference]: Start difference. First operand 533 states and 731 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:35,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:17:39,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:17:44,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 06:17:48,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []