./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_OAT_test6-2.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 bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:24:46,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:24:46,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:24:46,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:24:46,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:24:46,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:24:46,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:24:46,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:24:46,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:24:46,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:24:46,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:24:46,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:24:46,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:24:46,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:24:46,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:24:46,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:24:46,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:24:46,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:24:46,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:24:46,632 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 -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2025-03-08 21:24:46,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:24:46,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:24:46,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:24:46,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:24:46,859 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:24:46,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2025-03-08 21:24:47,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efd185e8/71d82dbab7314727bb384622fac019fe/FLAG0bc8eda77 [2025-03-08 21:24:48,321 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:24:48,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2025-03-08 21:24:48,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efd185e8/71d82dbab7314727bb384622fac019fe/FLAG0bc8eda77 [2025-03-08 21:24:48,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efd185e8/71d82dbab7314727bb384622fac019fe [2025-03-08 21:24:48,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:24:48,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:24:48,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:24:48,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:24:48,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:24:48,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:24:48" (1/1) ... [2025-03-08 21:24:48,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71972c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:48, skipping insertion in model container [2025-03-08 21:24:48,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:24:48" (1/1) ... [2025-03-08 21:24:48,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:24:48,917 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_OAT_test6-2.i[44118,44131] [2025-03-08 21:24:48,931 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_OAT_test6-2.i[44660,44673] [2025-03-08 21:24:49,007 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_OAT_test6-2.i[56247,56260] [2025-03-08 21:24:49,008 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_OAT_test6-2.i[56368,56381] [2025-03-08 21:24:49,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:24:49,031 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:24:49,060 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_OAT_test6-2.i[44118,44131] [2025-03-08 21:24:49,062 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_OAT_test6-2.i[44660,44673] [2025-03-08 21:24:49,108 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_OAT_test6-2.i[56247,56260] [2025-03-08 21:24:49,109 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_OAT_test6-2.i[56368,56381] [2025-03-08 21:24:49,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:24:49,158 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:24:49,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49 WrapperNode [2025-03-08 21:24:49,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:24:49,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:24:49,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:24:49,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:24:49,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,226 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-03-08 21:24:49,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:24:49,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:24:49,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:24:49,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:24:49,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,320 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2025-03-08 21:24:49,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:24:49,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:24:49,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:24:49,387 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:24:49,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (1/1) ... [2025-03-08 21:24:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:24:49,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:24:49,413 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-08 21:24:49,418 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-08 21:24:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:24:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:24:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:24:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-08 21:24:49,436 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:24:49,436 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:24:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-08 21:24:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-08 21:24:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-08 21:24:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:24:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:24:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:24:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 21:24:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:24:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:24:49,632 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:24:49,633 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:24:49,673 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-08 21:24:50,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-08 21:24:50,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-08 21:24:50,666 INFO L1307 $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-08 21:24:50,742 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-03-08 21:24:50,742 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:24:50,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:24:50,788 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:24:50,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:24:50 BoogieIcfgContainer [2025-03-08 21:24:50,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:24:50,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:24:50,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:24:50,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:24:50,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:24:48" (1/3) ... [2025-03-08 21:24:50,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f278a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:24:50, skipping insertion in model container [2025-03-08 21:24:50,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:24:49" (2/3) ... [2025-03-08 21:24:50,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f278a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:24:50, skipping insertion in model container [2025-03-08 21:24:50,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:24:50" (3/3) ... [2025-03-08 21:24:50,797 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2025-03-08 21:24:50,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:24:50,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test6-2.i that has 5 procedures, 466 locations, 1 initial locations, 39 loop locations, and 4 error locations. [2025-03-08 21:24:50,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:24:50,861 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;@2695896c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:24:50,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 21:24:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 442 states have (on average 1.5950226244343892) internal successors, (705), 446 states have internal predecessors, (705), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 21:24:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 21:24:50,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:50,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:24:50,869 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-08 21:24:50,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1241237276, now seen corresponding path program 1 times [2025-03-08 21:24:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:50,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915635423] [2025-03-08 21:24:50,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:50,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 21:24:50,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 21:24:50,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:50,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:51,009 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-08 21:24:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915635423] [2025-03-08 21:24:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915635423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:24:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225379180] [2025-03-08 21:24:51,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:51,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:24:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:51,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:24:51,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:24:51,035 INFO L87 Difference]: Start difference. First operand has 466 states, 442 states have (on average 1.5950226244343892) internal successors, (705), 446 states have internal predecessors, (705), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-08 21:24:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:51,155 INFO L93 Difference]: Finished difference Result 928 states and 1481 transitions. [2025-03-08 21:24:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:24:51,156 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-08 21:24:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:51,164 INFO L225 Difference]: With dead ends: 928 [2025-03-08 21:24:51,164 INFO L226 Difference]: Without dead ends: 461 [2025-03-08 21:24:51,170 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-08 21:24:51,174 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:51,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:24:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-08 21:24:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-03-08 21:24:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 438 states have (on average 1.4315068493150684) internal successors, (627), 442 states have internal predecessors, (627), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 657 transitions. [2025-03-08 21:24:51,235 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 657 transitions. Word has length 8 [2025-03-08 21:24:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:51,236 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 657 transitions. [2025-03-08 21:24:51,236 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-08 21:24:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 657 transitions. [2025-03-08 21:24:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 21:24:51,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:51,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:24:51,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:24:51,237 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-08 21:24:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2079256789, now seen corresponding path program 1 times [2025-03-08 21:24:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80372072] [2025-03-08 21:24:51,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:51,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 21:24:51,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 21:24:51,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:51,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:51,426 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-08 21:24:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80372072] [2025-03-08 21:24:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80372072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:24:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243719405] [2025-03-08 21:24:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:24:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:51,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:24:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:24:51,430 INFO L87 Difference]: Start difference. First operand 461 states and 657 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-08 21:24:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:51,713 INFO L93 Difference]: Finished difference Result 1143 states and 1639 transitions. [2025-03-08 21:24:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:24:51,713 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-08 21:24:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:51,717 INFO L225 Difference]: With dead ends: 1143 [2025-03-08 21:24:51,717 INFO L226 Difference]: Without dead ends: 895 [2025-03-08 21:24:51,718 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-08 21:24:51,718 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 600 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:51,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1855 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:24:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-08 21:24:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 463. [2025-03-08 21:24:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 440 states have (on average 1.4295454545454545) internal successors, (629), 444 states have internal predecessors, (629), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 659 transitions. [2025-03-08 21:24:51,752 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 659 transitions. Word has length 10 [2025-03-08 21:24:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:51,752 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 659 transitions. [2025-03-08 21:24:51,753 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-08 21:24:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 659 transitions. [2025-03-08 21:24:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 21:24:51,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:51,754 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-08 21:24:51,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:24:51,754 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-08 21:24:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1756423654, now seen corresponding path program 1 times [2025-03-08 21:24:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729981456] [2025-03-08 21:24:51,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:51,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 21:24:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 21:24:51,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:51,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:52,014 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-08 21:24:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729981456] [2025-03-08 21:24:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729981456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:24:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377081955] [2025-03-08 21:24:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:52,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:24:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:52,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:24:52,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:24:52,020 INFO L87 Difference]: Start difference. First operand 463 states and 659 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-08 21:24:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:52,171 INFO L93 Difference]: Finished difference Result 925 states and 1317 transitions. [2025-03-08 21:24:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:24:52,171 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-08 21:24:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:52,174 INFO L225 Difference]: With dead ends: 925 [2025-03-08 21:24:52,176 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 21:24:52,178 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-08 21:24:52,178 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 105 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:52,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1677 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:24:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 21:24:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 463. [2025-03-08 21:24:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 440 states have (on average 1.4136363636363636) internal successors, (622), 444 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 652 transitions. [2025-03-08 21:24:52,198 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 652 transitions. Word has length 64 [2025-03-08 21:24:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:52,198 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 652 transitions. [2025-03-08 21:24:52,199 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-08 21:24:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 652 transitions. [2025-03-08 21:24:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 21:24:52,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:52,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:24:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:24:52,202 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-08 21:24:52,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1904171213, now seen corresponding path program 1 times [2025-03-08 21:24:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632352407] [2025-03-08 21:24:52,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:52,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 21:24:52,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 21:24:52,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:52,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:52,634 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-08 21:24:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632352407] [2025-03-08 21:24:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632352407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:24:52,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641208357] [2025-03-08 21:24:52,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:52,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:24:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:52,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:24:52,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:24:52,636 INFO L87 Difference]: Start difference. First operand 463 states and 652 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-08 21:24:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:53,182 INFO L93 Difference]: Finished difference Result 956 states and 1345 transitions. [2025-03-08 21:24:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:24:53,183 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-08 21:24:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:53,185 INFO L225 Difference]: With dead ends: 956 [2025-03-08 21:24:53,186 INFO L226 Difference]: Without dead ends: 497 [2025-03-08 21:24:53,186 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-08 21:24:53,188 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 14 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:53,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2490 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:24:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-08 21:24:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 490. [2025-03-08 21:24:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 467 states have (on average 1.4025695931477515) internal successors, (655), 471 states have internal predecessors, (655), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 685 transitions. [2025-03-08 21:24:53,205 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 685 transitions. Word has length 64 [2025-03-08 21:24:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:53,205 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 685 transitions. [2025-03-08 21:24:53,205 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-08 21:24:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 685 transitions. [2025-03-08 21:24:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 21:24:53,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:53,207 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-08 21:24:53,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:24:53,207 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-08 21:24:53,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash -805715037, now seen corresponding path program 1 times [2025-03-08 21:24:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216661120] [2025-03-08 21:24:53,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:53,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 21:24:53,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 21:24:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:53,423 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-08 21:24:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216661120] [2025-03-08 21:24:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216661120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:53,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:24:53,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737736908] [2025-03-08 21:24:53,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:24:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:53,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:24:53,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:24:53,425 INFO L87 Difference]: Start difference. First operand 490 states and 685 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-08 21:24:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:53,648 INFO L93 Difference]: Finished difference Result 985 states and 1380 transitions. [2025-03-08 21:24:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:24:53,649 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-08 21:24:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:53,651 INFO L225 Difference]: With dead ends: 985 [2025-03-08 21:24:53,651 INFO L226 Difference]: Without dead ends: 499 [2025-03-08 21:24:53,655 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-08 21:24:53,656 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 17 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:53,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1630 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:24:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-08 21:24:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 491. [2025-03-08 21:24:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.4017094017094016) internal successors, (656), 472 states have internal predecessors, (656), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 686 transitions. [2025-03-08 21:24:53,699 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 686 transitions. Word has length 65 [2025-03-08 21:24:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:53,700 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 686 transitions. [2025-03-08 21:24:53,700 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-08 21:24:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 686 transitions. [2025-03-08 21:24:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 21:24:53,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:53,703 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-08 21:24:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:24:53,704 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-08 21:24:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash 360295658, now seen corresponding path program 1 times [2025-03-08 21:24:53,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:53,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311080354] [2025-03-08 21:24:53,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:53,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:53,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 21:24:53,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 21:24:53,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:53,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:53,935 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-08 21:24:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:53,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311080354] [2025-03-08 21:24:53,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311080354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:53,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:53,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:24:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141819276] [2025-03-08 21:24:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:24:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:53,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:24:53,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:24:53,937 INFO L87 Difference]: Start difference. First operand 491 states and 686 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-08 21:24:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:54,428 INFO L93 Difference]: Finished difference Result 990 states and 1387 transitions. [2025-03-08 21:24:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:24:54,429 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-08 21:24:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:54,431 INFO L225 Difference]: With dead ends: 990 [2025-03-08 21:24:54,431 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 21:24:54,432 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-08 21:24:54,432 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 14 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:54,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2992 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:24:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 21:24:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 500. [2025-03-08 21:24:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 477 states have (on average 1.4025157232704402) internal successors, (669), 481 states have internal predecessors, (669), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 699 transitions. [2025-03-08 21:24:54,443 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 699 transitions. Word has length 65 [2025-03-08 21:24:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:54,444 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 699 transitions. [2025-03-08 21:24:54,444 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-08 21:24:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 699 transitions. [2025-03-08 21:24:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:24:54,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:54,445 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-08 21:24:54,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:24:54,445 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-08 21:24:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1037271626, now seen corresponding path program 1 times [2025-03-08 21:24:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520881850] [2025-03-08 21:24:54,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:54,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:54,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:24:54,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:24:54,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:54,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:54,648 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-08 21:24:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520881850] [2025-03-08 21:24:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520881850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:54,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:24:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150012618] [2025-03-08 21:24:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:54,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:24:54,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:54,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:24:54,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:24:54,651 INFO L87 Difference]: Start difference. First operand 500 states and 699 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-08 21:24:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:55,058 INFO L93 Difference]: Finished difference Result 999 states and 1399 transitions. [2025-03-08 21:24:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:24:55,059 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-08 21:24:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:55,061 INFO L225 Difference]: With dead ends: 999 [2025-03-08 21:24:55,061 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 21:24:55,062 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-08 21:24:55,062 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 8 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:55,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2519 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:24:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 21:24:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-08 21:24:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 480 states have (on average 1.4) internal successors, (672), 484 states have internal predecessors, (672), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 702 transitions. [2025-03-08 21:24:55,073 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 702 transitions. Word has length 66 [2025-03-08 21:24:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:55,073 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 702 transitions. [2025-03-08 21:24:55,073 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-08 21:24:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 702 transitions. [2025-03-08 21:24:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:24:55,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:55,074 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-08 21:24:55,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:24:55,074 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-08 21:24:55,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1590226202, now seen corresponding path program 1 times [2025-03-08 21:24:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:55,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602621246] [2025-03-08 21:24:55,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:55,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:24:55,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:24:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:55,382 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-08 21:24:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602621246] [2025-03-08 21:24:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602621246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:55,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:24:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131724999] [2025-03-08 21:24:55,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:24:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:55,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:24:55,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:24:55,384 INFO L87 Difference]: Start difference. First operand 503 states and 702 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-08 21:24:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:56,111 INFO L93 Difference]: Finished difference Result 1018 states and 1425 transitions. [2025-03-08 21:24:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:24:56,114 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-08 21:24:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:56,116 INFO L225 Difference]: With dead ends: 1018 [2025-03-08 21:24:56,116 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 21:24:56,117 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-08 21:24:56,118 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 33 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:56,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4062 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:24:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 21:24:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 513. [2025-03-08 21:24:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 490 states have (on average 1.4) internal successors, (686), 494 states have internal predecessors, (686), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 716 transitions. [2025-03-08 21:24:56,135 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 716 transitions. Word has length 66 [2025-03-08 21:24:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:56,135 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 716 transitions. [2025-03-08 21:24:56,135 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-08 21:24:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 716 transitions. [2025-03-08 21:24:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:24:56,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:56,136 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-08 21:24:56,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:24:56,137 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-08 21:24:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1785205930, now seen corresponding path program 1 times [2025-03-08 21:24:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983434873] [2025-03-08 21:24:56,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:56,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:24:56,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:24:56,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:56,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:56,469 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-08 21:24:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983434873] [2025-03-08 21:24:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983434873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:24:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298859462] [2025-03-08 21:24:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:56,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:24:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:56,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:24:56,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:24:56,471 INFO L87 Difference]: Start difference. First operand 513 states and 716 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-08 21:24:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:56,994 INFO L93 Difference]: Finished difference Result 1028 states and 1437 transitions. [2025-03-08 21:24:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:24:56,994 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-08 21:24:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:56,997 INFO L225 Difference]: With dead ends: 1028 [2025-03-08 21:24:56,997 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 21:24:56,998 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-08 21:24:56,998 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 27 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:56,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3089 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:24:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 21:24:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 516. [2025-03-08 21:24:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3975659229208925) internal successors, (689), 497 states have internal predecessors, (689), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 719 transitions. [2025-03-08 21:24:57,014 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 719 transitions. Word has length 66 [2025-03-08 21:24:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 719 transitions. [2025-03-08 21:24:57,014 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-08 21:24:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 719 transitions. [2025-03-08 21:24:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 21:24:57,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:57,015 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-08 21:24:57,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:24:57,016 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-08 21:24:57,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2053207665, now seen corresponding path program 1 times [2025-03-08 21:24:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021363555] [2025-03-08 21:24:57,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:57,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:24:57,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:24:57,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:57,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:57,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-08 21:24:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021363555] [2025-03-08 21:24:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021363555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:24:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757699828] [2025-03-08 21:24:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:24:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:57,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:24:57,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:24:57,208 INFO L87 Difference]: Start difference. First operand 516 states and 719 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-08 21:24:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:57,724 INFO L93 Difference]: Finished difference Result 1035 states and 1445 transitions. [2025-03-08 21:24:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:24:57,725 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-08 21:24:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:57,727 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 21:24:57,727 INFO L226 Difference]: Without dead ends: 523 [2025-03-08 21:24:57,728 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-08 21:24:57,729 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 12 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:57,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2998 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:24:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-08 21:24:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 516. [2025-03-08 21:24:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3975659229208925) internal successors, (689), 497 states have internal predecessors, (689), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 719 transitions. [2025-03-08 21:24:57,741 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 719 transitions. Word has length 67 [2025-03-08 21:24:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:57,741 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 719 transitions. [2025-03-08 21:24:57,742 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-08 21:24:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 719 transitions. [2025-03-08 21:24:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 21:24:57,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:57,742 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-08 21:24:57,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:24:57,743 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-08 21:24:57,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -769544067, now seen corresponding path program 1 times [2025-03-08 21:24:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:57,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024117192] [2025-03-08 21:24:57,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:57,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:24:57,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:24:57,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:57,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:58,107 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-08 21:24:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024117192] [2025-03-08 21:24:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024117192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:58,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:24:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264030136] [2025-03-08 21:24:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:58,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:24:58,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:58,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:24:58,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:24:58,109 INFO L87 Difference]: Start difference. First operand 516 states and 719 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-08 21:24:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:59,286 INFO L93 Difference]: Finished difference Result 1518 states and 2129 transitions. [2025-03-08 21:24:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:24:59,286 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-08 21:24:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:59,290 INFO L225 Difference]: With dead ends: 1518 [2025-03-08 21:24:59,290 INFO L226 Difference]: Without dead ends: 1006 [2025-03-08 21:24:59,291 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-08 21:24:59,291 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 900 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:59,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 3833 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 21:24:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-08 21:24:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 546. [2025-03-08 21:24:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 523 states have (on average 1.384321223709369) internal successors, (724), 527 states have internal predecessors, (724), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 754 transitions. [2025-03-08 21:24:59,305 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 754 transitions. Word has length 67 [2025-03-08 21:24:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 754 transitions. [2025-03-08 21:24:59,306 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-08 21:24:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 754 transitions. [2025-03-08 21:24:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 21:24:59,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:59,306 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-08 21:24:59,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:24:59,307 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-08 21:24:59,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1457073885, now seen corresponding path program 1 times [2025-03-08 21:24:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273750604] [2025-03-08 21:24:59,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:59,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:24:59,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:24:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:24:59,497 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-08 21:24:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:24:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273750604] [2025-03-08 21:24:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273750604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:24:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:24:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:24:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933786366] [2025-03-08 21:24:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:24:59,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:24:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:24:59,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:24:59,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:24:59,498 INFO L87 Difference]: Start difference. First operand 546 states and 754 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-08 21:24:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:24:59,952 INFO L93 Difference]: Finished difference Result 1071 states and 1487 transitions. [2025-03-08 21:24:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:24:59,952 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-08 21:24:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:24:59,954 INFO L225 Difference]: With dead ends: 1071 [2025-03-08 21:24:59,954 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 21:24:59,955 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-08 21:24:59,956 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 20 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:24:59,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3583 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:24:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 21:24:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 549. [2025-03-08 21:24:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 526 states have (on average 1.3840304182509506) internal successors, (728), 530 states have internal predecessors, (728), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:24:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 758 transitions. [2025-03-08 21:24:59,967 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 758 transitions. Word has length 68 [2025-03-08 21:24:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:24:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 758 transitions. [2025-03-08 21:24:59,967 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-08 21:24:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 758 transitions. [2025-03-08 21:24:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 21:24:59,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:24:59,968 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-08 21:24:59,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:24:59,968 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-08 21:24:59,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:24:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -213932779, now seen corresponding path program 1 times [2025-03-08 21:24:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:24:59,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287834178] [2025-03-08 21:24:59,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:24:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:24:59,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:24:59,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:24:59,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:24:59,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:00,178 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-08 21:25:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287834178] [2025-03-08 21:25:00,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287834178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:00,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:00,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:25:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503207613] [2025-03-08 21:25:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:25:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:00,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:25:00,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:25:00,180 INFO L87 Difference]: Start difference. First operand 549 states and 758 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-08 21:25:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:00,880 INFO L93 Difference]: Finished difference Result 1092 states and 1516 transitions. [2025-03-08 21:25:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:00,881 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-08 21:25:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:00,883 INFO L225 Difference]: With dead ends: 1092 [2025-03-08 21:25:00,883 INFO L226 Difference]: Without dead ends: 577 [2025-03-08 21:25:00,884 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-08 21:25:00,885 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 37 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:00,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3994 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:25:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-08 21:25:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 549. [2025-03-08 21:25:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 526 states have (on average 1.3840304182509506) internal successors, (728), 530 states have internal predecessors, (728), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 758 transitions. [2025-03-08 21:25:00,897 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 758 transitions. Word has length 68 [2025-03-08 21:25:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:00,897 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 758 transitions. [2025-03-08 21:25:00,897 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-08 21:25:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 758 transitions. [2025-03-08 21:25:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:25:00,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:00,898 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-08 21:25:00,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:25:00,898 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-08 21:25:00,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1017688498, now seen corresponding path program 1 times [2025-03-08 21:25:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065862780] [2025-03-08 21:25:00,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:00,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:25:00,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:25:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:00,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:01,117 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-08 21:25:01,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:01,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065862780] [2025-03-08 21:25:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065862780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:01,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:25:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758585928] [2025-03-08 21:25:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:01,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:25:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:01,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:25:01,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:25:01,119 INFO L87 Difference]: Start difference. First operand 549 states and 758 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-08 21:25:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:01,799 INFO L93 Difference]: Finished difference Result 1080 states and 1500 transitions. [2025-03-08 21:25:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:01,799 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-08 21:25:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:01,802 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 21:25:01,802 INFO L226 Difference]: Without dead ends: 565 [2025-03-08 21:25:01,803 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-08 21:25:01,803 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 23 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4499 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:01,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4499 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:25:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-08 21:25:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2025-03-08 21:25:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 536 states have (on average 1.3805970149253732) internal successors, (740), 540 states have internal predecessors, (740), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 770 transitions. [2025-03-08 21:25:01,814 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 770 transitions. Word has length 69 [2025-03-08 21:25:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 770 transitions. [2025-03-08 21:25:01,814 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-08 21:25:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 770 transitions. [2025-03-08 21:25:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:25:01,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:01,815 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-08 21:25:01,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:25:01,815 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-08 21:25:01,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1279287530, now seen corresponding path program 1 times [2025-03-08 21:25:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660699944] [2025-03-08 21:25:01,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:01,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:25:01,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:25:01,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:01,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:02,016 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-08 21:25:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660699944] [2025-03-08 21:25:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660699944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:25:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168754320] [2025-03-08 21:25:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:25:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:02,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:25:02,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:25:02,017 INFO L87 Difference]: Start difference. First operand 559 states and 770 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-08 21:25:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:02,661 INFO L93 Difference]: Finished difference Result 1102 states and 1527 transitions. [2025-03-08 21:25:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:02,662 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-08 21:25:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:02,663 INFO L225 Difference]: With dead ends: 1102 [2025-03-08 21:25:02,663 INFO L226 Difference]: Without dead ends: 577 [2025-03-08 21:25:02,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:25:02,665 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 17 mSDsluCounter, 3892 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4476 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:02,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4476 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:25:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-08 21:25:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 562. [2025-03-08 21:25:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 539 states have (on average 1.3803339517625233) internal successors, (744), 543 states have internal predecessors, (744), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 774 transitions. [2025-03-08 21:25:02,675 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 774 transitions. Word has length 69 [2025-03-08 21:25:02,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:02,675 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 774 transitions. [2025-03-08 21:25:02,675 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-08 21:25:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 774 transitions. [2025-03-08 21:25:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:25:02,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:02,676 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-08 21:25:02,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:25:02,676 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-08 21:25:02,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash 100116598, now seen corresponding path program 1 times [2025-03-08 21:25:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316402430] [2025-03-08 21:25:02,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:02,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:25:02,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:25:02,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:02,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:02,851 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-08 21:25:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316402430] [2025-03-08 21:25:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316402430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:25:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564513275] [2025-03-08 21:25:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:25:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:02,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:25:02,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:25:02,853 INFO L87 Difference]: Start difference. First operand 562 states and 774 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-08 21:25:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:03,304 INFO L93 Difference]: Finished difference Result 1097 states and 1517 transitions. [2025-03-08 21:25:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:25:03,306 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-08 21:25:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:03,308 INFO L225 Difference]: With dead ends: 1097 [2025-03-08 21:25:03,308 INFO L226 Difference]: Without dead ends: 569 [2025-03-08 21:25:03,308 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-08 21:25:03,309 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 11 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:03,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3029 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:25:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-08 21:25:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 562. [2025-03-08 21:25:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 539 states have (on average 1.3784786641929498) internal successors, (743), 543 states have internal predecessors, (743), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 773 transitions. [2025-03-08 21:25:03,319 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 773 transitions. Word has length 69 [2025-03-08 21:25:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:03,319 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 773 transitions. [2025-03-08 21:25:03,319 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-08 21:25:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 773 transitions. [2025-03-08 21:25:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:25:03,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:03,320 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-08 21:25:03,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:25:03,320 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-08 21:25:03,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1019651762, now seen corresponding path program 1 times [2025-03-08 21:25:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118387112] [2025-03-08 21:25:03,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:03,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:03,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:25:03,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:25:03,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:03,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:03,497 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-08 21:25:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118387112] [2025-03-08 21:25:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118387112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:03,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:25:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852464534] [2025-03-08 21:25:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:03,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:25:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:03,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:25:03,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:25:03,499 INFO L87 Difference]: Start difference. First operand 562 states and 773 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-08 21:25:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:03,994 INFO L93 Difference]: Finished difference Result 1095 states and 1515 transitions. [2025-03-08 21:25:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:25:03,994 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-08 21:25:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:03,996 INFO L225 Difference]: With dead ends: 1095 [2025-03-08 21:25:03,996 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 21:25:03,997 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-08 21:25:03,997 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 8 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:03,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2965 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:25:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 21:25:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 566. [2025-03-08 21:25:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 543 states have (on average 1.3775322283609577) internal successors, (748), 547 states have internal predecessors, (748), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 778 transitions. [2025-03-08 21:25:04,014 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 778 transitions. Word has length 69 [2025-03-08 21:25:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:04,014 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 778 transitions. [2025-03-08 21:25:04,015 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-08 21:25:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 778 transitions. [2025-03-08 21:25:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:25:04,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:04,016 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-08 21:25:04,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:25:04,016 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-08 21:25:04,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 395106455, now seen corresponding path program 1 times [2025-03-08 21:25:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311561512] [2025-03-08 21:25:04,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:04,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:04,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:25:04,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:25:04,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:04,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:04,277 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-08 21:25:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311561512] [2025-03-08 21:25:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311561512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:04,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:04,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:25:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057969695] [2025-03-08 21:25:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:25:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:04,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:25:04,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:25:04,278 INFO L87 Difference]: Start difference. First operand 566 states and 778 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-08 21:25:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:05,628 INFO L93 Difference]: Finished difference Result 1110 states and 1535 transitions. [2025-03-08 21:25:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:05,629 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-08 21:25:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:05,631 INFO L225 Difference]: With dead ends: 1110 [2025-03-08 21:25:05,631 INFO L226 Difference]: Without dead ends: 578 [2025-03-08 21:25:05,631 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-08 21:25:05,632 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 13 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:05,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3982 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 21:25:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-08 21:25:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2025-03-08 21:25:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 547 states have (on average 1.376599634369287) internal successors, (753), 551 states have internal predecessors, (753), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 783 transitions. [2025-03-08 21:25:05,641 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 783 transitions. Word has length 70 [2025-03-08 21:25:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 783 transitions. [2025-03-08 21:25:05,641 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-08 21:25:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 783 transitions. [2025-03-08 21:25:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:25:05,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:05,642 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-08 21:25:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:25:05,642 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-08 21:25:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1008537532, now seen corresponding path program 1 times [2025-03-08 21:25:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483574888] [2025-03-08 21:25:05,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:05,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:25:05,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:25:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:05,839 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-08 21:25:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483574888] [2025-03-08 21:25:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483574888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:05,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:05,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 21:25:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412136130] [2025-03-08 21:25:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:05,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:25:05,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:05,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:25:05,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:25:05,841 INFO L87 Difference]: Start difference. First operand 570 states and 783 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-08 21:25:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:06,442 INFO L93 Difference]: Finished difference Result 1120 states and 1546 transitions. [2025-03-08 21:25:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:06,442 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-08 21:25:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:06,444 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 21:25:06,444 INFO L226 Difference]: Without dead ends: 584 [2025-03-08 21:25:06,445 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-08 21:25:06,445 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 40 mSDsluCounter, 3942 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:06,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4533 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:25:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-08 21:25:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 573. [2025-03-08 21:25:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 550 states have (on average 1.3745454545454545) internal successors, (756), 554 states have internal predecessors, (756), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 786 transitions. [2025-03-08 21:25:06,455 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 786 transitions. Word has length 70 [2025-03-08 21:25:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 786 transitions. [2025-03-08 21:25:06,455 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-08 21:25:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 786 transitions. [2025-03-08 21:25:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:25:06,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:06,456 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-08 21:25:06,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:25:06,456 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-08 21:25:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 875471055, now seen corresponding path program 1 times [2025-03-08 21:25:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628239016] [2025-03-08 21:25:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:06,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:25:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:25:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:06,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:06,767 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-08 21:25:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628239016] [2025-03-08 21:25:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628239016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:06,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:06,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:25:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679737829] [2025-03-08 21:25:06,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:06,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:25:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:06,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:25:06,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:25:06,769 INFO L87 Difference]: Start difference. First operand 573 states and 786 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-08 21:25:11,302 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-08 21:25:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:11,772 INFO L93 Difference]: Finished difference Result 1133 states and 1562 transitions. [2025-03-08 21:25:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:11,773 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-08 21:25:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:11,775 INFO L225 Difference]: With dead ends: 1133 [2025-03-08 21:25:11,775 INFO L226 Difference]: Without dead ends: 594 [2025-03-08 21:25:11,776 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-08 21:25:11,776 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 42 mSDsluCounter, 3825 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4420 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:11,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4420 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1548 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 21:25:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-08 21:25:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 574. [2025-03-08 21:25:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 551 states have (on average 1.3738656987295825) internal successors, (757), 555 states have internal predecessors, (757), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 787 transitions. [2025-03-08 21:25:11,799 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 787 transitions. Word has length 70 [2025-03-08 21:25:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:11,799 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 787 transitions. [2025-03-08 21:25:11,799 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-08 21:25:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 787 transitions. [2025-03-08 21:25:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:25:11,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:11,800 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-08 21:25:11,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:25:11,800 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-08 21:25:11,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash 555428946, now seen corresponding path program 1 times [2025-03-08 21:25:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:11,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398711019] [2025-03-08 21:25:11,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:11,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:25:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:25:11,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:11,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:11,952 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-08 21:25:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:25:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398711019] [2025-03-08 21:25:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398711019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:25:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:25:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:25:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747525934] [2025-03-08 21:25:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:25:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:25:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:25:11,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:25:11,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:25:11,955 INFO L87 Difference]: Start difference. First operand 574 states and 787 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-08 21:25:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:25:12,661 INFO L93 Difference]: Finished difference Result 1140 states and 1571 transitions. [2025-03-08 21:25:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:25:12,661 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-08 21:25:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:25:12,663 INFO L225 Difference]: With dead ends: 1140 [2025-03-08 21:25:12,664 INFO L226 Difference]: Without dead ends: 600 [2025-03-08 21:25:12,665 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-08 21:25:12,666 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 33 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:25:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3994 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:25:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-08 21:25:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 571. [2025-03-08 21:25:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 548 states have (on average 1.3759124087591241) internal successors, (754), 552 states have internal predecessors, (754), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:25:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 784 transitions. [2025-03-08 21:25:12,678 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 784 transitions. Word has length 70 [2025-03-08 21:25:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:25:12,678 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 784 transitions. [2025-03-08 21:25:12,679 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-08 21:25:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 784 transitions. [2025-03-08 21:25:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:25:12,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:25:12,680 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-08 21:25:12,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:25:12,680 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-08 21:25:12,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:25:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash 281698465, now seen corresponding path program 1 times [2025-03-08 21:25:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:25:12,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988905652] [2025-03-08 21:25:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:25:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:25:12,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:25:12,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:25:12,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:25:12,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:25:24,251 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 21:26:01,018 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-08 21:26:01,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:26:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988905652] [2025-03-08 21:26:01,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988905652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:26:01,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:26:01,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 21:26:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325577758] [2025-03-08 21:26:01,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:26:01,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:26:01,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:26:01,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:26:01,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2025-03-08 21:26:01,019 INFO L87 Difference]: Start difference. First operand 571 states and 784 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-08 21:26:02,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 21:26:07,570 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-08 21:26:08,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 21:26:12,684 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-08 21:26:14,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 21:26:18,863 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-08 21:26:22,916 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 []